PHA*: performing A* in unknown physical environments

We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territories. We present the Physical-A* algorithm (PHA*) to solve such a problem. PHA* is a two-level algorithm in which the upper level is A*, which chooses the next node to expand and the lower level directs the agent to that node in order to explore it. The complexity of this algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes as in classical A*. We present a number of variations of both the upper level and lower level algorithms and compare them both experimentally and theoretically. We then generalize our algorithm to the multi-agent case where a number of cooperative agents are designed to solve this problem and show experimental implementation for such a system.

[1]  Kevin Knight,et al.  Are Many Reactive Agents Better Than a Few Deliberative Ones? , 1993, IJCAI.

[2]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  T. Lindvall ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[4]  Azriel Rosenfeld,et al.  Learning in Navigation Goal Finding in Graphs , 1996, Int. J. Pattern Recognit. Artif. Intell..

[5]  Elon Rimon,et al.  Roadmap-A*: An algorithm for minimizing travel e ort in sensor based mobile robot navigation , 1998 .

[6]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[7]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[8]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[9]  Anthony Stentz Optimal and efficient path planning for partially-known environments , 1994 .

[10]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

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

[12]  Yasuhiko Kitamura,et al.  Organizational Strategies for Multiagent Real-time Search , 1996 .

[13]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[14]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.