Skip to main content

A* Search Algorithm in C++

By January 11, 2020No Comments
In short the A* search algorithm lets you find the quickest possible path between 2 nodes. The process of finding a path between the start point and end point is called “Planning”. For robots this is called “Robot Motion Planning”

Leave a Reply