Sciweavers

603 search results - page 5 / 121
» Motion Planning for Multiple Robots
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICRA
2009
IEEE
115views Robotics» more  ICRA 2009»
14 years 2 months ago
Multi-robot coordination using generalized social potential fields
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
TROB
2008
164views more  TROB 2008»
13 years 7 months ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 21 days ago
Towards Sensor Based Coverage with Robot Teams
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
DeWitt Latimer IV, Siddhartha S. Srinivasa, Vincen...
ICRA
2003
IEEE
139views Robotics» more  ICRA 2003»
14 years 1 months ago
Vehicle motion planning using stream functions
– Borrowing a concept from hydrodynamic analysis, this paper presents stream functions which satisfy Laplace’s equation as a local-minima free method for producing potential-...
Stephen Waydo, Richard M. Murray