Sciweavers

696 search results - page 17 / 140
» Planning for Network-Aware Paths
Sort
View
IROS
2007
IEEE
92views Robotics» more  IROS 2007»
14 years 1 months ago
A space decomposition method for path planning of loop linkages
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
Josep M. Porta, Juan Cortés, Lluís R...
ROBOCOMM
2007
IEEE
14 years 1 months ago
Path planning using Shi and Karl level sets
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
Randeep Singh, Nagaraju Bussa
FDG
2009
ACM
14 years 2 months ago
Indicative routes for path planning and crowd simulation
An important challenge in virtual environment applications is to steer virtual characters through complex and dynamic worlds. The characters should be able to plan their paths and...
Ioannis Karamouzas, Roland Geraerts, Mark H. Overm...
IJRR
2008
75views more  IJRR 2008»
13 years 7 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
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