ビヘイビアツリーに基づく共生型自律移動ロボットの人物探索
Behavior-Tree-Based Person Search for Symbiotic Autonomous Mobile Robot Tasks
ビヘイビアツリーでモジュール化した行動系列を離散時間マルコフ連鎖として解析し、ロボットが人を探すべきか待つべきかを確率的に推定する手法を提案。大学建物での588回の実世界実験で成功率と所要時間の優位性を示した。
著者: Marvin Stuede, Timo Lerche, Martin Alexander Petersen, Svenja Spindeldreier
分類: cs.RO
原文アブストラクト
We consider the problem of people search by a mobile social robot in case of a situation that cannot be solved by the robot alone. Examples are physically opening a closed door or operating an elevator. Based on the Behavior Tree framework, we create a modular and easily extendable action sequence with the goal of finding a person to assist the robot. By decomposing the Behavior Tree as a Discrete Time Markov Chain, we obtain an estimate of the probability and rate of success of the options for action, especially where the robot should wait or search for people.In a real-world experiment, the presented method is compared with other common approaches in a total of 588 test runs over the course of one week, starting at two different locations in a university building. We show our method to be superior to other approaches in terms of success rate and duration until a finding person and returning to the start location.
