Subject:
|
Re: maze solving algorithm
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Thu, 12 Jun 2003 23:51:43 GMT
|
Viewed:
|
882 times
|
| |
|
|
How does the robot know where it is on the memory map when it starts?
Probably the mapping algorithm should be able to allow the robot to be placed
anywhere in the maze as the starting point. This requires a greater map array to
start from and an algorithm, that recognizes a 5x5 matrix has been filled.
To avoid this, the starting point should be fixed.
How is the end point defined? Is it a gap in the border of the maze?
Is it possible, to write a subroutine, that moves the robot to the next cell,
assuming, no wall is in between? Will the robot center in the cell or will
positioning errors add as he travels through the maze?
Greetings
Ralph
|
|
Message has 1 Reply:
2 Messages in This Thread:
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
