A* Algorithm

I’m planning to use the A* algorithm for the new season, any ideas on how I can get started to building it from scratch? I will use it in the autonomous as well as skills maybe

Mark every point that a robot can traverse; the more points marked, the higher the precision. Connect any two points with a line if no obstacles lie between them. Use a hash table to record each point (as the Key), along with the points connected to it and the corresponding distances (as the Value). Any suitable algorithm can then be used to calculate the shortest path between any two points.

What would you use A* for? That is for path planning between nodes, right? I assume this would be for re-routing your robot if you get knocked off track, but this has been done before with several other ways.

I think you would probably be better off doing your own path planning, but I would defintely develop an absolute positioning system with very accurate feed-back control functions for movement.

I love this idea though!