Subject:
|
maze solving algorithm
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Sat, 10 May 2003 04:44:54 GMT
|
Original-From:
|
scott davis <RCX2MAN@HOTMAILnospam.COM>
|
Highlighted:
|
(details)
|
Viewed:
|
879 times
|
| |
|
|
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 the rover searching the whole maze and going back to
the starting square and take the shortest path to the finish square. So if
anyone can help me with the algorithm, I would be very grateful.
Thanx
Scott
|
|
Message has 3 Replies:
 | | 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
|
| 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)
|
6 Messages in This Thread:
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
