What is THIS?

A Pythonic implementation of the famous A* algorithm.

Why ANOTHER implementation

Because coding is awesome! Also because I really dislike the mess that the usual implementations create. The A* algorithm is simple and beautiful and so must be its implementation.

How is THIS diferent?

This is different because I refactored all the logic in propositional layers. This is achieved grouping together the parts of the algorithm that has the same level of abstraction, exposing the pure logic of A* in its higher layer.

How can it be TESTED?

It comes with a maze_solving_example.py snippet to test the algorithm in a simple weighted maze ( with random weights ). If you run it you will obtain something like this:

$ python examples/maze_solving_example.py
↓ ↓ ← ← ← ← ← ← ← .
↓ ↓ ← ← ← ↑ ↑ ← ← .
↓ ↓ ← ← ← . . ↑ ← .
↓ ↓ ← ##########. . . ↑ .
→ S ← ##########. . . ↑ .
↑ ↑ ← ##########. . . ↑ .
↑ ↑ ← ##########. . → ↑ .
↑ ↑ ← ##########. . ↑ . .
↑ ↑ ← ##########. . E . .
↑ ↑ ← ##########. . . . .
5 4 5 6 7 8 9 10 11 .
4 3 4 5 10 10 10 11 12 .
3 2 3 4 11 . . 12 13 .
2 1 2 ##########. . . 14 .
1 S 1 ##########. . . 15 .
2 1 2 ##########. . . 16 .
3 2 3 ##########. . 18 17 .
4 3 4 ##########. . 19 . .
5 4 5 ##########. . E . .
6 5 6 ##########. . . . .
[...]

The first diagram represents where each point came from. Starting in the E ( standing for ENDING POINT) we backtrack each arrow untill we reach the S ( standing for STARTING POINT). This path is the shortest path. And you know what?

This is also true for every point in the diagram!!!

The arcane forces of A* make that if you start in a visited point and backtrack using the arrows you will get the shortest path.

The second diagram is the cost to reach each point from the START (S).

A third diagram, not shown here, will also be printed. This diagram shows the estimated total cost from START (S) to END (E) at each point, which is central to the efficiency of the A* algoritm as explained below.

Can you EXPLAIN the algorithm?

Yeah! The idea of the A* algorithm is that starting from the start point we visit the points that are cheaper to visit. The cost of visiting a neighbor point depends on how costly is to go from the current point to a neighbor. So we check for all the points what is the neighbor that is cheaper to visit and we visit it.

The A* algorithm is basically the following:

defa_star_search(graph, start, end):
""" Calculates the shortest path from start to end. :param graph: A graph object. The graph object can be anything that implements the following methods: graph.neighbors( (x:int, y:int) ) : Iterable( (x:int,y:int), (x:int,y:int), ...) graph.cost( (x:int,y:int) ) : int :param start: Tuple of two ints representing the starting point. :param end: Tuple of two ints representing the ending point. :returns: A DijkstraHeap object. """frontier=DijkstraHeap( Node(cost_estimate=heuristic(start, end), point=start, came_from=None) )
whilefrontier:
current_node=frontier.pop()
ifcurrent_nodeisNone:
raiseValueError("No path exists")
ifcurrent_node.point==end:
returnfrontierforneighboringraph.neighbors( current_node.point ):
cost_so_far=current_node.cost_estimate-heuristic(current_node.point, end)
new_cost= ( cost_so_far+graph.cost(current_node.point, neighbor)
+heuristic(neighbor, end) )
new_node=Node(cost_estimate=new_cost, point=neighbor, came_from=current_node.point)
frontier.insert(new_node)

Lets go line by line:

frontier=DijkstraHeap( Node(cost_estimate=heuristic(start, end), point=start, came_from=None) )

This line creates a DijkstraHeap object and puts the starting point in it. We will see later how this can be implemented but the best part is that....This is not part of the algorithm! What is a DijkstraHeap then? This is a cost queue that has the following properties:

• If we try to insert an already visited element in the queue the DijkstraHeap will do nothing.
• The DijkstraHeap always pop the element that has the lowest cost and NEVER pops an already visited element.

