時間論理制約下でのロバストなマルチロボット最適経路計画
Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints
複数ロボットが共通のLTLミッションを満たしつつ、移動時間の不確実性があっても最適化命題の達成間隔を最小化するロバスト経路計画手法を提案し、道路網での持続監視タスクで評価した。
著者: Alphan Ulusoy, Stephen L. Smith, Xu Chu Ding, Calin Belta
分類: cs.RO
原文アブストラクト
In this paper we present a method for automatically planning robust optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied even with uncertainty in the robots' traveling times. We characterize a class of LTL formulas that are robust to robot timing errors, for which we generate optimal paths if no timing errors are present, and we present bounds on the deviation from the optimal values in the presence of errors. We implement and experimentally evaluate our method considering a persistent monitoring task in a road network environment.
