Mapping-Based Navigation

Open Access


Given a map and a target position, a robot must perform path planning in order to determine the best route from its current position to the target position. Three algorithms for path planning are presented: Dijkstra’s shortest path algorithm for a grid of cells, an algorithm for continuous maps and the A\(^{*}\) algorithm, an improvement of Dijkstra’s algorithm that uses heuristic functions. The chapter concludes with a description of the integration of path planning with obstacle avoidance.

Now that we have a map, whether supplied by the user or discovered by the robot, we can discuss path planning, a higher-level algorithm. Consider a robot used in a hospital for transporting medications and other supplies from storage areas to the doctors and nurses. Given one of these tasks, what is the best way of going from point A to point B? There may be multiple ways of moving through the corridors to get to the goal, but there may also be short paths that the robot is not allowed to take, for example, paths that go through corridors near the operating rooms.

We present three algorithms for planning the shortest path from a starting position S to a goal position G, assuming that we have a map of the area that indicates the positions of obstacles in the area. Edsgar W. Dijkstra, one of the pioneers of computer science, proposed an algorithm for the shortest path problem. Section 10.1 describes the algorithm for a grid map, while Sect. 10.2 describes the algorithm for a continuous map. The A\(^{*}\) algorithm, an improvement on Dijkstra’s algorithm based upon heuristic methods, is presented in Sect. 10.3. Finally, Sect. 10.4 discusses how to combine a high-level path planning algorithm with a low-level obstacle avoidance algorithm.

10.1 Dijkstra’s Algorithm for a Grid Map

Dijkstra described his algorithm for a discrete graph of nodes and edges. Here we describe it for a grid map of cells (Fig. 10.1a). Cell S is the starting cell of the robot and its task is to move to the goal cell G. Cells that contain obstacles are shown in black. The robot can sense and move to a neighbor of the cell c it occupies. For simplicity, we specify that the neighbors of c are the four cells next to it horizontally and vertically, but not diagonally. Figure 10.1b shows a shortest path from S to G:
$$ \begin{array}{ll} (4,0) \rightarrow &{}(4,1)\rightarrow (3,1) \rightarrow (2,1) \rightarrow (2,2) \rightarrow \\ &{}(2,3) \rightarrow (3,3) \rightarrow (3,4) \rightarrow (3,5) \rightarrow (4,5)\,. \end{array} $$
Fig. 10.1

a Grid map for Dijkstra’s algorithm. b The shortest path found by Dijkstra’s algorithm

Two versions of the algorithm are presented: The first is for grids where the cost of moving from one cell to one of its neighbors is constant. In the second version, each cell can have a different cost associated with moving to it, so the shortest path geometrically is not necessarily the shortest path when the costs are taken into account.

10.1.1 Dijkstra’s Algorithm on a Grid Map with Constant Cost

Algorithm 10.1 is Dijkstra’s algorithm for a grid map. The algorithm is demonstrated on the \(5\times 6\) cell grid map in Fig. 10.2a. There are three obstacles represented by the black cells.
Fig. 10.2

a Grid map for Dijkstra’s algorithm. b The first two iterations of Dijkstra’s algorithm

The algorithm incrementally marks each cell c with the number of steps needed to reach c from the start cell S. In the figures, the step count is shown as a number in the upper left hand corner of a cell. Initially, mark cell S with 0 since no steps are needed to reach S from S. Now, mark every neighbor of S with 1 since they are one step away from S; then mark every neighbor of a cell marked 1 with 2. Figure 10.2b shows the grid map after these two iterations of the algorithm.
Fig. 10.3

a After five iterations of Dijkstra’s algorithm. b The final grid map with the shortest path marked

The algorithm continues iteratively: if a cell is marked n, its unmarked neighbors are marked with \(n+1\). When G is finally marked, we know that the shortest distance from S to G is n. Figure 10.3a shows the grid map after five iterations and Fig. 10.3b shows the final grid map after nine iterations when the goal cell has been reached.

