Show simple item record

dc.contributor.authorCheng, Yun-Quan
dc.contributor.authorMansor, Sarina
dc.contributor.authorChin, Ji-Jian
dc.contributor.authorAbdul Karim, Hezerul
dc.contributor.authorBan, Kar Weng

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.

dc.publisherSpringer Nature Singapore
dc.relation.ispartofLecture Notes in Electrical Engineering
dc.titleExploration and Showcase of FSMs and HFSMs Traffic in Low-Cost Educational Driving Simulator
plymouth.volume983 LNEE
plymouth.organisational-group|Plymouth|Faculty of Science and Engineering
plymouth.organisational-group|Plymouth|Faculty of Science and Engineering|School of Engineering, Computing and Mathematics
plymouth.organisational-group|Plymouth|Users by role
plymouth.organisational-group|Plymouth|Users by role|Academics

Files in this item


This item appears in the following Collection(s)

Show simple item record

All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
Atmire NV