Cool! So this DijkstraHeap knows the visiting order of the elements. Its like a heap but never pops an already visited element.

By the way, a Node object is a tuple of the form ( total_cost_estimate, point, point_from_we_came ).

whileTrue:

We loop until we have found a path, or failed to find one by exhausting all elements in the queue.

current_node=frontier.pop()

Each iteration we pop an element from the DijkstraHeap. This element always has the lowest cost element because the DijkstraHeap has this property ( because is a heap and heaps are awesome ).

At this point maybe you are asking yourself why the name frontier? Well, this is because when you are at the starting point and you visit neighbors, the queue of the nodes to be visited is like a expanding frontier (imagine a closed curve that becomes bigger and bigger in size). From which sides this frontier will expand first depends on the weights of the nodes among other things (like the distance to the ending point...etc).

ifcurrent_nodeisNone:
raiseValueError("No path exists")
ifcurrent_node.point==end:
returnfrontier

If we have reached the end, we stop and return the DijkstraHeap that has all the information about our path (because it knows how we reach each element).

forneighboringraph.neighbors( current_node.point ):

We get each of the current point neighbors

cost_so_far=current_node.cost_estimate-heuristic(current_node.point, end)
new_cost= ( cost_so_far+graph.cost(current_node.point, neighbor)
+heuristic(neighbor, end) )
new_node=Node(cost_estimate=new_cost, point=neighbor, came_from=current_node.point)
frontier.insert(new_node)

For each neighbor we calculate the new cost of reaching this neighbor from the current point. This cost is formed by three quantities:

1. The cost of reaching the current point, which is the stored cost estimate minus the heuristic distance at that point (explained below).
2. The cost of going from the current point to the neighbor.
3. The distance of the neighbor to the end point that we are looking.

Why this 3rd cost? Because we want to explore first the points that are near the end destination and expend less time in the points that are far from it. So if we artificially give the point a higher cost if the point is far from the destination it will be visited later.

The new cost is thus an estimate of the total cost, without knowing what lies ahead. It grows along the path as we encounter obstacles or higher-cost steps. It is essential that the heuristic never overestimates the remaining distance, otherwise the path is not necessarily optimal since the best path may not be visited before we find the end (and terminate).

When we have calculated this new cost estimate we insert the point in the cost queue.

But what about the MISTERIOUS DijkstraHeap?

Is like I said a heap that remembers the visited elements and where they came from and never pops an already visited element. The implementation is very simple:

classDijkstraHeap(list):
""" An augmented heap for the A* algorithm. This class encapsulated the residual logic of the A* algorithm like for example how to manage elements already visited that remain in the heap, elements already visited that are not in the heap and from where we came to a visited element. This class will have three main elements: - A heap that will act as a cost queue (self). - A visited dict that will act as a visited set and as a mapping of the form point:came_from - A costs dict that will act as a mapping of the form point:cost_so_far """def__init__(self, first_node=None):
self.visited=dict()
self.costs=dict()
iffirst_nodeisnotNone:
self.insert(first_node)
definsert(self, element):
""" Insert an element into the Dijkstra Heap. :param element: A Node object. :return: None """ifelement.pointnotinself.visited:
heapq.heappush(self,element)
defpop(self):
""" Pop an element from the Dijkstra Heap, adding it to the visited and cost dicts. :return: A Node object """whileselfandself[0].pointinself.visited:
heapq.heappop(self)
ifself:
next_elem=heapq.heappop(self)
self.visited[next_elem.point] =next_elem.came_fromself.costs[next_elem.point] =next_elem.costreturnnext_elem

So WHAT is this deep logic you talk about?

I think the deep logic about A* can be summarized in the following two simple points:

• We visit the nodes in order, being this order the cost of going from the starting point to this particular node.

• We artificially alter the cost of visiting one node taking into account how far this particular node is from the destination, making the furthest nodes more costly.

And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but is NOT the A* algorithm: it is secondary logic and secondary problems that lead to secondary data structures.