It is now easy to find a shortest path by working backwards from the goal cell G. In Fig. 10.3b a shortest path consists of the cells that are colored gray. Starting with the goal cell at coordinate (4, 5), the previous cell must be either (4, 4) or (3, 5) since they are eight steps away from the start. (This shows that there is more than one shortest path.) We arbitrarily choose (3, 5). From each selected cell marked n, we choose a cell marked \(n-1\) until the cell S marked 0 is selected. The list of the selected cells is:
$$ (4,5),\, (3,5),\, (3,4),\, (3,3),\, (2,3),\, (2,2),\, (2,1),\, (3,1),\, (4,1),\, (4,0)\,. $$
By reversing the list, the shortest path from S to G is obtained. Check that this is the same path we found intuitively (Fig. 10.1b).
Example Figure 10.4 shows how Dijkstra’s algorithm works on a more complicated example. The grid map has \(16\times 16\) cells and the goal cell G is enclosed within an obstacle and difficult to reach. The upper left diagram shows the grid map after three iterations and the upper right diagram shows the map after 19 iterations. The algorithm now proceeds by exploring cells around both sides of the obstacle. Finally, in the lower left diagram, G is found after 25 iterations, and the shortest path is indicated in gray in the lower right diagram. We see that the algorithm is not very efficient for this map: although the shortest path is only 25 steps, the algorithm has explored \(256-25=231\) cells!
Fig. 10.4

Dijkstra’s algorithm for path planning on a grid map. Four stages in the execution of the algorithm are shown starting in the upper left diagram

10.1.2 Dijkstra’s Algorithm with Variable Costs

Algorithm 10.1 and the example in Fig. 10.4 assume that the cost of taking a step from one cell to the next is constant: line three of the algorithm adds 1 to the cost for each neighbor. Dijkstra’s algorithm can be modified to take into account a variable cost of each step. Suppose that an area in the environment is covered with sand and that it is more difficult for the robot to move through this area. In the algorithm, instead of adding 1 to the cost for each neighboring cell, we can add k to each neighboring sandy cell to reflect the additional cost.
Fig. 10.5

Dijkstra’s algorithm with a variable cost per cell (left diagram, cost = 4, right diagram, cost = 2)

The grid on the left of Fig. 10.5 has some cells marked with a diagonal line to indicate that they are covered with sand and that the cost of moving through them is 4 and not 1. The shortest path, marked in gray, has 17 steps and also costs 17 since it goes around the sand.

The shortest path depends on the cost assigned to each cell. The right diagram shows the shortest path if the cost of moving through a cell with sand is only 2. The path is 12 steps long although its cost is 14 to take into account moving two steps through the sand.

Activity 10.1:

Dijkstra’s algorithm on a grid map
  • Construct a grid map and apply Dijkstra’s algorithm.

  • Modify the map to include cells with a variable cost and apply the algorithm.

  • Implement Dijkstra’s algorithm.

    • Create a grid on the floor.

    • Write a program that causes the robot to move from a known start cell to a known goal cell. Since the robot must store its current location, use this to create a map of the cells it has moved through.

    • Place some obstacles in the grid and enter them in the map of the robot.

10.2 Dijkstra’s Algorithm for a Continuous Map

In a continuous map the area is an ordinary two-dimensional geometric plane. One approach to using Dijkstra’s algorithm in a continuous map is to transform the map into a discrete graph by drawing vertical lines from the upper and lower edges of the environment to each corner of an obstacle. This divides the area into a finite number of segments, each of which can be represented as a node in a graph. The left diagram of Fig. 10.6 shows seven vertical lines that divide the map into ten segments which are shown in the graph in Fig. 10.7. The edges of the graph are defined by the adjacency relation of the segments. There is a directed edge from segment A to segment B if A and B share a common border. For example, there are edges from node 2 to nodes 1 and 3 since the corresponding segments share an edge with segment 2.
Fig. 10.6

