Abstract：This paper deals with coordination and obstacle (or collision) avoidance between mobile robots in conflict areas, that is, intersections. The planning approach both concentrated and distributed is adopted. Each mobile robot's path is planned according to the topological structure of the system; the distributed planning for motion characteristics of each robot is given using priority strategy in intersections. The intelligence of the whole system is improved by blending intelligence of the high and low levels. At the same time, a set of traffic rules is set up to make planning for the system easier and each robot in the system reachs the goal position of itself with safety as quickly as it can. In order to deal with the uncertainty introduced by the dynamic world, the planner operates periodically. At last, an emulation result is given.
[1] 欧锦军,朱枫.一种多移动机器人避碰规划方法.机器人, 2000, 22(6):474-481 [2] 李贻斌,周风余,李彩虹,刘明.移动机器人在线路径规划算法研究.系统工程与电子技术,2000,22(2):79-81 [3] P Fiorini, Z Shiller. Robot motion planning in dynamic environments. In: G Girald, G Hirzinger. International?Symposium of Robotic Research. Munich, Germany: Springer-Verlag, October 1995,237-248 [4] Th Fraichard, C Laugier, G Lievin. Robot motion planning-the case of non-holonomic mobiles in a dynamic world. In: Proc of the IEEE/RSJ Int Workshop on Intelligent Robots and Systems Japan, July 1990, 757-764 [5] Jaydev P Desai. Motion Planning and Control of Cooperative Robotic Systems [PhD thesis]. University of Pennsylvania, October,1998 [6] Christopher M Clark, Stephen Rock. Randomized motion planning for groups of nonholonomic robots. In: Proceedings of the 6th International Symposium on Artificial Intelligence, Robotics, and Automation in Space Canada, June 2001 [7] Th Fraichard, Y Demazeau. Motion Planning in a Multi-Agent World. In: Y. Demazeau J P Muller. Decentralized AI: Proceedings of the First 22 European Workshop on Modeling Autonomous Agents in a Multi-Agent World. Amsterdam, The Netherlands: Elsevier Science, 1990,137-153
