An adjustable force field for multiple robot mission and path planning

Mission and path planning for multiple robots in dynamic environments is required when multiple mobile robots or unmanned vehicles are used for geographically distributed tasks. Assigning tasks and paths for robots for cooperatively accomplishing a mission of reaching to number of target points are addressed in this paper. The methodology that is proposed is based on using an adjustable force field which is suitable for dynamic environment. From the force field analysis, the decisions to assign tasks for each robot are then made. The force field is also used to plan a collision free path for each robot. Adjustable weights for the force field model are proposed to satisfy the constraints of the motion. In this research, the constraints are the cooperation of the robots, the precedence between the targets and between robots, and the discrimination between different obstacles. Two simulations for mission and path planning in 2D and 3D dynamic spaces with multiple robots are presented based on the proposed adjustable force filed. The result of the mission and path planning for three robots cooperatively doing eight target points are shown.

[1]  Raffaello D'Andrea,et al.  Path Planning for Unmanned Aerial Vehicles in Uncertain and Adversarial Environments , 2003 .

[2]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[3]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[4]  Huang Hai A Path Planning Algorithm Based on Potential Field for Complex Enviroment , 2004 .

[5]  Jun Ota,et al.  Motion planning of multiple mobile robots for Cooperative manipulation and transportation , 2003, IEEE Trans. Robotics Autom..

[6]  Kay Chen Tan,et al.  Evolutionary artificial potential fields and their application in real time robot path planning , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[7]  Shuzhi Sam Ge,et al.  Dynamic Motion Planning for Mobile Robots Using Potential Field Method , 2002, Auton. Robots.

[8]  Brian Capozzi,et al.  EVOLUTIONARY APPROACHES TO PATH PLANNING THROUGH UNCERTAIN ENVIRONMENTS , 2002 .

[9]  O. Castilho,et al.  Multiple Objective Optimization Genetic Algorithms For Path Planning In Autonomous Mobile Robots , 2005, Int. J. Comput. Syst. Signals.

[10]  Randal W. Beard,et al.  Synchronization of Information in Distributed Multiple Vehicle Coordinated Control , 2003 .

[11]  Vladimir J. Lumelsky,et al.  Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model , 1997, Auton. Robots.

[12]  David A. Schoenwald,et al.  Decentralized control of cooperative robotic vehicles: theory and application , 2002, IEEE Trans. Robotics Autom..

[13]  Hyochoong Bang,et al.  Cooperative Control of Multiple Unmanned Aerial Vehicles Using the Potential Field Theory , 2006 .