Abstract
There have been several efforts to create and use real maps in computer applications that automatically find good map routes. In general, online map representations do not include information that may be relevant for the purpose of generating good realistic routes, including for example traffic patterns, construction, or number of lanes. Furthermore, the notion of a good route is dependent on a variety of factors, such as the time of the day, and may also be user dependent. This motivation leads to our work on the accumulation and reuse of previously traversed routes as cases. In this paper, we demonstrate our route planning method which retrieves and reuses multiple past routing cases that collectively form a good basis for generating a new routing plan. We briefly present our similarity metric for retrieving a set of similar routes. The metric effectively takes into account the geometric and continuous-valued characteristics of a city map. We then present the replay mechanism and how the planner produces the route plan by analogizing from the retrieved similar past routes. We discuss in particular the strategy used to merge a set of cases and generate the new route. We use illustrative examples and show some empirical results from a detailed online map of the city of Pittsburgh containing over 18,000 intersections and 25,000 street segments.
Preview
Unable to display preview. Download preview PDF.
References
Jaime G. Car bon ell, and the PRODIGY Research Group. PRODIGY4.0: The manual and tutorial. Technical Report CMU-CS-92-150, School of Computer Science, Carnegie Mellon University, June 1992.
Ashok Goel and et al. Multistrategy adaptive path planning. IEEE Expert, 6(6):57–65, December 1994.
Richard Goodwin and Reid Simmons. Rational handling of multiple goals for mobile robots. In J. Hendler, editor, Artificial Intelligence Planning Systems: Proceedings of the First International Conference (AIPS92), June 1992.
Karen Zita Haigh and Jon athan Richard Shewchuk. Geometric similarity metrics for case-based reasoning. In Case-Based Reasoning: Working Notes from the AAAI-94 Workshop, pages 182–187, Seattle, WA, August 1994. AAAI Press.
Karen Zita Haigh, Jon athan Richard Shewchuk, and Manuela M. Veloso. Route planning and learning from execution. In Working notes from the AAAI Fall Symposium “Planning and Learning: On to Real Applications”, pages 58–64, New Orleans, LA, November 1994. AAAI Press.
Bing Liu and et al. Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding. In Proceedings of the Tenth Conference on Artificial Intelligence for Applications, pages 149–55, San Antonia, TX, March 1994.
Richard S. Sutton. Planning by incremental dynamic programming. In Machine Learning: Proceedings of the 8 th International Workshop, pages 353–357. Morgan Kaufmann, 1991.
Charles E. Thorpe, editor. The CMU Navlab. Kluwer Academic Publishers, Boston, MA, 1990.
Sebastian B. Thrun. Exploration and model building in mobile robot domains. In Proceedings of the IEEE International Conference on Neural Networks, San Francisco, CA, March 1993.
Manuela M. Veloso. Automatic storage, retrieval, and replay of multiple cases. In Preprints of the AAAI 1992 Spring Symposium Series, Workshop on Computational Considerations in Supporting Incremental Modification and Reuse, Stanford University, CA, March 1992.
Manuela M. Veloso. Planning and Learning by Analogical Reasoning. Springer Verlag, December 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haigh, K.Z., Veloso, M. (1995). Route planning by analogy. In: Veloso, M., Aamodt, A. (eds) Case-Based Reasoning Research and Development. ICCBR 1995. Lecture Notes in Computer Science, vol 1010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60598-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-60598-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60598-0
Online ISBN: 978-3-540-48446-2
eBook Packages: Springer Book Archive