Sciweavers

75 search results - page 6 / 15
» Path-Planning by Tessellation of Obstacles
Sort
View
IROS
2006
IEEE
147views Robotics» more  IROS 2006»
14 years 3 months ago
Opportunistic Use of Vision to Push Back the Path-Planning Horizon
Abstract— Mobile robots need maps or other forms of geometric information about the environment to navigate. The mobility sensors (LADAR, stereo, etc.) on these robotic vehicles ...
Bart C. Nabbe, Derek Hoiem, Alexei A. Efros, Marti...
ICRA
2009
IEEE
248views Robotics» more  ICRA 2009»
14 years 4 months ago
Moving obstacle detection in highly dynamic scenes
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 11 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...
STAIRS
2008
143views Education» more  STAIRS 2008»
13 years 11 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek
IJRR
2002
87views more  IJRR 2002»
13 years 9 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