Sciweavers

ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 6 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
IROS
2006
IEEE
185views Robotics» more  IROS 2006»
13 years 10 months ago
Log of the inverse of the Distance Transform and Fast Marching applied to Path Planning
— This paper presents a new Path Planning method based in the inverse of the Logarithm of the Distance Transform and in the Fast Marching Method. The Distance Transform of an ima...
Santiago Garrido, Luis Moreno, Dolores Blanco, Fer...
ICRA
2006
IEEE
130views Robotics» more  ICRA 2006»
13 years 10 months ago
Voronoi Diagram and Fast Marching applied to Path Planning
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...
Santiago Garrido, Luis Moreno, Dolores Blanco
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
13 years 11 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....