By Topic

The ties that bind: motion planning for multiple tethered robots

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)
Hert, S. ; Wisconsin Univ., Madison, WI, USA ; Lumelsky, V.

An algorithm for motion planning for multiple mobile tethered robots in a common planar environment is presented. The tethers of the robots are flexible cables that can be pushed and bent by other robots during their motion. Given the start and target positions of all robots and their cables, the objective is to design a sequential motion strategy for the robots that will not entangle the robot tethers. An algorithm is described that achieves this objective while generating an ordering of the robots that produces reasonably short paths. The algorithm's complexity is O(n4), where n is the number of robots

Published in:

Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on

Date of Conference:

8-13 May 1994