Topic
Motion planning
About: Motion planning is a research topic. Over the lifetime, 32846 publications have been published within this topic receiving 553548 citations.
Papers published on a yearly basis
Papers
More filters
01 Dec 1993
TL;DR: The authors shows that four different control systems correspond to a same differential model, which presents a proof of controllability for four distinct multibody mobile robot systems.
Abstract: This paper presents a proof of controllability for a multibody mobile robot (e.g., a car pulling and pushing trailers like a luggage carrier in an airport). Such systems appear as canonical systems to illustrate the tools from differential geometric control theory required by nonholonomic motion planning. Three modeling steps are considered: geometric, differential, and control steps. The author derives the kinematic equations for four distinct multibody mobile robot systems: a convoy driven by 1) a unicycle, 2) a two-driving wheels vehicle, 3) a real car and 4) the first two bodies. He shows that these four control systems correspond to the same differential model, which is then used to give the same proof of controllability. Previous work proved the controllability of two-body systems and three-body systems. The main result of this paper is prove the controllability for a general n-body system. >
185 citations
06 Jul 2004
TL;DR: Ridid body movements, maze like problems as well as path planning problems for chain-like robotic platforms have been solved successfully using the proposed algorithm.
Abstract: We present a new approach to path planning in high-dimensional static configuration spaces. The concept of cell decomposition is combined with probabilistic sampling to obtain a method called probabilistic cell decomposition (PCD). The use of lazy evaluation techniques and supervised sampling in important areas leads to a very competitive path planning method. It is shown that PCD is probabilistic complete, PCD is easily scalable and applicable to many different kinds of problems. Experimental results show that PCD performs well under various conditions. Rigid body movements, maze like problems as well as path planning problems for chain-like robotic platforms have been solved successfully using the proposed algorithm.
185 citations
01 Mar 1987
TL;DR: A robot system capable of locating a part in an unstructured pile of objects, choose a grasp on the part, plan a motion to reach the part safely, and plan amotion to place the part at a commanded position is described.
Abstract: We describe a robot system capable of locating a part in an unstructured pile of objects, choose a grasp on the part, plan a motion to reach the part safely, and plan a motion to place the part at a commanded position. The system requires as input a polyhedral world model including models of the part to be manipulated, the robot arm, and any other fixed objects in the environment. In addition, the system builds a depth map, using structured light, of the area where the part is to be found initially. Any other objects present in that area do not have to be modeled.
185 citations
12 Nov 2000
TL;DR: A combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework based on a novel class of one-degree-of-freedom mechanisms induced by pseudo triangulations of planar point sets that yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom.
Abstract: We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom, where the known general roadmap techniques would give exponential complexity. It is based on a novel class of one-degree-of-freedom mechanisms induced by pseudo triangulations of planar point sets, for which we provide several equivalent characterization and exhibit rich combinatorial and rigidity theoretic properties. The main application is an efficient algorithm for the Carpenter's rule problem: convexify a simple bar-and-joint planar polygonal linkage using only non self-intersecting planar motions. A step in the convexification motion consists in moving a pseudo-triangulation-based mechanism along its unique trajectory in configuration space until two adjacent edges align. At that point, a local alteration restores the pseudo triangulation. The motion continues for O(n/sup 2/) steps until all the points are in convex position.
185 citations
14 Oct 2008
TL;DR: This paper presents a 3D path planing algorithm for an unmanned aerial vehicle (UAV) operating in cluttered natural environments that satisfies the upper bounded curvature constraint and the continuous curvature requirement.
Abstract: This paper presents a 3D path planing algorithm for an unmanned aerial vehicle (UAV) operating in cluttered natural environments. The algorithm satisfies the upper bounded curvature constraint and the continuous curvature requirement. In this work greater attention is placed on the computational complexity in comparison with other path-planning considerations. The rapidly-exploring random trees (RRTs) algorithm is used for the generation of collision free waypoints. The unnecessary waypoints are removed by a simple path pruning algorithm generating a piecewise linear path. Then a path smoothing algorithm utilizing cubic Bezier spiral curves to generate a continuous curvature path that satisfies the minimum radius of curvature constraint of UAV is implemented. The angle between two waypoints is the only information required for the generation of the continuous curvature path. The result shows that the suggested algorithm is simple and easy to implement compared with the Clothoids method.
185 citations