Subject:
|
Re: Multitasking
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Wed, 21 Jul 2004 00:37:37 GMT
|
Viewed:
|
1064 times
|
| |
|
|
In lugnet.robotics, Steve Baker <sjbaker1@airmail.net> wrote:
> A useful technique (which doesn't really require parallel threads)
> is called a "State Machine" (also known as a "Finite State Automaton"
> or FSA for short).
>
> The idea is to list all the 'states' the robot can be in and to
> assign a number to each state. In this case, that might be:
Steve,
I just want to say thanks for your clear explanation. I have heard the term
state machine tossed around a lot, but didn't really know what it was. (Not all
of us robotics guys are computer programmers for a living!) I don't need to
write such a thing now, but I will defenitely refer to this in the future.
Also, I just recently found out how a lookup table works. For many its obvious,
but for a mechanical guy who hasn't taken much programming, it wasn't. Thanks
again for your help,
Rob
|
|
Message is in Reply To:
 | | Re: Multitasking
|
| (...) A useful technique (which doesn't really require parallel threads) is called a "State Machine" (also known as a "Finite State Automaton" or FSA for short). The idea is to list all the 'states' the robot can be in and to assign a number to each (...) (20 years ago, 19-Jul-04, to lugnet.robotics)
|
5 Messages in This Thread:
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