Segmenting a continuous map by vertical lines and the path through the segments

Fig. 10.7

The graph constructed from the segmented continuous map

What is the shortest path between vertex 2 representing the segment containing the starting point and vertex 10 representing the segment containing the goal? The result of applying Dijkstra’s algorithm is \(\textsf {\small S} \rightarrow 2\rightarrow 3\rightarrow 6\rightarrow 9\rightarrow 10 \rightarrow \textsf {\small G}\). Although this is the shortest path in terms of the number of edges of the graph, it is not the shortest path in the environment. The reason is that we assigned constant cost to each edge, although the segments of the map have various size.

Since each vertex represents a large segment of the environment, we need to know how moving from one vertex to another translates into moving from one segment to another. The right diagram in Fig. 10.6 shows one possibility: each segment is associated with its geometric center, indicated by the intersection of the dotted diagonal lines in the figure. The path in the environment associated with the path in the graph goes from the center of one segment to the center of the next segment, except that the start and goal positions are at their geometric locations. Although this method is reasonable without further knowledge of the environment, it does not give the optimal path which should stay close to the borders of the obstacles.

Figure 10.8 shows another approach to path planning in a continuous map. It uses a visibility graph, where each vertex of the graph represents a corner of an obstacle, and there are vertices for the start and goal positions. There is an edge from vertex \(v_1\) to vertex \(v_2\) if the corresponding corners are visible. For example, there is an edge \(C\rightarrow E\) because corner E of the right obstacle is visible from corner C of the left obstacle. Figure 10.9 shows the graph formed by these nodes and edges. It represents all candidates for the shortest path between the start and goal locations.
Fig. 10.8

A continuous map with lines from corner to corner and the path through the corners

Fig. 10.9

The graph constructed from the segmented continuous map

It is easy to see that the paths in the graph represent paths in the environment, since the robot can simply move from corner to corner. These paths are the shortest paths because no path, say from A to B, can be shorter than the straight line from A to B. Dijkstra’s algorithm gives the shortest path as \(S\rightarrow D\rightarrow F\rightarrow H\rightarrow G\). In this case, the shortest path in terms of the number of edges is also the geometrically shortest path.

Although this is the shortest path, a real robot cannot follow this path because it has a finite size so its center cannot follow the border of an obstacle. The robot must maintain a minimum distance from each obstacle, which can be implemented by expanding the size of the obstacles by the size of the robot (right diagram of Fig. 10.9). The resulting path is optimal and can be traversed by the robot.

Activity 10.2:

Dijkstra’s algorithm for continuous maps
  • Draw a larger version of the map in Fig. 10.8. Measure the length of each segment. Now apply Dijkstra’s algorithm to determine the shortest path.

  • Create your own continuous map, extract the visibility graph and apply Dijkstra’s algorithm.

10.3 Path Planning with the A\(^{*}\) Algorithm

Dijkstra’s algorithm searches for the goal cell in all directions; this can be efficient in a complex environment, but not so when the path is simple, for example, a straight line to the goal cell. Look at the top right diagram in Fig. 10.4: near the upper right corner of the center obstacle there is a cell at distance 19 from the start cell. After two more steps to the left, there will be a cell marked 21 which has a path to the goal cell that is not blocked by an obstacle. Clearly, there is no reason to continue to explore the region at the left of the grid, but Dijkstra’s algorithm continues to do so. It would be more efficient if the algorithm somehow knew that it was close to the goal cell.

