PHA*: Finding the shortest path with A* in an unknown physical environment

Journal of Artificial Intelligence Research

Volumn 21, Issue , 2004, Pages 631-670

  Felner, Ariel ^a   Stern, Roni ^b   Ben Yair, Asaph ^b   Kraus, Sarit ^b   Netanyahu, Nathan ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

TRAVELING AGENTS;

PROBLEM SOLVING;

EID: 27344457746     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1373     Document Type: Review

References (32)

1. Argamon-Engelson, S., Kraus, S., & Sina, S. (1998). Utility-based on-line exploration for repeated navigation in an embedded graph. Artificial Intelligence, 101(1-2), 967-984.
2. Argamon-Engelson, S., Kraus, S., & Sina, S. (1999). Interleaved vs. a priori exploration for repeated navigation in a partially-known graph. International Journal of Pattern Recognition and Artificial Intelligence, 13(7), 963-968.
3. Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1993). The Quickhull algorithm for convex hull. Tech. rep., Geometry Center Technical Report GCG53, University of Minnesota.
4. Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90.
5. Bender, M. A., Fernandez, A., Ron, D., Sahai, A., & Vadhan, S. P. (1998). The power of a pebble: Exploring and mapping directed graphs. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pp. 269-278, Dallas, Texas.
6. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to Algorithms. MIT Press, Cambridge, Massachusetts. 2nd edition.
7. Cucka, P., Netanyahu, N. S., & Rosenfeld, A. (1996). Learning in navigation: Goal finding in graphs. International Journal of Pattern Recognition and Artificial Intelligence, 10(5), 429-446.
8. Dechter, R., & Pearl, J. (1985). Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery, 32(3), 505-536.
9. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269-271.
10. Felner, A., Kraus, S., & Korf, R. E. (2003). KBFS: K-best first search. Annals of Mathematics and Artificial Intelligence, in press.
11. Felner, A., Stern, R., & Kraus, S. (2002). PHA*: Performing A* in unknown physical environments. In Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 240-247, Bologna, Italy.
12. Ghosh, B. (1951). Random distances within a rectangle and between two rectangles. Bulletin of the Culcutta Mathematical Society, 43, 17-24.
13. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SCC-4(2), 100-107.
14. Kaelbling, L. P., & Moore, A. W. (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4, 237-285.
15. Karp, R., & Pearl, J. (1983). Searching for an optimal path in a tree with random costs. Artificial Intelligence, 21(1-2), 99-116.
16. Kitamura, Y., Teranishi, K., & Tatsumi, S. (1996). Organizational strategies for multi-agent real-time search. In Proceedings of the Second International Conference on Multi-Agent Systems, 409-416.
17. Knight, K. (1993). Are many reactive agents better than a few deliberative ones?. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 432-437, Chambéry, France.
18. Koenig, S., & Likhachev, M. (2002a). D* lite. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), pp. 476-483, Edmonton, Canada.
19. Koenig, S., & Likhachev, M. (2002b). Incremental A*. In Advances in Neural Information Processing Systems 14 (NIPS). MIT Press, Cambridge, MA.
20. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
21. Korf, R. E. (1990). Real-time heuristic search. Artificial Intelligence, 42(3), 189-211.
22. Korf, R. E. (1993). Linear-space best-first search. Artificial Intelligence, 62(1), 41-78.
23. Korf, R. E. (1997). Finding optimal solutions to Rubik's Cube using pattern databases. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 700-705, Providence, Rhode Island.
24. Korf, R. E. (1999). Sliding-tile puzzles and Rubik's Cube in AI research. IEEE Intelligent Systems, 14, 8-12.
25. Okabe, A., Boots, B., & Sugihara, K. (1992). Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams. Wiley, Chichester, UK.
26. Pearl, J., & Kim, J. H. (1982). Studies in semi-admissible heursitics. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4, 392-400.
27. Shmoulian, L., & Rimon, E. (1998). Roadmap-A*: An algorithm for minimizing travel effort in sensor based mobile robot navigation. In Proceedings of the IEEE International Conference on Robotics and Automation, pp. 356-362, Leuven, Belgium.
28. Stentz, A. (1994). Optimal and efficient path planning for partially-known environments. In Proceedings of the IEEE International Conference on Robotics and Automation, pp. 3310-3317, San Diego, CA.
29. Stern, R. (2001). Optimal Path Search in Unknown Physical Enviroments. M.Sc. Thesis, Department of Computer Science, Bar-Ilan University, Israel; available on http://www.cs.biu.ac.il/~felner.
30. Taylor, L., & Korf, R. (1993). Pruning duplicate nodes in depth-first search. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 756-761, Washington, D.C.
31. Wagner, A., & Bruckstein, A. M. (2000). ANTS: Agents, networks, trees, and subgraphs. Future Generation Computer Systems Journal, 16(8), 915-926.
32. Yanovski, V., Wagner, I. A., & Bruckstein, A. M. (2001). Vertex-ant-walk: A robust method for efficient exploration of faulty graphs. Annals of Mathematics and Artificial Intelligence, 31(1-4), 99-112.