経路計画arXiv:2205.14057
反復到達目標に対する汎用最適化フレームワーク
General Optimization Framework for Recurrent Reachability Objectives
移動ロボットの経路計画において、再帰的な到達目標を効率的に達成するための戦略合成アルゴリズムを提案し、非自明な事例で有効性を示した。
著者: David Klaška, Antonín Kučera, Vít Musil, Vojtěch Řehák
分類: cs.RO, cs.GT
原文アブストラクト
We consider the mobile robot path planning problem for a class of recurrent reachability objectives. These objectives are parameterized by the expected time needed to visit one position from another, the expected square of this time, and also the frequency of moves between two neighboring locations. We design an efficient strategy synthesis algorithm for recurrent reachability objectives and demonstrate its functionality on non-trivial instances.
