Optimal any-angle path planning in static and dynamic environments.

arXiv:2607.00065v2 Announce Type: replace-cross Abstract: Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shor