Home /Research /Verifying Safety of Behaviour Trees in Event-B
OTHER

Verifying Safety of Behaviour Trees in Event-B

Matteo Tadiello, Elena Troubitsynå

Year
2022
Citations
2
Access
Open access

Abstract

Behavior Trees (BT) are becoming increasingly popular in the robotics community. The BT tool is well suited for decision-making applications allowing a robot to perform complex behavior while being explainable to humans as well. Verifying that BTs used are well constructed with respect to safety and reliability requirements is essential, especially for robots operating in critical environments. In this work, we propose a formal specification of Behavior Trees and a methodology to prove invariants of already used trees, while keeping the complexity of the formalization of the tree simple for the final user. Allowing the possibility to test the particular instance of the behavior tree without the necessity to know the more abstract levels of the formalization.

Keywords

Computer scienceRobotArtificial intelligenceTree (set theory)Event (particle physics)RoboticsSimple (philosophy)Reliability (semiconductor)Fault tree analysisMachine learning

Related papers

Browse all OTHER papers