Geometric Travel Planning

by Stefan Edelkamp, Shahid Jabbar, and Thomas Willhalm.
To appear in IEEE International Conference on Intelligent Transportation Systems (ITCS), Shanghai, China, 2003

Abstract

This paper provides a novel approach for optimal route planning making efficient use of the underlying geometrical structure. It combines classical AI exploration with computational geometry. Given a set of global positioning system (GPS) trajectories, the input is refined by geometric filtering and rounding algorithms. For constructing the graph and the according point localization structure, fast scan-line and divide-and-conquer algorithms are applied.

For speeding up the optimal on-line search algorithms, the geometrical structure of the inferred weighted graph is exploited in two ways. The graph is compressed while retaining the original information for unfolding resulting shortest paths. It is then annotated by lower bound and refined topographic information; for example by the bounding boxes of all shortest paths that start with a given edge. The on-line planning system GPS-ROUTE implements the above techniques and provides a client-server web interface to answer series of shortest-path or shortest-time queries.

Geometric Travel Planning (PDF)


Copyright notice

Copyright 2003 IEEE. Reprinted from proceedings of IEEE International Conference on Intelligent Transportation Systems (ITCS) - 2003 (To appear).

This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.