75 search results - page 7 / 15 » Path-Planning by Tessellation of Obstacles |
AAAI
2004
13 years 11 months ago
2004
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— We present an on-line, robust, and efficient path planner for the redundant Mitsubishi PA-10 arm with 7 degrees of freedom (DOF) in non-stationary environments. Because of the...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper we demonstrate path planning for our formation space that represents permutation-invariant multirobot formations. Earlier methods generally pre-assign roles for e...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— 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...
ICRA
1993
IEEE
14 years 1 months ago
1993
IEEE
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...