Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 2017 | Submitted
Book Section - Chapter Open

Synthesis of correct-by-construction behavior trees

Abstract

In this paper we study the problem of synthesizing correct-by-construction Behavior Trees (BTs) controlling agents in adversarial environments. The proposed approach combines the modularity and reactivity of BTs with the formal guarantees of Linear Temporal Logic (LTL) methods. Given a set of admissible environment specifications, an agent model in form of a Finite Transition System and the desired task in form of an LTL formula, we synthesize a BT in polynomial time, that is guaranteed to correctly execute the desired task. To illustrate the approach, we present three examples of increasing complexity.

Additional Information

© 2017 IEEE. Date Added to IEEE Xplore: 14 December 2017. This work has been supported by the SARAFun project, partially funded by the EU within H2020-ICT-2014. We thank Ioannis Filippidis for his valuable input into this paper.

Attached Files

Submitted - cmo17-iros_s.pdf

Files

cmo17-iros_s.pdf
Files (1.9 MB)
Name Size Download all
md5:e5088101a48334e1409cbba5a479821b
1.9 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023