The A\(^{*}\) algorithm (pronounced “A star”) is similar to the Dijkstra’s algorithm, but is often more efficient because it uses extra information to guide the search. The A\(^{*}\) algorithm considers not only the number of steps from the start cell, but also a heuristic function that gives an indication of the preferred direction to search. Previously, we used a cost function g(xy) that gives the actual number of steps from the start cell. Dijkstra’s algorithm expanded the search starting with the cells marked with the highest values of g(xy). In the A\(^{*}\) algorithm the cost function f(xy) is computed by adding the values of a heuristic function h(xy):
$$ f(x,y) = g(x,y) + h(x,y)\,. $$
We demonstrate the A\(^{*}\) algorithm by using as the heuristic function the number of steps from the goal cell G to cell (xy) without taking the obstacles into account. This function can be precomputed and remains available throughout the execution of the algorithm. For the grid map in Fig. 10.2a, the heuristic function is shown in Fig. 10.10a.
Fig. 10.10

a Heuristic function. b The first two iterations of the A\(^{*}\) algorithm

In the diagrams, we will keep track of the values of the three functions fgh by displaying them in different corners of each cell
. Figure 10.10b shows the grid map after two steps of the A\(^{*}\) algorithm. Cells (3, 1) and (3, 0) receive the same cost f: one is closer to S (by the number of steps counted) and the other is closer to G (by the heuristics), but both have the same cost of 7.
The algorithm needs to maintain a data structure of the open cells, the cells that have not yet been expanded. We use the notation (rcv), where r and c are the row and column of the cell and v is the f value of the cell. Each time an open cell is expanded, it is removed form the list and the new cells are added. The list is ordered so that cells with the lowest values appear first; this makes it easy to decide which cell to expand next. The first three lists corresponding to Fig. 10.10b are:
$$\begin{aligned} \begin{array}{l} (4,0,5)\\ (4,1,5),\,(3,0,7)\\ (3,0,7),\,(3,1,7)\,. \end{array} \end{aligned}$$
Fig. 10.11

a The A\(^{*}\) algorithm after 6 steps. b The A\(^{*}\) algorithm reaches the goal cell and finds a shortest path

Figure 10.11a shows the grid map after six steps. This can be seen by looking at the g values in the upper left corner of each cell. The current list of open cells is:
$$ (3,3,9),\, (1,0,11),\, (1,1,11),\, (1,3,11)\,. $$
The A\(^{*}\) algorithm chooses to expand cell (3, 3, 9) with the lowest f. The other cells in the list have an f value of 11 and are ignored at least for now. Continuing (Fig. 10.11b), the goal cell is reached with f value 9 and a shortest path in gray is displayed. The last list before reaching the goal is:
$$ (3,5,9),\, (4,4,9),\, (1,0,11),\, (1,1,11),\, (1,3,11)\,. $$
It doesn’t matter which of the nodes with value 9 is chosen: in either case, the algorithm reaches the goal cell (4, 5, 9).

All the cells in the upper right of the grid are not explored because cell (1, 3) has f value 11 and that will never be the smallest value. While Dijkstra’s algorithm explored all 24 non-obstacle cells, the A\(^{*}\) algorithm explored only 17 cells.

A More Complex Example of the A\(^{*}\) Algorithm

Let apply the A\(^{*}\) algorithm to the grid map in Fig. 10.5. Recall that this map has sand on some of its cells, so the g function will give higher values for the cost of moving to these cells. The upper left diagram of Fig. 10.12 shows the g function as computed by Dijkstra’s algorithm, while the upper right diagram shows the heuristic function h, the number of steps from the goal in the absence of obstacles and the sand. The rest of the figure shows four stages of the algorithm leading to the shortest path to the goal.
Fig. 10.12

The A\(^{*}\) algorithm. Upper left the number of steps to the goal. Upper right the heuristic function. The middle and bottom diagrams show four steps of the algorithm

Already from the middle left diagram, we see that it is not necessary to search towards the top left, because the f values of the cells above and to the left of S are higher than the values to the right of and below S. In the middle right diagram, the first sand cell has a value of 13 so the algorithm continues to expand the cells with the lower cost of 12 to the left. In the bottom left diagram, we see that the search does not continue to the lower left of the map because the cost of 16 is higher than the cost of 14 once the search leaves the sand. From that point, the goal cell G is found very quickly. As in Dijkstra’s algorithm, the shortest path is found by tracing back through cells with lower g values until the start cell is reached.

