 | | maze solving algorithm
|
| Hi, I was wondering if somebody could help me out with different types of maze solving algorithms. I'm using a synchrodrive robot to navigate the maze and a hitechnic distance sensor to find where the walls are. I'm trying to tackle the problem of (...) (21 years ago, 10-May-03, to lugnet.robotics)
| | | | | Re: maze solving algorithm
|
| Hi Scott, which part of this algorithm are you looking for? Low-level control stuff for moving the robot & sensing it's position, or mapping out the maze as it travels, or a higher level algorithm for determining the best path, or accurate (...) (21 years ago, 10-May-03, to lugnet.robotics)
| | | | | Re: maze solving algorithm
|
| I'm looking for ways to map out the maze and determining which path is the shortest. thanx scott ---- Original Message ----- From: "Paul Szego" <paul.szego@nebulon.com> To: "scott davis" <rcx2man@hotmail.com> Cc: <lego-robotics@crynwr.com> Sent: (...) (21 years ago, 12-May-03, to lugnet.robotics)
| | | | | Re: maze solving algorithm
|
| For the shortest path, something like Dijkstra's algorithm is a starting point: (URL) do a search and you will find any number of hits, lots woth coding examples in your favourite language. If you want more advanced, search in general for "shortest (...) (21 years ago, 12-May-03, to lugnet.robotics)
| | | | | Re: maze solving algorithm
|
| Hi Scott, For help on this subject I have turned to this site often: (URL) particular "The Maze" section ((URL) has many points on solving the maze. Also, this is a classic mathematics/computer science problem that has several formalized approaches (...) (21 years ago, 12-May-03, to lugnet.robotics)
| | | | | Re: maze solving algorithm
|
| One way to map a maze is to put each square into an array and use cartesian coordinates (X,Y) corisponding to each square. A 5 X 5 maze would look like so: [X,Y] [0,0][0,1][0,2][0,3][0,4] [1,0][1,1][1,2][1,3][1,4] [2,0][2,1][2,2][2,3][2,4] (...) (21 years ago, 21-May-03, to lugnet.robotics)
| |
