Sciweavers

75 search results - page 8 / 15
» Path-Planning by Tessellation of Obstacles
Sort
View
IROS
2007
IEEE
138views Robotics» more  IROS 2007»
14 years 4 months ago
Obstacle detection from IPM and super-homography
— We present in this article a simple method to estimate an IPM view from an embedded camera. The method is based on the tracking of the road markers assuming that the road is lo...
Nicolas Simond, Michel Parent
IROS
2006
IEEE
94views Robotics» more  IROS 2006»
14 years 3 months ago
Spline-Based Robot Navigation
— This paper offers a path planning algorithm based on splines. The sought path avoids the obstacles, and is smooth and short. Smoothing is used as an integral part of the algori...
Evgeni Magid, Daniel Keren, Ehud Rivlin, Irad Yavn...
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 2 months 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...
VC
2008
85views more  VC 2008»
13 years 9 months ago
Real-time crowd motion planning
Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Con...
Barbara Yersin, Jonathan Maïm, Fiorenzo Morin...
IJRR
2008
75views more  IJRR 2008»
13 years 9 months ago
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
Jur P. van den Berg, Mark H. Overmars