Optimal any-angle pathfinding on a sphere
From MaRDI portal
Recommendations
- Optimal any-angle pathfinding in practice
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- Theta^*: any-angle path planning on grids
- Fast optimal and bounded suboptimal Euclidean pathfinding
- Application of the A^* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
This page was built for publication: Optimal any-angle pathfinding on a sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026201)