Home /Research /Non-Deterministic Finite State Automata as Termites Swarm Agent Model
SWARM

Non-Deterministic Finite State Automata as Termites Swarm Agent Model

Year
2017
Citations
2
Access
Open access

Abstract

Termites lives underground, they are relatively simple beings with their small size and small number of neurons, they are incapable of dealing with complex tasks as a group, therefore their build a mound as a gas exchange system to circulated air inside the nest. Inspired by perturbation caused by nest cavity that implies gas exchange inside termites mound, we proposed Non-Deterministic Finite State Automata (FSA) based on Moore's machine principles to describes termites natural cognitive mechanism arises among individual termites. This Natural Cognitive mechanism become the foundation of termites swarm agent rules. The aims to creating the model are helping beginner researchers or student to understands about termites behavior in case of building multiagent system based on termites swarm behavior if they are have limitations in translating a mathematical equation into real application in swarm robotics, multiagent simulation, etc. This paper is introduction paper for further development in termites FSA so our focus are explaining and elaborate theoretical foundation in order to describe cognition process in each individual agent.

Keywords

Swarm behaviourFinite-state machineAutomatonComputer scienceDeterministic finite automatonState (computer science)Finite stateCellular automatonTheoretical computer scienceAlgorithm

Related papers

Browse all SWARM papers