A pedestrian-oriented map matching algorithm for map information sharing systems in disaster areas
by Koichi Asakura; Masayoshi Takeuchi; Toyohide Watanabe
International Journal of Knowledge and Web Intelligence (IJKWI), Vol. 3, No. 4, 2012

Abstract: In this paper, we propose a pedestrian-oriented map matching algorithm for tracking moving trajectories of pedestrians. Our algorithm is designed for a map information sharing system among refugees in disaster areas. In this situation, refugees have mobile terminals with GPS devices and move to shelters at walking speed. Thus, our algorithm has to be suitable for battery-driven mobile terminals. In order to reduce battery consumption, our algorithm is based on a geometric curve-to-curve matching approach in which computation resources are less required in comparison with other complicated approaches such as probabilistic map matching, statistical map matching and so on. Furthermore, in order to deal with matching errors, our algorithm has following features: initial matching point selection, candidate road segments selection and incremental matching method. We conduct experiments with real time sequence data captured by GPS. Experimental results shows that our proposed algorithm can achieve the best result in comparison with the other conventional geometric map matching methods.

Online publication date: Thu, 04-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge and Web Intelligence (IJKWI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com