[main_ia/A*] Complete rewrite of the shortest path A* function
* Nodes of the problem are not anymore the oriented obstacles
* Nodes of the problem are the segments between oriented obstacles
* Fixes several A* issues leading to non-optimal solutions, infinite loop or unexpected lack of solution
* API remains unchanged
* Increases memory usage by about 48*N²   ~=80ko