Questions tagged [shortest-path-problem]

For questions related to the shortest path problem in the context of artificial intelligence.

Filter by
Sorted by
Tagged with
1 vote
2 answers
34 views

Why do exhaustive search require 14 travel segment evaluations but dynamic programming require 10 for this shortest path problem?

Why do exhaustive search require 14 travel segment evaluations but dynamic programming require 10 for this shortest path problem? I need a clear explanation.
DSPinfinity's user avatar
3 votes
0 answers
130 views

how do you train a neural network to determine shortest path in a 4-node graph

Suppose I have the following graph: ...
user1068636's user avatar
0 votes
0 answers
112 views

What is a good algorithm (and a heuristic) to find the shortest path in a puzzle game?

In a 3D world, there is a Robot, boxes, and switches. The robot's job is to carry boxes (one box at a time) and put them on top of switches to solve the level. All switches must have a box on top for ...
Arcane's user avatar
  • 1
2 votes
2 answers
2k views

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

Every computer science student (including myself, when I was doing my bachelor's in CS) probably encountered the famous single-source shortest path Dijkstra's algorithm (DA). If you also took an ...
nbro's user avatar
  • 40.6k
1 vote
1 answer
261 views

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

I have a 2D plane, with a fixed height and width of 10M. The plane has an agent (or robot) in the point $(1, 2.2)$, and an electric outlet in the point $(8.2, 9.1)$. The plane has a series of ...
Tlaloc-ES's user avatar
  • 113