Skip to main content

Customized Walk Paths for the Elderly

  • Conference paper
  • First Online:
  • 2107 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 918))

Abstract

Nowadays a large number of applications rely on appropriate path planning stressing the importance of such algorithms. Usually the path planning can be adjusted by the transportation type (walking, cycling, driving) and special restrictions as roads blockages. However these adjustments are not enough for other tasks such as planning a walk path of a given size for the elderly, a tourist office application for planning a journey based on desired points of interest to visit, among other.

A project named Smartwalk dedicated to helping the elderly in taking an appropriate amount of steps each day, for improving their autonomy, independence and functional capacity, needs to take into account several factors in the path planning. Some are related to avoiding problematic areas such as stairs or slippery streets, also, to increase the chance of long term adoption, it is important that people exercise in familiar environments. So, the objective is to allow plan routes through places where people live, including points of interest such as gardens and touristic places, and avoiding areas more difficult or less desirable for people (e.g. streets with stairs).

In this paper we describe how the project is being deployed in Águeda - Portugal, a city with less than 50 k inhabitants and featuring a data communication infrastructure in its urban area. A demonstration of the algorithm working and some performance tests are presented and discussed.

Research funded by CENTRO-01-0145-FEDER-024293, project SmartWalk: Smart Cities for Active Seniors.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. OpenStreetMap. https://www.openstreetmap.org. Accessed 04 July 2018

  2. Appsomania: GPS Map Route Planner. https://play.google.com/store/apps/details?id=com.gps.route.planner.map. Accessed 11 June 2018

  3. Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49–76 (2007)

    Article  Google Scholar 

  4. Chen, P., Zhang, X., Chen, X., Liu, M.: Path planning strategy for vehicle navigation based on user habits. Appl. Sci. 8(3) (2018). https://doi.org/10.3390/app8030407, http://www.mdpi.com/2076-3417/8/3/407

    Article  Google Scholar 

  5. Chmait, N., Challita, K.: Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem. Comput. Sci. Inf. Technol. 1(3), 208–224 (2013)

    Google Scholar 

  6. Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)

    Article  Google Scholar 

  7. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G.: A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3), 291–328 (2014)

    Article  Google Scholar 

  8. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Tasoulas, Y.: Cluster-based heuristics for the team orienteering problem with time windows. In: International Symposium on Experimental Algorithms, pp. 390–401. Springer (2013)

    Google Scholar 

  9. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N.: Heuristics for the time dependent team orienteering problem: application to tourist route planning. Comput. Oper. Res. 62, 36–50 (2015)

    Article  MathSciNet  Google Scholar 

  10. I-Ming, C., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996)

    Article  Google Scholar 

  11. JiTT.travel: JiTT Coimbra. http://www.turismodecoimbra.pt/aplicacoes/. Accessed 11 June 2018

  12. Jones, M.T.: Al Application Programming (2003)

    Google Scholar 

  13. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  Google Scholar 

  14. Moeller, C.: osm2po. http://osm2po.de. Accessed 04 July 2018

  15. de Pardieu, F.: Redefining Mobile in Travel. https://www.mtrip.com. Accessed 11 June 2018

  16. Sensis: Voyager. https://play.google.com/store/apps/details?id=com.sensis.voyager.app. Accessed 11 June 2018

  17. Sun, Q., Wan, W., Chen, G., Feng, X.: Path planning algorithm under specific constraints in weighted directed graph. In: 2016 International Conference on Audio, Language and Image Processing (ICALIP), pp. 635–640. IEEE (2016)

    Google Scholar 

  18. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)

    Article  Google Scholar 

  19. Vansteenwegen, P.: Planning in tourism and public transportation. Ph.D. thesis. Springer (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mário Rodrigues .

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

Amaral, J., Rodrigues, M., Gonçalves, L.J., Teixeira, C. (2019). Customized Walk Paths for the Elderly. In: Rocha, Á., Ferrás, C., Paredes, M. (eds) Information Technology and Systems. ICITS 2019. Advances in Intelligent Systems and Computing, vol 918. Springer, Cham. https://doi.org/10.1007/978-3-030-11890-7_71

Download citation

Publish with us

Policies and ethics