Sciweavers

ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
13 years 3 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
DCG
1998
53views more  DCG 1998»
13 years 4 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
IJRR
2002
98views more  IJRR 2002»
13 years 4 months ago
On Delaying Collision Checking in PRM Planning
: This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query
Gildardo Sánchez-Ante, Jean-Claude Latombe
IJRR
2002
66views more  IJRR 2002»
13 years 4 months ago
Morse Decompositions for Coverage Tasks
Exact cellular decompositions represent a robot's free space by dividing it into regions with simple structure such that the sum of the regions fills the free space. These de...
Ercan U. Acar, Howie Choset, Alfred A. Rizzi, Pras...
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 4 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
MVA
1990
13 years 5 months ago
Edge Visibility Regions - A New Representation of the Environment of a Mobile Robot
This paper proposes a novel representation of the free space of mobile robot by distinct, non-overlapping regions called Edge Visibility Regions (EVRs). An algorithm to partition ...
Raj Talluri, J. K. Aggarwal
CIDR
2007
141views Algorithms» more  CIDR 2007»
13 years 6 months ago
Fragmentation in Large Object Repositories
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
Russell Sears, Catharine van Ingen
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
13 years 8 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
COMPGEOM
1999
ACM
13 years 9 months ago
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
Steven A. Wilmarth, Nancy M. Amato, Peter F. Still...
DAGM
2009
Springer
13 years 11 months ago
The Stixel World - A Compact Medium Level Representation of the 3D-World
Abstract. Ambitious driver assistance for complex urban scenarios demands a complete awareness of the situation, including all moving and stationary objects that limit the free spa...
Hernán Badino, Uwe Franke, David Pfeiffer