By Topic

Robot group formations: a dynamic programming approach for a shortest path computation

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
$33 $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)
F. Gentili ; Dipt. di Inf. Sistemi e Produzione, Univ. di Roma Tor Vergata, Italy ; F. Martinelli

Rigid formations of mobile robots are to be used for special missions in which the task-execution requires a tight cooperation of all units in the group so as to constrain them to keep preassigned mutual distances. In the paper an algorithm for the optimal path-planning of rigid formations of mobile robots is considered for a case in which the path cost index is given by the sum of all distances covered by the robots in the group. The proposed solution method provides an approximate solution to the problem based on a discretization of the configuration space of the formation. A dynamic programming algorithm is used then to find the optimal path in configuration space. Several examples are introduced to show the effectiveness of the proposed dynamic programming method as compared to three heuristic strategies which are also devised in the paper

Published in:

Robotics and Automation, 2000. Proceedings. ICRA '00. IEEE International Conference on  (Volume:4 )

Date of Conference: