Skip to main content

Running Tour Generation for Unknown Environments

  • Conference paper
  • First Online:
HCI International 2019 - Posters (HCII 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1033))

Included in the following conference series:

Abstract

In this paper, we present an approach to generate pleasant running tours for unknown environments. We start from a first version, able to generate basic pleasant tours, but without explicitly catering for elevation. Based on observations on how runners appreciate elevation gain and steepness and on interviews with local runners, we identified corresponding additional needs. Indeed, runners usually have specific implicit or explicit objectives or limits with respect to the elevation gain they want to target or to avoid with a tour. In consequence, we extend our first approach. We expose the algorithm we have defined to address elevation constraints during tour generation and the underlying intuitions. An important differentiator with prior art is that we address elevation constraints during the tour generation phase and not a posteriori. This means that our approach is able to efficiently generate new tours that match the user’s constraints, while prior art rather finds matching tours by searching a posteriori among a set of available tours, and only finds matching ones if they are already present.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. https://en.wikipedia.org/wiki/Naismith%27s_rule

  2. https://www.blog-course-a-pied.com/ajouter-1-kilometre-100-metres-denivele-positif/

  3. https://runnersconnect.net/hill-running-training/

  4. Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315–332 (2016)

    Article  MathSciNet  Google Scholar 

  5. Loepp, B., Ziegler, J.: Recommending running routes: framework and demonstrator. In: ComplexRec 2018 Second Workshop on Recommendation in Complex Scenarios (2018)

    Google Scholar 

  6. McGookin, D.K., Brewster, S.A.: Investigating and supporting undirected navigation for runners. In: CHI 2013 Extended Abstracts (CHI EA 2013), pp. 1395–1400. ACM, New York (2013)

    Google Scholar 

  7. Mercier, D., Schaus, P., Saint-Guillain, M., Deville, Y.: PleasantTourFinder: an application to find the most pleasant tour from a given location. Master thesis, Catholic University of Louvain (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jutta Willamowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Willamowski, J., Clinchant, S., Legras, C., Michel, S., Shreepriya, S. (2019). Running Tour Generation for Unknown Environments. In: Stephanidis, C. (eds) HCI International 2019 - Posters. HCII 2019. Communications in Computer and Information Science, vol 1033. Springer, Cham. https://doi.org/10.1007/978-3-030-23528-4_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23528-4_72

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23527-7

  • Online ISBN: 978-3-030-23528-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics