Shortest path finding algorithms

  • Thread starter Thread starter shashmehro
  • Start date Start date
  • Tags Tags
    Algorithms Path
Click For Summary
SUMMARY

The discussion focuses on selecting an appropriate shortest path finding algorithm for an autonomous device navigating a maze, specifically in the context of a micro-mouse project. It highlights that traditional algorithms like Dijkstra's are insufficient for this application, necessitating the exploration of more advanced algorithms. Participants recommend researching IEEE journals for innovative algorithms that have been developed for similar challenges, emphasizing the need for a solution that can handle all possible maze configurations.

PREREQUISITES
  • Understanding of Dijkstra's algorithm and its limitations
  • Familiarity with maze navigation concepts
  • Knowledge of advanced pathfinding algorithms such as A* or Bellman-Ford
  • Experience with algorithm analysis and performance evaluation
NEXT STEPS
  • Research advanced pathfinding algorithms like A* and their applications in maze navigation
  • Explore IEEE journals for recent developments in autonomous navigation algorithms
  • Study algorithm performance metrics to evaluate efficiency in maze-solving
  • Investigate real-world implementations of micro-mouse projects for practical insights
USEFUL FOR

Students, robotics enthusiasts, and developers working on autonomous navigation systems, particularly those focused on maze-solving algorithms and micro-mouse competitions.

shashmehro
Messages
3
Reaction score
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
Have you tried searching IEEE journals? That's what I'd recommend.
 
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.
 

Similar threads

C data structures and algorithms - graph problem
  • · Replies 2 ·
Replies
2
Views
2K
Shortest path finding algorithms
  • · Replies 1 ·
Replies
1
Views
2K
MHB Finding Shortest Path in G: Dijkstra's Algorithm
  • · Replies 2 ·
Replies
2
Views
2K
Find the curve with the shortest path on a surface (geodesic)
  • · Replies 3 ·
Replies
3
Views
3K
Comp Sci C++ Character Processing Algorithm
  • · Replies 15 ·
Replies
15
Views
3K
Find the shortest distance between the given vectors in 3D
  • · Replies 1 ·
Replies
1
Views
2K
Why Does My C Program Segmentation Fault Without a Filename?
  • · Replies 5 ·
Replies
5
Views
4K
MHB Find the greatest of the shortest paths
  • · Replies 7 ·
Replies
7
Views
3K
Graduate Algorithm for multidimensional constrained root finding
  • · Replies 1 ·
Replies
1
Views
3K
Shortest path between two points on a paraboloid
  • · Replies 11 ·
Replies
11
Views
3K