Shortest path finding algorithms

  • Thread starter Thread starter shashmehro
  • Start date Start date
  • Tags Tags
    Algorithms Path
AI Thread Summary
For implementing a shortest path finding algorithm for an autonomous device in a maze, Dijkstra's algorithm may not be sufficient, necessitating the exploration of more advanced alternatives. The discussion emphasizes the importance of ensuring the algorithm can handle all potential scenarios within the maze. Recommendations include researching IEEE journals for existing algorithms that have been tested in similar contexts. Participants express a desire for insights from those with practical experience in developing such algorithms. Overall, the conversation seeks effective solutions tailored to the unique challenges posed by maze navigation.
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

Back
Top