An abstract state machine (ASM) is a mathematical model of the system's evolving, runtime state. ASMs can be used to faithfully capture the abstract structure and step-wise behaviour of any discrete systems. An easy way to understand ASMs is to see them as defining a succession of states that may follow an initial state. We present a machine-executable model for an Intelligent Vehicle Control System, implemented in the specification language AsmL. Executable specifications are descriptions of how software components work. AsmL is capable of describing the evolving state of asynchronous, concurrent systems, such as agent - based systems. The mathematical background for the intelligent control of vehicles is represented by the stochastic automata. A stochastic automaton can perform a finite number of actions in a random environment. When a specific action is performed, the environment responds by producing an environment output that is stochastically related to the action. This response may be favourable or unfavourable. The proposed model is verified through simulation in SpecExplorer tool from Microsoft Research.
[1]
Richard S. Sutton,et al.
Reinforcement Learning: An Introduction
,
1998,
IEEE Trans. Neural Networks.
[2]
Olivier Buffet,et al.
Incremental reinforcement learning for designing multi-agent systems
,
2001,
AGENTS '01.
[3]
Sridhar Mahadevan,et al.
Recent Advances in Hierarchical Reinforcement Learning
,
2003,
Discret. Event Dyn. Syst..
[4]
Pushkin Kachroo,et al.
Multiple stochastic learning automata for vehicle path control in an automated highway system
,
1999,
IEEE Trans. Syst. Man Cybern. Part A.
[5]
Yufeng Liu,et al.
Stochastic Direct Reinforcement: Application to Simple Games with Recurrence
,
2004,
AAAI Technical Report.
[6]
Richard S. Sutton,et al.
Introduction to Reinforcement Learning
,
1998
.
[7]
S. Lakshmivarahan,et al.
Absolutely Expedient Learning Algorithms For Stochastic Automata
,
1973
.