Sciweavers

696 search results - page 8 / 140
» Planning for Network-Aware Paths
Sort
View
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
ICRA
2007
IEEE
188views Robotics» more  ICRA 2007»
14 years 1 months ago
The Corridor Map Method: Real-Time High-Quality Path Planning
— A central problem in robotics is planning a collision-free path for a moving object in an environment with obstacles. Contemporary applications require a path planner that is f...
Roland Geraerts, Mark H. Overmars
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
14 years 2 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 9 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...
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