Bound to help: cooperative manipulation of objects via compliant, unactuated tails

  title={Bound to help: cooperative manipulation of objects via compliant, unactuated tails},
  author={Young-Ho Kim and Dylan A. Shell},
  journal={Autonomous Robots},
We examine the problem of moving multiple objects to goal locations by a coordinated team of mobile robots. Each robot is equipped with an unactuated, compliant chain attached as an appendage that we call its tail. Each of our robots tow objects by wrapping their tail around an item, securing it by hooking the end of the tail back onto itself, and then dragging. In addition to towing individually, any two robots wishing to operate within a tightly-knit sub-team are able to link the ends of… 
1 Citations
Motion Planning for a Pair of Tethered Robots
The present paper shows how the reduced visibility graph provides a natural discretization and captures the essential topological considerations very effectively for the two robot case as well, and introduces a rather more involved formalization than prior single-robot work to establish the core theoretical result.


Using a Compliant, Unactuated Tail to Manipulate Objects
Experiments show that a robot with a passive tail can manipulate cylindrical objects with (quasi-static) dragging, dynamic striking motions, and combinations thereof, and the complementary nature of dynamic and quasi-static motions are analyzed.
Efficient and complete centralized multi-robot path planning
Simulated experiments compare the proposed approach with several other centralized and decoupled planners, and show that the proposed technique improves computation time and solution quality, while scaling to problems with 100s of robots, solving them in under 5 seconds.
The Tethered Robot Problem
  • F. Sinden
  • Computer Science
    Int. J. Robotics Res.
  • 1990
The technical problem outlined above leads in particular to the following mathematical problem: identify those rectilin ear drawings of the complete bipartite graph whose edges can be colored with n colors so that no two edges of the same color have common points (includ ing endpoints).
k-color multi-robot motion planning
The algorithm successfully and efficiently copes with a variety of challenging scenarios, involving many robots, while a simplified version of this algorithm, that can be viewed as an extension of a prevalent sampling-based algorithm for the k-color case, fails even on simple scenarios.
Moving furniture with teams of autonomous robots
  • D. Rus, B. Donald, J. Jennings
  • Computer Science
    Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots
  • 1995
The authors formalize the notion of resource tradeoffs for robot protocols and give the tradeoffs in the information invariant framework for four cooperative manipulation protocols that use different amounts of state, sensing, and communication.
Multi-robot manipulation via caging in environments with obstacles
We present a decentralized approach to multi- robot manipulation where the team of robots surround and trap an object and transport it, by dragging or pushing, to the goal configuration in an
Cooperative Towing With Multiple Robots
In this paper, we address the cooperative towing of payloads by multiple mobile robots that move in the plane. Robots pull via cables attached to an object or a pallet carrying a payload and they
A topological approach to using cables to separate and manipulate sets of objects
The goal in this paper is to automate the task of separating the objects of interest from a collection of objects by manipulating them with cables that are actuated only at the ends, and then transporting them to specified destinations.
CAMPOUT: a control architecture for tightly coupled coordination of multirobot systems for planetary surface exploration
An enabling distributed control architecture called control architecture for multiro Bot planetary outposts (CAMPOUT), wherein integrated multirobot mobility and control mechanisms are derived as group compositions and coordination of more basic behaviors under a task-level multiagent planner.
Planning motions for a planar robot attached to a stiff tether
This work examines the problem of planning motions of a planar robot connected via a cable of limited length to a fixed point in ℝ2 when the tether has a constraint on its curvature, which adds appreciably to the realism of the cable model over existing work.