8 search results - page 2 / 2 » Nonholonomic Path Planning with Inequality Constraints |
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— When navigating in an unknown environment for the first time, a natural behavior consists in memorizing some key views along the performed path, in order to use these referenc...