2000 character limit reached
Designing Behavior Trees from Goal-Oriented LTLf Formulas (2307.06399v2)
Published 12 Jul 2023 in cs.AI
Abstract: Temporal logic can be used to formally specify autonomous agent goals, but synthesizing planners that guarantee goal satisfaction can be computationally prohibitive. This paper shows how to turn goals specified using a subset of finite trace Linear Temporal Logic (LTL) into a behavior tree (BT) that guarantees that successful traces satisfy the LTL goal. Useful LTL formulas for achievement goals can be derived using achievement-oriented task mission grammars, leading to missions made up of tasks combined using LTL operators. Constructing BTs from LTL formulas leads to a relaxed behavior synthesis problem in which a wide range of planners can implement the action nodes in the BT. Importantly, any successful trace induced by the planners satisfies the corresponding LTL formula. The usefulness of the approach is demonstrated in two ways: a) exploring the alignment between two planners and LTL goals, and b) solving a sequential key-door problem for a Fetch robot.
- Stochastic finite state control of pomdps with ltl specifications. arXiv preprint arXiv:2001.07679 (2020).
- Marco Antoniotti and Bud Mishra. 1995. Discrete event models+ temporal logic= supervisory controller: Automatic synthesis of locomotion controllers. In Proceedings of 1995 IEEE International Conference on Robotics and Automation, Vol. 2. IEEE, 1441–1446.
- Fahiem Bacchus and Froduald Kabanza. 1998. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22, 1-2 (1998), 5–27.
- Jirı Barnat et al. 2002. How to distribute LTL model-checking using decomposition of negative claim automaton. In SOFSEM. 9–14.
- MBP: a model based planner. In Proc. of the IJCAI’01 Workshop on Planning under Uncertainty and Incomplete Information.
- Oliver Biggar and Mohammad Zamani. 2020. A framework for formal verification of behavior trees with linear temporal logic. IEEE Robotics and Automation Letters 5, 2 (2020), 2341–2348.
- On modularity in reactive control architectures, with an application to formal verification. ACM Transactions on Cyber-Physical Systems (TCPS) 6, 2 (2022), 1–36.
- Minimalistic Gridworld Environment for Gymnasium. https://github.com/Farama-Foundation/Minigrid
- Synthesis of correct-by-construction behavior trees. In 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 6039–6046.
- Michele Colledanchise and Petter Ögren. 2016. How behavior trees generalize the teleo-reactive paradigm and and-or-trees. In 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 424–429.
- Michele Colledanchise and Petter Ögren. 2018. Behavior trees in robotics and AI: An introduction. CRC Press.
- LTL control in uncertain environments with probabilistic satisfaction guarantees. IFAC Proceedings Volumes 44, 1 (2011), 3515–3520.
- Hybrid controllers for path planning: A temporal logic approach. In Proceedings of the 44th IEEE Conference on Decision and Control. IEEE, 4885–4890.
- Temporal logic motion planning for mobile robots. In Proceedings of the 2005 IEEE International Conference on Robotics and Automation. IEEE, 2020–2025.
- Rune M Jensen and Manuela M Veloso. 2000. OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research 13 (2000), 189–226.
- Joachim Klein and Christel Baier. 2006. Experiments with deterministic ω𝜔\omegaitalic_ω-automata for formulas of linear temporal logic. Theoretical Computer Science 363, 2 (2006), 182–195.
- Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees. In 2010 IEEE International Conference on Robotics and Automation. IEEE, 3227–3232.
- LTL is closed under topological closure. Inform. Process. Lett. 114, 8 (2014), 408–413.
- Towards a unified behavior trees framework for robot control. In Robotics and Automation (ICRA), 2014 IEEE International Conference on. IEEE, 5420–5427.
- Aadesh Neupane. 2023. Designing Resilient Agents Using Grammatical Evolution, Behavior Trees, and Finite Linear Temporal Logic. (2023).
- Ronald Parr and Stuart J Russell. 1998. Reinforcement learning with hierarchies of machines. In Advances in neural information processing systems. 1043–1049.
- Synthesis of reactive (1) designs. In International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer, 364–380.
- Amir Pnueli. 1977. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE, 46–57.
- Amir Pnueli and Roni Rosner. 1989. On the synthesis of a reactive module. In Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. 179–190.
- Kristin Y Rozier and Moshe Y Vardi. 2011. A multi-encoding approach for LTL symbolic satisfiability checking. In International Symposium on Formal Methods. Springer, 417–431.
- Stuart J Russell. 2010. Artificial intelligence a modern approach. Pearson Education, Inc.
- A learning based approach to control synthesis of markov decision processes for linear temporal logic specifications. In 53rd IEEE Conference on Decision and Control. IEEE, 1091–1096.
- Decomposition of finite LTL specifications for efficient multi-agent planning. In Distributed Autonomous Robotic Systems. Springer, 253–267.
- Parameterizing behavior trees. In International conference on motion in games. Springer, 144–155.
- A Prasad Sistla. 1994. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing 6, 5 (1994), 495–511.
- Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial intelligence 112, 1-2 (1999), 181–211.
- Specification-guided behavior tree synthesis and execution for coordination of autonomous systems. Expert Systems with Applications 201 (2022), 117022.
- Teaching multiple tasks to an RL agent using LTL. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 452–461.
- Goals in agent systems: a unifying framework. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 2. International Foundation for Autonomous Agents and Multiagent Systems, 713–720.
- Cristian Ioan Vasile and Calin Belta. 2013. Sampling-based temporal logic path planning. In 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 4817–4822.
- Learning task specifications from demonstrations. In Advances in Neural Information Processing Systems. 5367–5377.
- Fetch and freight: Standard platforms for service robot applications. In Workshop on autonomous mobile service robots. 1–6.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.