Sciweavers

366 search results - page 24 / 74
» Parallel Search Algorithms for Robot Motion Planning
Sort
View
SASO
2008
IEEE
15 years 4 months ago
Connectivity Service for Mobile Ad-Hoc Networks
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
Alejandro Cornejo, Nancy A. Lynch
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
15 years 2 months 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...
AAAI
2008
14 years 12 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
15 years 3 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
84
Voted
ICRA
1999
IEEE
110views Robotics» more  ICRA 1999»
15 years 1 months ago
Range-Sensor Based Navigation in Three Dimensions
This paper presents a new globally convergent rangesensor based navigation algorithm in three-dimensions, called 3DBug. The 3DBug algorithm navigates a point robot in a three-dime...
Ishay Kamon, Ehud Rivlin, Elon Rimon