Subject:
|
wandering robot
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Tue, 15 Jun 1999 22:28:44 GMT
|
Viewed:
|
835 times
|
| |
|
|
Lots of mobile robots start with wandering around, seeking for something to do
(walls to follow, lines to track, soda cans to collect, etc.). When their
sensors detect nothing, usually they fall back wandering again. Now, what is
your favorite wandering algorithm? Brownian random walk?
I am thinking about using one of the plane-filling curves, like the Hilbert
curve or the Sierpinski curve. Unfortunately, these recursive curves are
difficult to code in NQC. (One more reason to switch to a real OS, maybe.
However, having all the troubles just for a cute wandering algorithm seems to
be a bit overkill, to begin with.)
Cheers,
Hao-yang Wang
|
|
1 Message in This Thread:
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
