arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.08391cs.AI
收藏

具有显式公平性假设的灵活FOND规划

Flexible FOND Planning with Explicit Fairness Assumptions

Universitat Pompeu Fabra(庞培法布拉大学);RMIT University(皇家墨尔本理工大学)

Ivan D. Rodriguez, Blai Bonet, Sebastian Sardina, Hector Geffner

摘要:

我们考虑的问题,达到一个命题的目标条件完全可观察的非确定性(FOND)规划下的公平性假设,明确给出的一般类。公平性假设的形式是A/B,并且说状态轨迹包含来自A的动作a在状态s中的无限次出现和来自B的动作的有限次出现,也必须包含动作a在s中的无限次出现,随后是它的每一个可能结果。违反这个条件的无限轨迹被认为是不公平的,并且解决方案是所有公平轨迹都达到目标状态的策略。我们表明,强和强循环FOND规划,以及QNP规划,最近推出的规划模型广义规划,都是特殊情况下的FOND规划与公平性假设,这种形式也可以结合起来。这种形式的规划被称为FOND+规划,它结合了FOND规划的语法和LTL的一些多功能性,用于表达公平约束。一个新的规划器是通过减少FOND+规划的答案集程序,和规划器的性能进行了评估比较FOND和QNP规划器,LTL合成工具。

英文摘要:

We consider the problem of reaching a propositional goal condition in fully-observable non-deterministic (FOND) planning under a general class of fairness assumptions that are given explicitly. The fairness assumptions are of the form A/B and say that state trajectories that contain infinite occurrences of an action a from A in a state s and finite occurrence of actions from B, must also contain infinite occurrences of action a in s followed by each one of its possible outcomes. The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state. We show that strong and strong-cyclic FOND planning, as well as QNP planning, a planning model introduced recently for generalized planning, are all special cases of FOND planning with fairness assumptions of this form which can also be combined. FOND+ planning, as this form of planning is called, combines the syntax of FOND planning with some of the versatility of LTL for expressing fairness constraints. A new planner is implemented by reducing FOND+ planning to answer set programs, and the performance of the planner is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