Exploration and Showcase of FSMs and HFSMs Traffic in Low-Cost Educational Driving Simulator

Abstract

Finite state machine (FSM) is a model of computation that executes an exact finite number of states at any given time where Hierarchical Finite State Machines (HFSM) can group multiple FSMs and execute as one state. Given these techniques can be used to exclusively execute certain states, it is widely used in games. In this paper we will explore and showcase the implementation of FSMs and HFSMs to create traffic non-playing characters (NPC) in our low-cost educational driving simulators. We will also discuss possible techniques that can be use. It is also in the interest to push for more understanding in any gap for traffic NPCs in similar low-cost educational driving sims in the future.