マルコフ連鎖に基づくロボット巡回監視の確率的戦略
Markov Chain-Based Stochastic Strategies for Robotic Surveillance
移動ロボットがグラフ上を効率的かつ予測困難に巡回監視するための確率的戦略設計の研究動向を、マルコフ連鎖の到達時間を中心にサーベイした論文。
著者: Xiaoming Duan, Francesco Bullo
分類: math.OC, cs.RO
原文アブストラクト
This article surveys recent advancements of strategy designs for persistent robotic surveillance tasks with the focus on stochastic approaches. The problem describes how mobile robots stochastically patrol a graph in an efficient way where the efficiency is defined with respect to relevant underlying performance metrics. We first start by reviewing the basics of Markov chains, which is the primary motion model for stochastic robotic surveillance. Then two main criteria regarding the speed and unpredictability of surveillance strategies are discussed. The central objects that appear throughout the treatment is the hitting times of Markov chains, their distributions and expectations. We formulate various optimization problems based on the concerned metrics in different scenarios and establish their respective properties.
