時相論理制約付き引力ベースのリcedingホライズン経路計画
Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints
動的に変化する局所報酬と時相論理の監視ミッションを両立させるため、報酬獲得と監視進捗のトレードオフを選好関数で表現し、モデル検査のオートマタ手法を用いた経路計画を提案した論文。
著者: Maria Svorenova, Jana Tumova, Jiri Barnat, Ivana Cerna
分類: cs.RO
原文アブストラクト
Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collecting high rewards and the importance of making progress towards a surveyed region. Our solution leverages ideas from the automata-based approach to model checking. We demonstrate the utilization and benefits of the suggested framework in an illustrative example.
