scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
14 Oct 2008
TL;DR: D* Lite and probabilistic roadmaps are combined for path planning, together with stereo vision for obstacle detection and dynamic path updating, and a 3D occupancy map is used to represent the environment.
Abstract: We present a synthesis of techniques for rotorcraft UAV navigation through unknown environments which may contain obstacles. D* Lite and probabilistic roadmaps are combined for path planning, together with stereo vision for obstacle detection and dynamic path updating. A 3D occupancy map is used to represent the environment, and is updated online using stereo data. The target application is autonomous helicopter-based structure inspections, which require the UAV to fly safely close to the structures it is inspecting. Results are presented from simulation and with real flight hardware mounted onboard a cable array robot, demonstrating successful navigation through unknown environments containing obstacles.

186 citations

Proceedings Article
25 Jun 2012
TL;DR: This work presents a novel optimization-based algorithm for motion planning in dynamic environments that uses a stochastic trajectory optimization framework to avoid collisions and satisfy smoothness and dynamics constraints.
Abstract: We present a novel optimization-based algorithm for motion planning in dynamic environments. Our approach uses a stochastic trajectory optimization framework to avoid collisions and satisfy smoothness and dynamics constraints. Our algorithm does not require a priori knowledge about global motion or trajectories of dynamic obstacles. Rather, we compute a conservative local bound on the position or trajectory of each obstacle over a short time and use the bound to compute a collision-free trajectory for the robot in an incremental manner. Moreover, we interleave planning and execution of the robot in an adaptive manner to balance between the planning horizon and responsiveness to obstacle. We highlight the performance of our planner in a simulated dynamic environment with the 7-DOF PR2 robot arm and dynamic obstacles.

186 citations

Journal ArticleDOI
TL;DR: The proposed algorithm outperforms PSO as well as well-recognized deterministic and probabilistic path planning algorithms in terms of path length, run time, and success rate, and simulations proved the efficiency of the proposed algorithm for a four-robot path planning problem.
Abstract: This paper presents a hybrid approach for path planning of multiple mobile robots in continuous environments. For this purpose, first, an innovative Artificial Potential Field (APF) algorithm is presented to find all feasible paths between the start and destination locations in a discrete gridded environment. Next, an enhanced Genetic Algorithm (EGA) is developed to improve the initial paths in continuous space and find the optimal path between start and destination locations. The proposed APF works based on a time-efficient deterministic scheme to find a set of feasible initial paths and is guaranteed to find a feasible path if one exists. The EGA utilizes five customized crossover and mutation operators to improve the initial paths. In this paper, path length, smoothness, and safety are combined to form a multi-objective path planning problem. In addition, the proposed method is extended to deal with multiple mobile robot path planning problem. For this purpose, a new term is added to the objective function which measures the distance between robots and a collision removal operator is added to the EGA to remove possible collision between paths. To assess the efficiency of the proposed algorithm, 12 planar environments with different sizes and complexities were examined. Evaluations showed that the control parameters of the proposed algorithm do not affect the performance of the EGA considerably. Moreover, a comparative study has been made between the proposed algorithm, A*, PRM, B-RRT and Particle Swarm Optimization (PSO). The comparative study showed that the proposed algorithm outperforms PSO as well as well-recognized deterministic (A*) and probabilistic (PRM and B-RRT) path planning algorithms in terms of path length, run time, and success rate. Finally, simulations proved the efficiency of the proposed algorithm for a four-robot path planning problem. In this case, not only the proposed algorithm determined collision-free paths, but also it found near optimal solution for all robots.

186 citations

Journal ArticleDOI
01 Aug 2001
TL;DR: The main idea of the paper is to consider the car as a 4-D system from a kinematic point of view and as a 3-D systems from a geometric points of view of collision checking and the resulting planned motions are guaranteed to be collision-free.
Abstract: Presents a steering method for a car-like vehicle providing smooth paths subjected to curvature constraints. We show how to integrate this steering method in a global motion planning scheme taking obstacles into account. The main idea of the paper is to consider the car as a 4-D system from a kinematic point of view and as a 3-D system from a geometric point of view of collision checking. The resulting planned motions are guaranteed to be collision-free and C/sup 2/ between two cusp points.

186 citations

Journal ArticleDOI
TL;DR: It is shown that the feature concept is also useful in assembly modeling and planning, and an integrated object-oriented product model is introduced that can considerably help in both assembly modeled and planning.
Abstract: In recent years, features have been introduced in modeling and planning for manufacturing of parts. Such features combine geometric and functional information. Here it is shown that the feature concept is also useful in assembly modeling and planning. For modeling and planning of both single parts and assemblies, an integrated object-oriented product model is introduced. For specific assembly-related information, assembly features are used. Handling features contain information for handling components, connection features information on connections between components. A prototype modeling environment has been developed. The product model has been successfully verified within several analyses and planning modules, in particular stability analyses, grip planning, motion planning and assembly sequence planning. Altogether, feature-based product models for assembly can considerably help in both assembly modeling and planning, on the one hand by integrating single-part and assembly modeling, and on the other hand by integrating modeling and planning.

186 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
90% related
Control system
129K papers, 1.5M citations
88% related
Robustness (computer science)
94.7K papers, 1.6M citations
87% related
Object detection
46.1K papers, 1.3M citations
86% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,512
20223,388
20212,138
20202,668
20192,648
20182,266