ロボティクスとAIにおけるビヘイビアツリー入門
Behavior Trees in Robotics and AI: An Introduction
ロボットやゲームAIのタスク切替を構造化するビヘイビアツリーについて、従来手法との関係や設計原則、形式解析・計画・機械学習への応用、確率的拡張までを解説した書籍。
著者: Michele Colledanchise, Petter Ögren
分類: cs.RO, cs.AI
原文アブストラクト
A Behavior Tree (BT) is a way to structure the switching between different tasks in an autonomous agent, such as a robot or a virtual entity in a computer game. BTs are a very efficient way of creating complex systems that are both modular and reactive. These properties are crucial in many applications, which has led to the spread of BT from computer game programming to many branches of AI and Robotics. In this book, we will first give an introduction to BTs, then we describe how BTs relate to, and in many cases generalize, earlier switching structures. These ideas are then used as a foundation for a set of efficient and easy to use design principles. Properties such as safety, robustness, and efficiency are important for an autonomous system, and we describe a set of tools for formally analyzing these using a state space description of BTs. With the new analysis tools, we can formalize the descriptions of how BTs generalize earlier approaches. We also show the use of BTs in automated planning and machine learning. Finally, we describe an extended set of tools to capture the behavior of Stochastic BTs, where the outcomes of actions are described by probabilities. These tools enable the computation of both success probabilities and time to completion.
関連論文
- ロボティクスにおけるビヘイビアツリーのための支援プログラミングインターフェースの設計と評価ビヘイビアツリー
- 品質要件を考慮したロボットミッション向けビヘイビアツリーの拡張ビヘイビアツリー
- ビヘイビアツリーに着想を得た自律エージェント向けプログラミング言語ビヘイビアツリー
- 状態を持つビヘイビアツリーの形式化ビヘイビアツリー
- ロボティクス応用におけるビヘイビアツリーの実行意味論ビヘイビアツリー
- ビヘイビアツリーにおける並行性問題の解決ビヘイビアツリー
