ビヘイビアツリーとその一般化の原理的分析
A principled analysis of Behavior Trees and their generalisations
ビヘイビアツリーの反応性とモジュール性の原理を形式化し、それに基づく一般化k-BTを提案した論文。
著者: Oliver Biggar, Mohammad Zamani, Iman Shames
分類: cs.AI, cs.RO
原文アブストラクト
As complex autonomous robotic systems become more widespread, the need for transparent and reusable Artificial Intelligence (AI) designs becomes more apparent. In this paper we analyse how the principles behind Behavior Trees (BTs), an increasingly popular tree-structured control architecture, are applicable to these goals. Using structured programming as a guide, we analyse the BT principles of reactiveness and modularity in a formal framework of action selection. Proceeding from these principles, we review a number of challenging use cases of BTs in the literature, and show that reasoning via these principles leads to compatible solutions. Extending these arguments, we introduce a new class of control architectures we call generalised BTs or $k$-BTs and show how they can extend the applicability of BTs to some of the aforementioned challenging BT use cases while preserving the BT principles.
関連論文
- ロボットシステムにおける適応ニーズ:ビヘイビアツリーの評価とその拡張制御アーキテクチャ
- ROS2コントローラをモジュール化アーキテクチャで簡素化:ロボット非依存の参照生成制御アーキテクチャ
- ビヘイビアツリーによるAUV制御システムのモジュール化制御アーキテクチャ
- 検証可能で構成時に正しさが保証されるロボット機能レベル制御器制御アーキテクチャ
