Real-Time Edge Follow: A Real-Time Path Search Approach

Real-time path search is the problem of searching a path from a starting point to a goal point in real-time. In dynamic and partially observable environments, agents need to observe the environment to track changes, explore to learn unknowns, and search suitable routes to reach the goal rapidly. These tasks frequently require real-time search. In this paper, we address the problem of real-time path search for grid-type environments; we propose an effective heuristic method, namely a real-time edge follow alternative reduction method (RTEF-ARM), which makes use of perceptual information in a real-time search. We developed several heuristics powered by the proposed method. Finally, we generated various grids (random-, maze-, and U-type), and compared our proposal with real-time A*, and its extended version real-time A* with n-look-ahead depth; we obtained very significant improvements in the solution quality.

[1]  Raúl Hector Gallard,et al.  Genetic algorithms + Data structure = Evolution programs , Zbigniew Michalewicz , 1999 .

[2]  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.

[3]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

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

[5]  James J. Kuffner,et al.  Goal-Directed Navigation for Animated Characters Using Real-Time Path Planning and Control , 1998, CAPTECH.

[6]  Amit Konar,et al.  Artificial Intelligence and Soft Computing: Behavioral and Cognitive Modeling of the Human Brain , 1999 .

[7]  Jean-Claude Latombe,et al.  Fast synthetic vision, memory, and learning models for virtual humans , 1999, Proceedings Computer Animation 1999.

[8]  Faruk Polat,et al.  Real-Time Edge Follow: A New Paradigm to Real-Time Path Search , 2001, GAME-ON.

[9]  Kokichi Sugihara,et al.  Genetic Algorithms for Adaptive Planning of Path and Trajectory of a Mobile Robot in 2D Terrains , 1999 .

[10]  Richard E. Korf,et al.  Moving-Target Search: A Real-Time Search for Changing Goals , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[12]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[13]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[14]  Toru Ishida,et al.  Real-Time Bidirectional Search: Coordinated Problem Solving in Uncertain Situations , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[16]  Shashi Shekhar,et al.  Dynoraii: a Real-Time Planning Algorithm , 1993, Int. J. Artif. Intell. Tools.

[17]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[18]  David Furcy,et al.  Incremental Heuristic Search in Artificial Intelligence , 2004 .

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

[20]  Sven Koenig,et al.  A comparison of fast search methods for real-time situated agents , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[21]  Manuela M. Veloso,et al.  Real-Time Randomized Path Planning for Robot Navigation , 2002, RoboCup.

[22]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[23]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[24]  Toru Ishida,et al.  Controlling the learning process of real-time heuristic search , 2003, Artif. Intell..

[25]  Sven Koenig,et al.  Improved fast replanning for robot navigation in unknown terrain , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).