DocumentCode
3001800
Title
Cooperative receding horizon path planning of multiple robots by Genetic Algorithm
Author
Li, Guangwen ; Jia, Qiuling
Author_Institution
Coll. of Autom.,, Northwestern Polytech. Univ., Xi´´an
fYear
2008
fDate
1-3 Sept. 2008
Firstpage
2449
Lastpage
2453
Abstract
Integrating the feature of the mission and mission region of the multiple robots, taking the total rewards of the group of robots, movement nonholonomic constraints and the survival probability of the threatening area and the collision avoidance between robots into account, a reasonable objective function and constrains are formulated. Cooperative Receding Horizon Control Strategy (CRH) and Genetic Algorithm are applied to solve the optimal control law to maximize the objective function and meet the needs of constraints. Numerical simulation illustrates every target in the mission region is visited by robots and proves the validity of the proposed CRH path planning methods.
Keywords
genetic algorithms; multi-robot systems; optimal control; path planning; collision avoidance; cooperative receding horizon path planning; genetic algorithm; multiple robots; nonholonomic constraint; objective function; optimal control; survival probability; threatening area; Collision avoidance; Communication system control; Dynamic programming; Genetic algorithms; Gradient methods; Optimal control; Optimization methods; Path planning; Robot kinematics; Robotics and automation; Genetic algorithm; cooperative receding horizon control; multiple robots; path planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on
Conference_Location
Qingdao
Print_ISBN
978-1-4244-2502-0
Electronic_ISBN
978-1-4244-2503-7
Type
conf
DOI
10.1109/ICAL.2008.4636579
Filename
4636579
Link To Document