论文标题
复发性目标的一般优化框架
General Optimization Framework for Recurrent Reachability Objectives
论文作者
论文摘要
我们考虑一系列复发性可及性目标的移动机器人路径计划问题。这些目标是通过访问一个位置的预期时间，这段时间的预期平方以及两个相邻位置之间移动频率的参数参数。我们设计了一种有效的策略综合算法，以实现复发性目标目标，并在非平凡实例上证明了其功能。
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.
