Abstract
Most simple robots don’t show much interesting behavior. Usually, a sequential program flow regulates their actions: the robot walks until it sees an obstacle, it backs up and turns, and then starts walking forward again in a loop.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Daniele Benedettelli
About this chapter
Cite this chapter
(2008). Finite State Machines. In: Creating Cool MINDSTORMS® NXT Robots. Apress. https://doi.org/10.1007/978-1-4302-0599-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4302-0599-9_3
Publisher Name: Apress
Print ISBN: 978-1-59059-966-2
Online ISBN: 978-1-4302-0599-9
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)