Exploiting domain geometry in analogical route planning

Abstract. Automated route planning consists of using real maps to automatically find good map routes. Two shortcomings to standard methods are (1) that domain information may be lacking, and (2) that a ‘good’ route can be hard to define. Most on-line map representations do not include information that may be relevant for the purpose of generating good realistic routes, such as traffic patterns, construction, and one-way streets. The notion of a good route is dependent not only on geometry (shortest path),but also on a variety of other factors, such as the day and time, weather conditions,and perhaps most importantly,user-dependent preferences. These features can be learned by evaluating real-world execution experience. These difficulties motivate our work on applying analogical reasoning to route planning. Analogical reasoning is a method of using past experience to improve problem solving performance in similar new situations.Our approach consists of the accumulation and reuse of previously traversed rou...

[1]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[2]  Robert C. Holte,et al.  Speeding up Problem Solving by Abstraction: A Graph Oriented Approach , 1996, Artif. Intell..

[3]  Bing Liu,et al.  Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding , 1994, Proceedings of the Tenth Conference on Artificial Intelligence for Applications.

[4]  Sebastian Thrun,et al.  Exploration and model building in mobile robot domains , 1993, IEEE International Conference on Neural Networks.

[5]  Mehdi T. Harandi,et al.  Program Derivation Using Analogy , 1989, IJCAI.

[6]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[7]  Tiow Seng Tan,et al.  An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[8]  J. C. Shaw,et al.  Empirical explorations of the logic theory machine: a case study in heuristic , 1899, IRE-AIEE-ACM '57 (Western).

[9]  Oren Etzioni,et al.  PRODIGY: an integrated architecture for planning and learning , 1991, SGAR.

[10]  David W. Aha,et al.  Stratified Case-Based Reasoning: Reusing Hierarchical Problem Solving Episodes , 1995, IJCAI.

[11]  Karl Branting,et al.  Compositional Instance-Based Acquisition of Preference Predicates , 1993 .

[12]  Joseph S. B. Mitchell,et al.  The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[15]  J. Shewchuk,et al.  Geometric Similarity Metrics for Case-Based Reasoning , 1994 .

[16]  C. Lawson Software for C1 Surface Interpolation , 1977 .

[17]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[18]  Paul Thagard,et al.  Analogical Mapping by Constraint Satisfaction , 1989, Cogn. Sci..

[19]  Brian Falkenhainer,et al.  The Structure-Mapping Engine: Algorithm and Examples , 1989, Artif. Intell..

[20]  Richard S. Sutton,et al.  Planning by Incremental Dynamic Programming , 1991, ML.

[21]  Ashok K. Goel,et al.  Multistrategy adaptive path planning , 1994, IEEE Expert.

[22]  Janet L. Kolodner,et al.  Case-Based Reasoning , 1989, IJCAI 1989.

[23]  Karen Zita Haigh,et al.  Route Planning by Analogy , 1995, ICCBR.

[24]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[25]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

[26]  Bernd Brügge,et al.  Object-oriented system modeling with OMT , 1992, OOPSLA.

[27]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[28]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[29]  Richard Goodwin,et al.  Rational Handling of Multiple Goals for Mobile Robots , 1992 .

[30]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[31]  Kristian J. Hammond,et al.  Case-Based Planning: A Framework for Planning from Experience , 1990, Cogn. Sci..

[32]  Allen Newell,et al.  Empirical explorations with the logic theory machine: a case study in heuristics , 1995 .