2 votes

How can I calculate the shortest path between two 2d vector points in an environment with obstacles?

The usual way to solve this kind of problem is to construct a configuration space: extruding all the polygonal obstacles by sliding the polygon corresponding to the robot around them (some slides). ...
NietzscheanAI's user avatar
1 vote

What is the difference between the uniform-cost search and Dijkstra's algorithm?

The answer to my question can be found in the paper Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm (2011), in particular section Similarities of ...
nbro's user avatar
  • 40.1k

Only top scored, non community-wiki answers of a minimum length are eligible