Calculating meeting points for multi user pedestrian navigation systems

Authors:
Bjoern Zenker;Alexander Muench
Affiliations:
University of Erlangen-Nuernberg, Erlangen, Germany;University of Erlangen-Nuernberg, Erlangen, Germany
Venue:
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Year:
2011

Citing 6
Cited 0

Steiner problem in networks: a survey

Networks
The Generation of Minimal Trees with a Steiner Topology

Journal of the ACM (JACM)
A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search

Geoinformatica
Finding time-dependent shortest paths over large graphs

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
RouteCheckr: personalized multicriteria routing for mobility impaired pedestrians

Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility
Refined route instructions using topological stages of closeness

W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Most pedestrian navigation systems are intended for single users only. But pedesterians often prefere going out with other people, meeting friends and covering distances together. Thus we built a navigation system which allows calculating routes for multiple people who want to meet departing at different locations. In this paper we present, how satisfying meeting points can be found. We discuss two approaches, one based on the Steiner Tree Problem in Networks and one based on the Euclidian Steiner Problem which neglects the street network. Both approaches are evaluated and a user study demonstrates the applicability of our solution.