Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles

The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots' paths and speeds to avoid collisions in multi-agent environment.

[1]  Anthony Stentz.  Map-Based Strategies for Robot Navigation in Unknown Environments , 1998 .

[2]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[3]  Piotr Skrzypczynski,et al.  Cooperative Perception and World-Model Maintenance in Mobile Navigation Tasks , 1998, DARS.

[4]  Oded Maron,et al.  Visible Decomposition: Real-Time Path Planning in Large Planar Environments , 1996 .

[5]  Barry Brumitt,et al.  Dynamic mission planning for multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  Takeo Kanade,et al.  Intelligent Autonomous Systems , 1991, Robotics Auton. Syst..

[7]  Barry Brumitt,et al.  Framed-quadtree path planning for mobile robots operating in sparse environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

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

[9]  Alessandro Saffiotti,et al.  Robust Execution of Robot Plans Using Fuzzy Logic , 1993, Fuzzy Logic in Artificial Intelligence.

[10]  Vladimir J. Lumelsky,et al.  Sensor-based motion planning for multiple mobile robots in an uncertain environment , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).