General Optimization Framework for Recurrent Reachability Objectives.

David Klaška,Antonín Kučera,Vít Musil, Vojtěch Řehák

European Conference on Artificial Intelligence（2022）

引用 0|浏览18

暂无评分

摘要

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.

查看译文

关键词

Planning and Scheduling: Robot Planning,Agent-based and Multi-agent Systems: Algorithmic Game Theory,Agent-based and Multi-agent Systems: Mechanism Design,Planning and Scheduling: Planning Algorithms,Planning and Scheduling: Theoretical Foundations of Planning

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要