By Topic

Optimal motion planning of a multiple-robot system based on decomposition coordination

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)
Cela, A.S. ; Control & Autom. Dept., Ecole Superieure d''Ingenieur en Electrotech. et Electron., Noisy-le-Grand, France ; Hamam, Y.

The problem of the optimal control of multiple-robot systems in the presence of obstacles is solved. All the robots are subject to state and control constraints. The method is based on nonlinear programming and decomposition coordination. The problem is solved by satisfying the constraints on the states and the controls as well as those on the obstacles. To generalize the problem, NR robots with NO obstacles are considered. No distinction is made between the different types of robots, allowing the generalization of this problem to the case of mobile robots with a known work space. In order to generate an optimal control that accounts for the presence of obstacles, all robot segments and obstacles are considered as convex and compact sets in R3. An additional property is used to obtain a distance function C1. The proposed method is programmed on a VAX station and is used as a CACSD tool for the path planning of two modular assembly robots

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:8 ,  Issue: 5 )