Motion planning

From Wikipedia, the free encyclopedia
  (Redirected from Path-planning)
Jump to: navigation, search

Motion planning (also known as the navigation problem or the piano mover's problem) is a term used in robotics for the process of breaking down a desired movement task into discrete motions that satisfy movement constraints and possibly optimize some aspect of the movement.

For example, consider navigating a mobile robot inside a building to a distant waypoint. It should execute this task while avoiding walls and not falling down stairs. A motion planning algorithm would take a description of these tasks as input, and produce the speed and turning commands sent to the robot's wheels. Motion planning algorithms might address robots with a larger number of joints (e.g., industrial manipulators), more complex tasks (e.g. manipulation of objects), different constraints (e.g., a car that can only drive forward), and uncertainty (e.g. imperfect models of the environment or robot).

Motion planning has several robotics applications, such as autonomy, automation, and robot design in CAD software, as well as applications in other fields, such as animating digital characters, video game artificial intelligence, architectural design, robotic surgery, and the study of biological molecules.


Example of a workspace.
Configuration space of a point-sized robot. White = Cfree, gray = Cobs.
Configuration space for a rectangular translating robot (pictured red). White = Cfree, gray = Cobs, where dark gray = the objects, light gray = configurations where the robot would touch an object or leave the workspace.
Example of a valid path.
Example of an invalid path.
Example of a road map.

A basic motion planning problem is to produce a continuous motion that connects a start configuration S and a goal configuration G, while avoiding collision with known obstacles. The robot and obstacle geometry is described in a 2D or 3D workspace, while the motion is represented as a path in (possibly higher-dimensional) configuration space.

Configuration Space[edit]

A configuration describes the pose of the robot, and the configuration space C is the set of all possible configurations. For example:

  • If the robot is a single point (zero-sized) translating in a 2-dimensional plane (the workspace), C is a plane, and a configuration can be represented using two parameters (x, y).
  • If the robot is a 2D shape that can translate and rotate, the workspace is still 2-dimensional. However, C is the special Euclidean group SE(2) = R2 SO(2) (where SO(2) is the special orthogonal group of 2D rotations), and a configuration can be represented using 3 parameters (x, y, θ).
  • If the robot is a solid 3D shape that can translate and rotate, the workspace is 3-dimensional, but C is the special Euclidean group SE(3) = R3 SO(3), and a configuration requires 6 parameters: (x, y, z) for translation, and Euler angles (α, β, γ).
  • If the robot is a fixed-base manipulator with N revolute joints (and no closed-loops), C is N-dimensional.

Free Space[edit]

The set of configurations that avoids collision with obstacles is called the free space Cfree. The complement of Cfree in C is called the obstacle or forbidden region.

Often, it is prohibitively difficult to explicitly compute the shape of Cfree. However, testing whether a given configuration is in Cfree is efficient. First, forward kinematics determine the position of the robot's geometry, and collision detection tests if the robot's geometry collides with the environment's geometry.

Target Space[edit]

Target space is a linear subspace of free space which we want robot to go there. In global motion planning, target space is observable by the robot's sensors. However, in local motion planning, the robot cannot observe the target space in some states. To solve this problem, the robot goes through several virtual target spaces, each of which is located within the observable area (around the robot). A virtual target space is called a sub-goal.[1]


Low-dimensional problems can be solved with grid-based algorithms that overlay a grid on top of configuration space, or geometric algorithms that compute the shape and connectivity of Cfree.

Exact motion planning for high-dimensional systems under complex constraints is computationally intractable. Potential-field algorithms are efficient, but fall prey to local minima (an exception is the harmonic potential fields). Sampling-based algorithms avoid the problem of local minima, and solve many problems quite quickly. They are unable to determine that no path exists, but they have a probability of failure that decreases to zero as more time is spent.

Sampling-based algorithms are currently considered state-of-the-art for motion planning in high-dimensional spaces, and have been applied to problems which have dozens or even hundreds of dimensions (robotic manipulators, biological molecules, animated digital characters, and legged robots).

Grid-Based Search[edit]

Grid-based approaches overlay a grid on configuration space, and assume each configuration is identified with a grid point. At each grid point, the robot is allowed to move to adjacent grid points as long as the line between them is completely contained within Cfree (this is tested with collision detection). This discretizes the set of actions, and search algorithms (like A*) are used to find a path from the start to the goal.

These approaches require setting a grid resolution. Search is faster with coarser grids, but the algorithm will fail to find paths through narrow portions of Cfree. Furthermore, the number of points on the grid grows exponentially in the configuration space dimension, which make them inappropriate for high-dimensional problems.

Traditional grid-based approaches produce paths whose heading changes are constrained to multiples of a given base angle, often resulting in suboptimal paths. Any-angle path planning approaches find shorter paths by propagating information along grid edges (to search fast) without constraining their paths to grid edges (to find short paths).

Grid-based approaches often need to search repeatedly, for example, when the knowledge of the robot about the configuration space changes or the configuration space itself changes during path following. Incremental heuristic search algorithms replan fast by using experience with the previous similar path-planning problems to speed up their search for the current one.

Interval-Based Search[edit]

These approaches are similar to grid-based search approaches except that they generate a paving covering entirely the configuration space instead of a grid.[2] The paving is decomposed into two subpavings X,X+ made with boxes such that X ⊂ Cfree ⊂ X+. Characterizing Cfree amounts to solve a set inversion problem. Interval analysis could thus be used when Cfree cannot be described by linear inequalities in order to have a guaranteed enclosure.

The robot is thus allowed to move freely in X, and cannot go outside X+. To both subpavings, a neighbor graph is built and paths can be found using algorithms such as Dijkstra or A*. When a path is feasible in X, it is also feasible in Cfree. When no path exists in X+ from one initial configuration to the goal, we have the guarantee that no feasible path exists in Cfree. As for the grid-based approach, the interval approach is inappropriate for high-dimensional problems, due to the fact that the number of boxes to be generated grows exponentially with respect to the dimension of configuration space.

An illustration is provided by the three figures on the right where a hook with two degrees of freedom has to move from the left to the right, avoiding two horizontal small segments.

Motion from the initial configuration (blue) to the final configuration of the hook, avoiding the two obstacles (red segments). The left-bottom corner of the hook has to stay on the horizontal line, which makes the hook two degrees of freedom.
Decomposition with boxes covering the configuration space: The subpaving X is the union all red boxes and the subpaving X+ is the union of red and green boxes. The path corresponds to the motion represented above.
This figure corresponds to the same path as above but obtained with many fewer boxes.The algorithm avoids bisecting boxes in parts of the configuration space that do not influence the final result.

The decomposition with subpavings using interval analysis also makes it possible to characterize the topology of Cfree such as counting its number of connected components.[3]

Geometric Algorithms[edit]

Point robots among polygonal obstacles

Translating objects among obstacles

Reward-Based Algorithms[edit]

Reward-based algorithms assume that the robot in each state (position and internal state, including direction) can choose between different actions (motion). However, the result of each action is not definite. In other words, outcomes (displacement) are partly random and partly under the control of the robot. The robot gets positive reward when it reaches the target and gets negative reward if it collides with an obstacle. These algorithms try to find a path which maximizes cumulative future rewards. The Markov decision process (MDP) is a popular mathematical framework that is used in many reward-based algorithms. The advantage of MDPs over other reward-based algorithms is that they generate the optimal path. The disadvantage of MDPs is that they limit the robot to choose from a finite set of actions. Therefore, the path is not smooth (similar to grid-based approaches). Fuzzy Markov decision processes (FDMPs) are an extension of MDPs which generate smooth paths using a fuzzy inference system.[1]

Artificial Potential Fields[edit]

One approach is to treat the robot's configuration as a point (usually electron) in a potential field that combines attraction to the goal, and repulsion from obstacles. The resulting trajectory is output as the path. This approach has advantages in that the trajectory is produced with little computation. However, they can become trapped in local minima of the potential field, and fail to find a path. The Artificial potential fields can be achieved by direct equation similar to electrostatic potential fields or can be drive by set of linguistic rules.[4]

Sampling-Based Algorithms[edit]

Sampling-based algorithms represent the configuration space with a roadmap of sampled configurations. A basic algorithm samples N configurations in C, and retains those in Cfree to use as milestones. A roadmap is then constructed that connects two milestones P and Q if the line segment PQ is completely in Cfree. Again, collision detection is used to test inclusion in Cfree. To find a path that connects S and G, they are added to the roadmap. If a path in the roadmap links S and G, the planner succeeds, and returns that path. If not, the reason is not definitive: either there is no path in Cfree, or the planner did not sample enough milestones.

These algorithms work well for high-dimensional configuration spaces, because unlike combinatorial algorithms, their running time is not (explicitly) exponentially dependent on the dimension of C. They are also (generally) substantially easier to implement. They are probabilistically complete, meaning the probability that they will produce a solution approaches 1 as more time is spent. However, they cannot determine if no solution exists.

Given basic visibility conditions on Cfree, it has been proven that as the number of configurations N grows higher, the probability that the above algorithm finds a solution approaches 1 exponentially.[5] Visibility is not explicitly dependent on the dimension of C; it is possible to have a high-dimensional space with "good" visibility or a low-dimensional space with "poor" visibility. The experimental success of sample-based methods suggests that most commonly seen spaces have good visibility.

There are many variants of this basic scheme:

  • It is typically much faster to only test segments between nearby pairs of milestones, rather than all pairs.
  • Nonuniform sampling distributions attempt to place more milestones in areas that improve the connectivity of the roadmap.
  • Quasirandom samples typically produce a better covering of configuration space than pseudorandom ones, though some recent work argues that the effect of the source of randomness is minimal compared to the effect of the sampling distribution.
  • It is possible to substantially reduce the number of milestones needed to solve a given problem by allowing curved eye sights (for example by crawling on the obstacles that block the way between two milestones [6]).
  • If only one or a few planning queries are needed, it is not always necessary to construct a roadmap of the entire space. Tree-growing variants are typically faster for this case (single-query planning). Roadmaps are still useful if many queries are to be made on the same space (multi-query planning)

List of notable algorithms[edit]

Completeness and Performance[edit]

A motion planner is said to be complete if the planner in finite time either produces a solution or correctly reports that there is none. Most complete algorithms are geometry-based. The performance of a complete planner is assessed by its computational complexity.

Resolution completeness is the property that the planner is guaranteed to find a path if the resolution of an underlying grid is fine enough. Most resolution complete planners are grid-based or interval-based. The computational complexity of resolution complete planners is dependent on the number of points in the underlying grid, which is O(1/hd), where h is the resolution (the length of one side of a grid cell) and d is the configuration space dimension.

Probabilistic completeness is the property that as more “work” is performed, the probability that the planner fails to find a path, if one exists, asymptotically approaches zero. Several sample-based methods are probabilistically complete. The performance of a probabilistically complete planner is measured by the rate of convergence.

Incomplete planners do not always produce a feasible path when one exists. Sometimes incomplete planners do work well in practice.

Problem Variants[edit]

Many algorithms have been developed to handle variants of this basic problem.

Differential Constraints[edit]


  • Manipulator arms (with dynamics)


  • Cars
  • Unicycles
  • Planes
  • Acceleration bounded systems
  • Moving obstacles (time cannot go backward)
  • Bevel-tip steerable needle
  • Differential Drive Robots

Optimality Constraints[edit]

Hybrid Systems[edit]

Hybrid systems are those that mix discrete and continuous behavior. Examples of such systems are:


  • Motion uncertainty
  • Missing information
  • Active sensing
  • Sensorless planning


See also[edit]


  1. ^ a b Fakoor, Mahdi; Kosari, Amirreza; Jafarzadeh, Mohsen (2016). "Humanoid robot path planning with fuzzy Markov decision processes". Journal of Applied Research and Technology. doi:10.1016/j.jart.2016.06.006. Retrieved 21 August 2016. 
  2. ^ Jaulin, L. (2001). "Path planning using intervals and graphs" (PDF). Reliable Computing. 7 (1). 
  3. ^ Delanoue, N.; Jaulin, L.; Cottenceau, B. (2006). "Counting the Number of Connected Components of a Set and Its Application to Robotics" (PDF). Applied Parallel Computing, Lecture Notes in Computer Science. 3732 (1). 
  4. ^ Fakoor, Mahdi; Kosari, Amirreza; Jafarzadeh, Mohsen (2015). "Revision on fuzzy artificial potential field for humanoid robot path planning in unknown environment". International Journal of Advanced Mechatronic Systems. 6 (4): 174–183. doi:10.1504/IJAMECHS.2015.072707. 
  5. ^ Hsu, D.; J.C. Latombe, J.C.; Motwani, R. (1997). "Path Planning in Expansive Configuration Spaces". Proc. IEEE Int. Conf. on Robotics and Automation. 
  6. ^ Shvalb, N.; Ben Moshe, B.; Medina, O. (2013). "A real-time motion planning algorithm for a hyper-redundant set of mechanisms.". Robotica. 31 (8): 1327–1335. doi:10.1017/S0263574713000489. 
  7. ^ Zhang, Y. (2011). "UCAV path planning based on FSCABC". Information-An International Interdisciplinary Journal. 14 (3): 687–692. 

Further reading[edit]

External links[edit]