A Resourceful Reframing of Behavior Trees

Designers of autonomous agents, whether in physical or virtual environments, need to express nondeterminisim, failure, and parallelism in behaviors, as well as accounting for synchronous coordination between agents. Behavior Trees are a semi-formalism deployed widely for this purpose in the games industry, but with challenges to scalability, reasoning, and reuse of common sub-behaviors. We present an alternative formulation of behavior trees through a language design perspective, giving a formal operational semantics, type system, and corresponding implementation. We express specifications for atomic behaviors as linear logic formulas describing how they transform the environment, and our type system uses linear sequent calculus to derive a compositional type assignment to behavior tree expressions. These types expose the conditions required for behaviors to succeed and allow abstraction over parameters to behaviors, enabling the development of behavior "building blocks" amenable to compositional reasoning and reuse.

[1]  Dale Miller,et al.  Least and Greatest Fixed Points in Linear Logic , 2007, LPAR.

[2]  Petter Ögren,et al.  Towards a unified behavior trees framework for robot control , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[3]  D. Walker,et al.  A concurrent logical framework I: Judgments and properties , 2003 .

[4]  Bor-Yuh Evan Chang,et al.  A judgmental analysis of linear logic , 2003 .

[5]  Carsten Schürmann,et al.  Celf - A Logical Framework for Deductive and Concurrent Systems (System Description) , 2008, IJCAR.

[6]  Chris Martens.  Ceptre: A Language for Modeling Generative Interactive Systems , 2015, AIIDE.

[7]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[8]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[9]  Paolo Traverso,et al.  Automated Planning and Acting , 2016 .

[10]  Steven Rabin,et al.  Game AI Pro 2: Collected Wisdom of Game AI Professionals , 2013 .

[11]  Bernardo Toninho,et al.  Linear logic propositions as session types , 2016, Math. Struct. Comput. Sci..

[12]  A. Smaill,et al.  Planning as Deductive Synthesis in Intuitionistic Linear Logic , 2006 .

[13]  Alan Smaill,et al.  Deductive Synthesis of Recursive Plans in Linear Logic , 1999, ECP.

[14]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[15]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic I. Actions as Proofs , 1993, Theor. Comput. Sci..

[16]  Petter Ögren,et al.  Synthesis of correct-by-construction behavior trees , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).