Sciweavers

108 search results - page 5 / 22
» A Maneuvering-Board Approach to Path Planning with Moving Ob...
Sort
View
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 10 days ago
Real-Time Obstacle Avoidance for Polygonal Robots with a Reduced Dynamic Window
In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model ...
Kai Oliver Arras, Jan Persson, Nicola Tomatis, Rol...
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
13 years 11 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...
IJRR
2002
87views more  IJRR 2002»
13 years 7 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
13 years 5 months ago
Real-world robot navigation amongst deformable obstacles
Abstract-- In this paper, we consider the problem of mobile robots navigating in environments with non-rigid objects. Whereas robots can plan their paths more effectively when they...
Barbara Frank, Cyrill Stachniss, Ruediger Schmeddi...
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
14 years 2 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason