The thesis presents an implementation of the A* algorithm and trajectory planning on microcontroller Arduino UNO. Path planning is usually formulated as a problem of searching for the shortest path, from start to end node in a graph. The biggest challenge of the implementation are the limited sources of the microcontroller because the algorithm consumes a lot of memory. The result of the work is an A* implementation which is time and space-optimized by choosing the right data types, using a priority queue, and choosing time and space-efficient methods for defining the heuristic value needed by the algorithm.
|