Planning Algorithms, step 3
Probabilistic roadmap
Sample free configurations, link near neighbours into a graph once, then answer every query with a graph search.
Roadmapsk-nearest neighboursDijkstra's algorithm
Planning Algorithms, step 3
Sample free configurations, link near neighbours into a graph once, then answer every query with a graph search.