Sökning: onr:"swepub:oai:DiVA.org:liu-187607" >
FOND Planning with ...
FOND Planning with Explicit Fairness Assumptions
-
- Rodriguez, Ivan D. (författare)
- Univ Pompeu Fabra, Spain
-
- Bonet, Blai (författare)
- Univ Pompeu Fabra, Spain
-
- Sardina, Sebastian (författare)
- RMIT Univ, Australia
-
visa fler...
-
- Geffner, Hector (författare)
- Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska fakulteten,Univ Pompeu Fabra, Spain; Inst Catalana Recerca & Estudis Avancats ICREA, Spain
-
visa färre...
-
(creator_code:org_t)
- 2022-06-23
- 2022
- Engelska.
-
Ingår i: The journal of artificial intelligence research. - : AI Access Foundation ; AAAI Press. - 1076-9757 .- 1943-5037. ; 74, s. 887-916
- Relaterad länk:
-
https://liu.diva-por... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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 sound and complete FOND+ planner is implemented by reducing FOND+ planning to answer set programs, and its performance is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools. Two other FOND+ planners are introduced as well which are more scalable but are not complete.
Ämnesord
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas