This paper, a discussion of fundamental finite-state algorithms, constitutes an approach from the perspective of dynamic system control. First, we describe fundamental properties of deterministic finite-state automata. We propose an algorithm focused on correct finite-state automaton state switching. This approach will then be used to propose a finite-state automaton to solve real-time movement in a maze. We also illustrate the use of such a proposed approach to control movement in a robotic system which requires correct states to achieve correct movement. Evaluation of achieved outputs is described in the conclusion, which also includes the future focus of the proposed way of finite-state automaton state switching.
CITATION STYLE
Jaluvka, M., Volna, E., & Kotyrba, M. (2019). Motion Controlling Using Finite-State Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11432 LNAI, pp. 455–464). Springer Verlag. https://doi.org/10.1007/978-3-030-14802-7_39
Mendeley helps you to discover research relevant for your work.