Abstract：Focus on one kind of uncertains multi-robot cooperative mission, propose a dynamic optimization approach. At each optimal moment, get the transient mission condition, and the optimal cooperative mission. Decompose the entire systematic path-planning mission into two problems: path planning of individual robot and optimal path assignment problem. The fastest cooperative motion is realized. This method is proved by a simulation example of target movable formation, and it could be easily applied into other uncertain cooperative mission, thus having some degree of generality.
[1] Kazuo Sugihara,Ichiro Suzuki.Distributed Algorithms for Formation of Geometric Patterns with Many Mobile Robots,Journal of Robotic Systems,1996,13(3): 127-139 [2] Xiaoping Yun,Gokhan Alptekin.Line and Circle Formation of Distributed Physical Mobile Robots.Journal of Robotic Systems,1997,14(2): 63-76 [3] Rodney A Brooks.A Robust Layered Control System for A Mobile Robot.IEEE Journal of Robotics & Automation,RA-2,April,14-23 [4] Rodney A Brooks.A Robot that Walks Emergent behavior from A Carefully Evolved Network.Neural Computation 1:2.Summer [5] J J 摩特,S E 爱尔玛拉巴.运筹学手册.上海科学技术出版社,1987 [6] Ryo Kurazume,etc.Study on Cooperative Positioning System.Proc of IEEE on Robotics and Automation,1996 [7] Kazuo Sugihara,Ichiro Suzuki.Distributed Algorithms for Formation of Geometric Patterns with Many Mobile Robots.Journal of Robotic Systems,1996,13(3): 127-139 [8] Daisuke KURABAYASHI,etc.Cooperative Sweeping by Multiple Mobile Robots.Proc of IEEE on Robotics and Automation,1996 [9] Steven M Lavalle.Robot Motion Planning: A Game-Theoretic Foundation.Doctor dissertation,Iowa State University,1995 [10] John P Wangermann Robert F Stengel.Optimization and Coordination of Multi-agent Systems Using Principled Negotia- tion.Journal of Guidance,Control and Dynamics,1999,22(1) [11] 董胜龙,陈卫东,席裕庚.多机器人的时间最优编队.控制与决策,已录用
