PHA*: performing A* in unknown physical environments
暂无分享,去创建一个
[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.