Motion planning

About: Motion planning is a research topic. Over the lifetime, 32846 publications have been published within this topic receiving 553548 citations.

Path Planning and Tracking for Vehicle Collision Avoidance Based on Model Predictive Control With Multiconstraints

Abstract: A path planning and tracking framework is presented to maintain a collision-free path for autonomous vehicles. For path-planning approaches, a 3-D virtual dangerous potential field is constructed as a superposition of trigonometric functions of the road and the exponential function of obstacles, which can generate a desired trajectory for collision avoidance when a vehicle collision with obstacles is likely to happen. Next, to track the planned trajectory for collision avoidance maneuvers, the path-tracking controller formulated the tracking task as a multiconstrained model predictive control (MMPC) problem and calculated the front steering angle to prevent the vehicle from colliding with a moving obstacle vehicle. Simulink and CarSim simulations are conducted in the case where moving obstacles exist. The simulation results show that the proposed path-planning approach is effective for many driving scenarios, and the MMPC-based path-tracking controller provides dynamic tracking performance and maintains good maneuverability.

Motion planning with sequential convex optimization and convex collision checking

Abstract: We present a new optimization-based approach for robotic motion planning among obstacles. Like CHOMP (Covariant Hamiltonian Optimization for Motion Planning), our algorithm can be used to find collision-free trajectories from naA¯ve, straight-line initializations that might be in collision. At the core of our approach are (a) a sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary, and (b) an efficient formulation of the no-collisions constraint that directly considers continuous-time safety Our algorithm is implemented in a software package called TrajOpt. We report results from a series of experiments comparing TrajOpt with CHOMP and randomized planners from OMPL, with regard to planning time and path quality. We consider motion planning for 7 DOF robot arms, 18 DOF full-body robots, statically stable walking motion for the 34 DOF Atlas humanoid robot, and physical experiments with the 18 DOF PR2. We also apply TrajOpt to plan curvature-constrained steerable needle trajectories in the SE(3) configuration space and multiple non-intersecting curved channels within 3D-printed implants for intracavitary brachytherapy. Details, videos, and source code are freely available at: http://rll.berkeley.edu/trajopt/ijrr.

Real-time motion planning for agile autonomous vehicles

Abstract: Planning the path of an autonomous, agile vehicle in a dynamic environment is a very complex problem, especially when the vehicle is required to use its full maneuvering capabilities. Recent efforts aimed at using randomized algorithms for planning the path of kinematic and dynamic vehicles have demonstrated considerable potential for implementation on future autonomous platforms. This paper builds upon these efforts by proposing a randomized motion planning architecture for dynamical systems in the presence of fixed and moving obstacles. This architecture addresses the dynamic constraints on the vehicle's motion, and it provides at the same time a consistent decoupling between low-level control and motion planning. Simulation examples involving a ground robot and a small autonomous helicopter, are presented and discussed.

A potential field approach to path planning

Abstract: A path-planning algorithm for the classical mover's problem in three dimensions using a potential field representation of obstacles is presented. A potential function similar to the electrostatic potential is assigned to each obstacle, and the topological structure of the free space is derived in the form of minimum potential valleys. Path planning is done at two levels. First, a global planner selects a robot's path from the minimum potential valleys and its orientations along the path that minimize a heuristic estimate of the path length and the chance of collision. Then, a local planner modifies the path and orientations to derive the final collision-free path and orientations. If the local planner fails, a new path and orientations are selected by the global planner and subsequently examined by the local planner. This process is continued until a solution is found or there are no paths left to be examined. The algorithm solves a much wider class of problems than other heuristic algorithms and at the same time runs much faster than exact algorithms (typically 5 to 30 min on a Sun 3/260). >

Integration of representation into goal-driven behavior-based robots

Abstract: An architecture that integrates a map representation into a reactive, subsumption-based mobile robot is described. This fully integrated reactive system removes the distinction between the control program and the map. The method was implemented and tested on a mobile robot equipped with a ring of sonars and a compass, and programmed with a collection of simple, incrementally designed behaviors. The robot performs collision-free navigation, dynamic landmark detection, map construction and maintenance, and path planning. Given any known landmark as a goal, the robot plans and executes the shortest known path to it. If the goal is not reachable, the robot detects failure, updates the map, and finds an alternate route. The topological representation primitives are designed to suit the robot's sensors and its navigation behavior, thus minimizing the amount of stored information. Distributed over a collection of behaviors, the map itself performs constant-time localization and linear-time path planning. The approach is qualitative and robust. >