Comparing Figs. 10.4 and 10.12 we see that the A\(^{*}\) algorithm needed to visit only 71% of the cells visited by Dijkstra’s algorithm. Although the A\(^{*}\) algorithm must perform additional work to compute the heuristic function, the reduced number of cells visited makes the algorithm more efficient. Furthermore, this heuristic function depends only on the area searched and not on the obstacles; even if the set of obstacles is changed, the heuristic function does not need to be recomputed.

Activity 10.3:

A\(^{*}\) algorithm
  • Apply the A\(^{*}\) algorithm and Dijkstra’s algorithm on a small map without obstacles: place the start cell in the center of the map and the goal in an arbitrary cell. Compare the results of the two algorithms. Explain your results. Does the result depend on the position of the goal cell?

  • Define other heuristic functions and compare the results of the A\(^{*}\) algorithms on the examples in this chapter.

10.4 Path Following and Obstacle Avoidance

This chapter and the previous ones discussed two different but related tasks: high-level path planning and low-level obstacle avoidance. How can the two be integrated? The simplest approach is to prioritize the low-level algorithm (Fig. 10.13). Obviously, it is more important to avoid hitting a pedestrian or to drive around a pothole than it is to take the shortest route to the airport. The robot is normally in its drive state, but if an obstacle is detected, it makes a transition to the avoid obstacle state. Only when the obstacle has been passed does it return to the state plan path so that the path can be recomputed.
Fig. 10.13

Integrating path planning and obstacle avoidance

The strategy for integrating the two algorithms depends on the environment. Repairing a road might take several weeks so it makes sense to add the obstacle to the map. The path planning algorithm will take the obstacle into account and the resulting path is likely to be better than one that is changed at the last minute by an obstacle avoidance algorithm. At the other extreme, if there are a lot of moving obstacles such as pedestrians crossing a street, the obstacle avoidance behavior could be simply to stop moving and wait until the obstacles move away. Then the original plan can simply be resuming without detours.

Activity 10.4:

Combining path planning and obstacle avoidance
  • Modify your implementation of the line-following algorithm so that the robot behaves correctly even if an obstacle is placed on the line. Try several of the approaches listed in this section.

  • Modify your implementation of the line-following algorithm so that the robot behaves correctly even if additional robots are moving randomly in the area of the line. Ensure that the robots do not bump into each other.

10.5 Summary

Path planning is a high-level behavior of a mobile robot: finding the shortest path from a start location to a goal location in the environment. Path planning is based upon a map showing obstacles. Dijkstra’s algorithm expands the shortest path to any cell encountered so far. The A\(^{*}\) algorithm reduces the number of cells visited by using a heuristic function that indicates the direction to the goal cell.

Path planning is based on a graph such as a grid map, but it can also be done on a continuous map by creating a graph of obstacles from the map. The algorithms can take into account variables costs for visiting each cell.

Low-level obstacle avoidance must be integrated into high-level path planning.

10.6 Further Reading

Dijkstra’s algorithm is presented in all textbooks on data structures and algorithms, for example, [1, Sect. 24.3]. Search algorithms such as the A\(^{*}\) algorithm are a central topic of artificial intelligence [2, Sect. 3.5].


  1. 1.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)Google Scholar
  2. 2.
    Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Pearson, Boston (2009)Google Scholar

Copyright information

© The Author(s) 2018

This chapter is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits use, duplication, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the work’s Creative Commons license, unless indicated otherwise in the credit line; if such material is not included in the work’s Creative Commons license and the respective action is not permitted by statutory regulation, users will need to obtain permission from the license holder to duplicate, adapt or reproduce the material.

Authors and Affiliations

  1. 1.Department of Science TeachingWeizmann Institute of ScienceRehovotIsrael
  2. 2.Laboratoire de Systémes RobotiquesEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations