Flexible FOND planning with explicit fairness assumptions

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Rodriguez, Ivan D.
• dc.contributor.author Bonet, Blai
• dc.contributor.author Sardina, Sebastian
• dc.contributor.author Geffner, Héctor
• dc.date.accessioned 2023-03-01T07:25:56Z
• dc.date.available 2023-03-01T07:25:56Z
• dc.date.issued 2021
• dc.description.abstract 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.
• dc.description.sponsorship The work is partially supported by an ERC Advanced Grant (No 885107), the project TAILOR, funded by an EU Horizon 2020 Grant (No 952215), and by the Knut and Al-ice Wallenberg (KAW) Foundation under the WASP pro-gram. Hector Geffner is a Wallenberg Guest Professor at Linköping University, Sweden.
• dc.format.mimetype application/pdf
• dc.identifier.citation Rodriguez ID, Bonet B, Sardiña S, Geffner H. Flexible FOND planning with explicit fairness assumptions. Proceedings of the International Conference on Automated Planning and Scheduling. 2021;31:290-8. DOI: 10.1609/icaps.v31i1.15973
• dc.identifier.doi http://dx.doi.org/10.1609/icaps.v31i1.15973
• dc.identifier.issn 2334-0835
• dc.identifier.uri http://hdl.handle.net/10230/55979
• dc.language.iso eng
• dc.publisher Association for the Advancement of Artificial Intelligence (AAAI)
• dc.relation.ispartof Proceedings of the International Conference on Automated Planning and Scheduling. 2021;31:290-8.
• dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/952215
• dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/885107
• dc.rights © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org)
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword Planning and Scheduling
• dc.title Flexible FOND planning with explicit fairness assumptions
• dc.type info:eu-repo/semantics/article
• dc.type.version info:eu-repo/semantics/acceptedVersion