Exploiting domain geometry in analogical route planning

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 9, Issue 4, 1997, Pages 509-541

  Zita, Karen ^a   Shewchuk, Jonathan Richard ^a   Veloso, Manuela M ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Adaptive similarity metrics; Analogical reasoning; Automated route planning; Case based reasoning; Path planning

Indexed keywords

EID: 0031480434     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281397147013     Document Type: Article

References (42)

1. Bern, M. and Eppstein, D. (1992) Mesh generation and optimal triangulation. In D.-Z. Du and F. Hwang (eds.), Computing in Euclidean Geometry, Vol. 1 of Lecture Notes Series on Computing (Singapore: World Scientific), pp. 23-90.
2. Branting, L. K. and Aha, D. W. (1995) Stratified case-based reasoning: reusing hierarchical problem solving episodes. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. Montré al, Canada (San Mateo, CA: Morgan Kaufmann), pp. 384-390.
3. Broos, P. and Branting, K. (1993) Compositional instance-based acquisition of preference predicates. In Case-Based Reasoning: Papers from the 1993 Workshop. Washington, DC (Menlo Park, CA: AAAI Press), pp. 70-75.
4. Bruegge, B., Blythe, J., Jackson, J. and Shufelt, J. (1992) Object-oriented system modeling with OMT. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA '92 (New York: ACM Press), pp. 359-376.
5. Carbonell, J. G., Knoblock, C. A. and Minton, S. (1990) Prodigy: An integrated architecture for planning and learning. In K. VanLehn (ed.) Architectures for Intelligence. (Hillsdale, NJ: Erlbaum). Also available as Technical Report CMU-CS-89-189, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA.
6. Carbonell, J. G. (1983) Learning by analogy: Formulating and generalizing plans from past experience. In R. S. Michalski, J. G. Carbonell, and T.M. Mitchell (eds.) Machine Learning, An Artificial Intelligence Approach (Palo Alto, CA: Tioga Press), pp. 137-162.
7. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990) Introduction to Algorithms (Cambridge, MA: MIT Press).
8. Delaunay, B. N. (1934) Sur la sphere vide. Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Matematicheskii i Estestvennyka Nauk. pp. 793-800.
9. Dijkstra, E. W. (1959) A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269-271.
10. Edelsbrunner, H. and Tan, T. S. (1993) An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry, 10: 197-213.
11. Eppstein, D. (1996) Spanning trees and spanners. Technical Report 96-16, Department of Information and Computer Science, University of California, Irvine, CA.
12. Falkenhainer, B., Forbus, K. D. and Gentner, D. (1989) The structure-mapping engine: algorithms and examples. Artificial Intelligence, 41: 1-63.
13. Fortune, S. (1992) Voronoi diagrams and Delaunay triangulations. In D.-Z. Du and F. Hwang (eds.) Computing in Euclidean Geometry, Vol. 1 of Lecture Notes Series on Computing (Singapore: World Scientific), pp. 193-233.
14. Fredman, M. L. and Tarjan, R. E. (1985) Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34(1): 209-221.
15. Goel, A., Ali, K., Donnellan, M., de Silva Garza, A. G. and Callantine, T. (1994) Multistrategy adaptive path planning. IEEE Expert, 6(6): 57-65.
16. Goodwin, R. and Simmons, R. (1992) Rational handling of multiple goals for mobile robots. In J. Hendler (ed.) Artificial Intelligence Planning Systems: Proceedings of the First International Conference, AIPS-92 College Park, MD (San Mateo, CA: Morgan Kaufmann), pp. 70-77.
17. Guibas, L. and Stolfi, J. (1985) Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4(2): 74-123.
18. Guibas, L. J., Knuth, D.E. and Sharir, M. (1992) Randomized incremental construction of Delaunay and Voronoi' diagrams. Algorithmica, 7(4): 381-413.
19. Haigh, K. Z. and Shewchuk, J. R. (1994) Geometric similarity metrics for case-based reasoning. In Case-Based Reasoning: Working Notes from the AAAI-94 Workshop (Menlo Park, CA: AAAI Press), pp. 182-187.
20. Haigh, K. Z. and Veloso, M. (1995) Route planning by analogy. In Case-Based Reasoning Research and Development, Proceedings of ICCBR-95, Sesimbra, Portugal (Berlin Germany: Springer), pp. 169-180.
21. Hammond, K. J. (1990) Case-based planning: a framework for planning from experience. Cognitive Science, 14(3): 385-443.
22. Harandi, M. T. and Bhansali, S. (1989) Program derivation using analogy. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89, Detroit, MI (San Mateo, CA: Morgan Kaufmann), pp. 389-394.
23. Holte, R. C., Mkadmi, T., Zimmer, R. M. and MacDonald, A. J. (1994) Speeding up problem-solving by abstraction: a graph-oriented approach. Technical Report TR-95-07, Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada.
24. Holyoak, K. J. and Thagard, P. (1989) Analogical mapping by constraint satisfaction. Cognitive Science, 13: 295-355.
25. Keane, M. T. (1990) Incremental analogizing: theory and model. In K. J. Gilhooly, M. T. Keane, R. Logie and G. Erdos (eds.) Lines of Thinking: Reflections on the Psychology of Thought, Vol. 1. (Chichester: Wiley).
26. Keil, J. M. and Gutwin, C. A. (1992) Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7(1): 13-28.
27. Kolodner, J. L. (1993) Case-Based Reasoning (San Mateo, CA: Morgan Kaufmann).
28. Lawson, C. L. (1977) Software for C1 surface interpolation. In J. R. Rice (ed.) Mathematical Software III. (New York: Academic) pp. 161-194.
29. Lee, D.-T. and Schachter, B. J. (1980) Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences, 9(3): 219-242.
30. Liu, B., Choo, S.-H., Lok, S.-L., Leong, S.-M., Lee, S.-C., Poon, F.-P. and Tan, H.-H. (1994) Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding. In Proceedings of the Tenth Conference on Artificial Intelligence for Applications, Los Alamitos, CA (Piscataway, NJ: IEEE Press), pp. 149-155.
31. Mitchell, J. S. B. and Papadimitriou, C. H. (1991) The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of the Association for Computing Machinery, 38(1): 18-73.
32. Newell, A., Shaw, J. C. and Simon, H. A. (1963) Empirical explorations with the logic theory machine: a case study in heuristics. In E. Feigenbaum and J. Feldman (eds.) Computers and Thought (New York: McGraw-Hill), pp. 109-133.
33. Ruppert, J. (1995) A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3): 548-585.
34. Schank, R. C. (1982) Dynamic Memory (Cambridge, MA: Cambridge University Press).
35. Shewchuk, J. R. (1996) Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In First Workshop on Applied Computational Geometry (New York, NY: ACM), pp. 124-133.
36. Sutton, R. S. (1991) Planning by incremental dynamic programming. In Machine Learning: Proceedings of the Eighth International Workshop on Machine Learning, ML91, Northwestern University, Chicago, IL (San Mateo, CA: Morgan Kaufmann), pp. 353-357.
37. Thorpe, C. E. (ed.) (1990) The CMU Navlab (Boston, MA: Kluwer Academic Publishers).
38. Thrun, S. B. (1993) Exploration and model building in mobile robot domains. In Proceedings of the IEEE International Conference on Neural Networks, San Francisco, CA: Vol. 1 (Piscataway, NJ: IEEE Press), pp. 175-180.
39. Veloso, M. M., Carbonell, J., Perez, M. A., Borrajo, D., Fink, E. and Blythe, J. (1995) Integrating planning and learning: the prodigy architecture. Journal of Experimental & Theoretical Artificial Intelligence, 7(1): 81-120.
40. Veloso, M. M. (1991) Variable-precision case retrieval in analogical problem solving. In Proceedings of the 1991 DARPA Workshop on Case-Based Reasoning (San Mateo, CA: Morgan Kaufmann), pp. 93-106.
41. fication and Reuse (Menlo Park, CA: AAAI Press), pp. 131-136.
42. Veloso, M. M. (1994) Planning and Learning by Analogical Reasoning (Berlin: Springer), PhD thesis, also available as Technical Report CMU-CS-92-174, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.