Plausible Logic Facilitates Engineering the Behaviour of Autonomous Robots
File version
Author(s)
Estivill-Castro, V
Hexel, R
Rock, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
R. Fox and W. Golubski
Date
Size
718078 bytes
File type(s)
application/pdf
Location
Innsbruck, Austria
License
Abstract
In this paper we extend finite state machines to allow expressions in Plausible Logic for labelling transitions. As a result, we enable the design of behaviours that incorporate non-monotonic reasoning with a high-level software development tool. Using a cognitive software architecture that supports the efficient implementation of a developing/ programming environment, we automatically translate graphical designs of behaviour into executables that run on board autonomous robots. The graphical designs are obtained by demonstrating the transformation of the state machine into a Behavior Tree does not lose information and enhances modularisation of logic descriptions. We illustrate this with a description of the rapid development of the behaviour of a friendly poker player on an Aibo that interacts with humans.
Journal Title
Conference Title
Proceedings of the IASTED International Conference on Software Engineering, SE 2010
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2010 IASTED and ACTA Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.
Item Access Status
Note
Access the data
Related item(s)
Subject
Software Engineering
Adaptive Agents and Intelligent Robotics