By Topic

Cooperative receding horizon path planning of multiple robots by Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guangwen Li ; Coll. of Autom.,, Northwestern Polytech. Univ., Xi''an ; Qiuling Jia

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.

Published in:

Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on

Date of Conference:

1-3 Sept. 2008