Shortest path finding algorithms

In summary, the conversation is about finding a suitable shortest path algorithm for an autonomous device in a maze, specifically a micro-mouse. The development stage has revealed that Dijkstra's algorithm is not sufficient and a more advanced algorithm is needed. The group is discussing how to ensure that the algorithm works for all possible cases and someone suggests searching IEEE journals for recommendations. However, the available papers each have their own algorithms and the group is looking for assistance from someone who has experience with similar problems.
  • #1
shashmehro
3
0

Homework Statement


please suggest a suitable shortest path finding algorithm of an autonomous device in the maze more popularly referred to as a micro-mouse.


Homework Equations


In the development stage we have understood that simply applying djikstras would not work. Therefore we need a more advanced algorithm.


The Attempt at a Solution


How do we make sure that it works for all possible cases...It maps the entire maze and the algo is good enough to help find a suitable solution.
 
Physics news on Phys.org
  • #2
Have you tried searching IEEE journals? That's what I'd recommend.
 
  • #3
I went through a couple of papers that were available on a quick search...most of them have their own algorithms. Was hoping if somebody who was actually working on similar problems could assist us on how the difference would be from any traditional path finding algorithm.
 

FAQ: Shortest path finding algorithms

What is a shortest path finding algorithm?

A shortest path finding algorithm is a method used to find the shortest path between two points on a graph or network. It is commonly used in computer science, transportation planning, and logistics to optimize routes and minimize costs.

How do shortest path finding algorithms work?

Shortest path finding algorithms work by exploring different paths on a graph and determining the shortest one based on a certain criteria. This criteria can include the shortest distance, shortest time, or lowest cost.

What are some common shortest path finding algorithms?

Some common shortest path finding algorithms include Dijkstra's algorithm, Bellman-Ford algorithm, and A* algorithm. Each algorithm has its own advantages and are used in different scenarios.

What are the applications of shortest path finding algorithms?

Shortest path finding algorithms have various applications in real-world scenarios, such as finding the shortest route for transportation, optimizing delivery routes, planning evacuation routes, and routing data in computer networks.

What are the limitations of shortest path finding algorithms?

Shortest path finding algorithms may not always give the most optimal solution in certain scenarios, such as when there are negative weights on a graph or when the graph is constantly changing. Additionally, the time and memory complexity of these algorithms can be high for large graphs.

Similar threads

C data structures and algorithms - graph problem
Replies
2
Views
2K
Shortest path finding algorithms
Replies
1
Views
2K
Approximation Algorithms: Greedy Load Balancing/Vertex Cover
Replies
1
Views
3K
MHB Finding Shortest Path in G: Dijkstra's Algorithm
Replies
2
Views
2K
Find the curve with the shortest path on a surface (geodesic)
Replies
3
Views
2K
O(log k) GCD Algorithm which yields x and y |GCD(a,b)=ax+by
Replies
1
Views
1K
Comp Sci C++ Character Processing Algorithm
Replies
15
Views
2K
Why Does My C Program Segmentation Fault Without a Filename?
Replies
5
Views
3K
Find the shortest distance between the given vectors in 3D
Replies
1
Views
1K
MHB Find the greatest of the shortest paths
Replies
7
Views
2K

Hot Threads

Recent Insights

Back
Top