ユーザ選好を考慮した緩和タスク満足のためのA*ベース時相論理経路計画
A*-based Temporal Logic Path Planning with User Preferences on Relaxed Task Satisfaction
時相論理タスクを完全に満たせない場合に、ユーザの緩和選好を組み込んで最良の満足度を達成するA*ベースの計画フレームワークを提案し、大規模環境での効率的な計画を可能にした。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Disha Kamale, Xi Yu, Cristian-Ioan Vasile
分類: cs.RO
原文アブストラクト
In this work, we consider the problem of planning for temporal logic tasks in large robot environments. When full task compliance is unattainable, we aim to achieve the best possible task satisfaction by integrating user preferences for relaxation into the planning process. Utilizing the automata-based representations for temporal logic goals and user preferences, we propose an A*-based planning framework. This approach effectively tackles large-scale problems while generating near-optimal high-level trajectories. To facilitate this, we propose a simple, efficient heuristic that allows for planning over large robot environments in a fraction of time and search memory as compared to uninformed search algorithms. We present extensive case studies to demonstrate the scalability, runtime analysis as well as empirical bounds on the suboptimality of the proposed heuristic.
