{"type":"ScholarlyArticle","title":"Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains","authors":[{"name":"Ronen I. Brafman","slug":"ronen-i-brafman","given":"Ronen I.","family":"Brafman","affiliation":"Ben-Gurion University , Israel"},{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":"Università di Roma \"La Sapienza\" , Italy"}],"abstract":"In this paper, we investigate non-Markovian Nondeterministic Fully Observable Planning Domains (NMFONDs), variants of Nondeterministic Fully Observable Planning Domains (FONDs) where the next state is determined by the full history leading to the current state.  In particular, we introduce TFONDs which are NMFONDs where conditions on the history are succinctly and declaratively specified using the linear-time temporal logic on finite traces LTLf and its extension LDLf.  We provide algorithms for planning in TFONDs for general LTLf/LDLf goals, and establish tight complexity bounds w.r.t. the domain representation and the goal, separately. We also show that TFONDs are able to capture all NMFONDs in which the dependency on the history is \"finite state\". Finally, we show that TFONDs also capture  Partially Observable Nondeterministic Planning Domains (PONDs), but without referring to unobservable variables.","doi":"10.24963/ijcai.2019/222","url":"https://ijcai.org/proceedings/2019/222","pdf":"https://ijcai.org/proceedings/2019/0222.pdf","markdown":"https://ijcai.org/proceedings/2019/222.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/222","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":222,"pages":{"first":1602,"last":1608},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Planning and Scheduling: Conformant;Contingent  planning","Knowledge Representation and Reasoning: Action, Change and Causality"],"videos":[],"references":[{"position":1,"raw":"[Alford et al., 2014] Ronald Alford, Ugur Kuter, Dana S. Nau, and Robert P. Goldman. Plan aggregation for strong cyclic planning in nondeterministic domains. Artif. Intell., 216:206-232, 2014.","title":"Plan aggregation for strong cyclic planning in nondeterministic domains","authors":"Ronald Alford, Ugur Kuter, Dana S Nau, Robert P Goldman","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonet and Geffner, 2000] Blai Bonet and Hector Geffner. Planning with incomplete information as heuristic search in belief space. In AIPS, pages 52-61. AAAI, 2000.","title":"Planning with incomplete information as heuristic search in belief space","authors":"Geffner ; ] Blai Bonet, Hector Bonet, Geffner","year":"2000","venue":"AIPS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brafman et al., 2018] Ronen Brafman, Giuseppe De Gia- como, and Fabio Patrizi. LTLf/LDLf non-Markovian re- wards. In AAAI, 2018.","title":"LTLf/LDLf non-Markovian rewards","authors":"Ronen Brafman, Giuseppe De, Giacomo, Fabio Patrizi","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Camacho et al., 2017] Alberto Camacho, Eleni Triantafillou, Christian Muise, Jorge A. Baier, and Sheila McIlraith. Non- deterministic planning with temporally extended goals: LTL over finite and infinite traces. In AAAI, 2017.","title":"Nondeterministic planning with temporally extended goals: LTL over finite and infinite traces","authors":"Alberto Camacho, Eleni Triantafillou, Christian Muise, Jorge A Baier, Sheila Mcilraith","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Camacho et al., 2018a] Alberto Camacho, Jorge A. Baier, Christian J. Muise, and Sheila A. McIlraith. Finite LTL synthesis as planning. In ICAPS, 2018.","title":"Finite LTL synthesis as planning","authors":"Camacho","year":"2018","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Camacho et al., 2018b] Alberto Camacho, Christian J. Muise, Jorge A. Baier, and Sheila A. McIlraith. Synkit: LTL synthesis as a service. In IJCAI, pages 5817-5819, 2018.","title":"Synkit: LTL synthesis as a service","authors":"Camacho","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/848"},{"position":7,"raw":"[De Giacomo and Rubin, 2018] Giuseppe De Giacomo and Sasha Rubin. Automata-theoretic foundations of FOND planning for LTLf and LDL f goals. In IJCAI, 2018.","title":"Automata-theoretic foundations of FOND planning for LTLf and LDL f goals","authors":"De Giacomo, Rubin, Giuseppe De, Giacomo, Sasha Rubin","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[De Giacomo and Vardi, 2013] Giuseppe De Giacomo and Moshe Y. Vardi. Linear temporal logic and linear dynamic logic on finite traces. In IJCAI, 2013.","title":"Linear temporal logic and linear dynamic logic on finite traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/132"},{"position":9,"raw":"[De Giacomo and Vardi, 2015] Giuseppe De Giacomo and Moshe Y. Vardi. Synthesis for LTL and LDL on finite traces. In IJCAI, 2015.","title":"Synthesis for LTL and LDL on finite traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/223"},{"position":10,"raw":"[Fischer and Ladner, 1979] Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. Com. Systems and Science, 18, 1979.","title":"Propositional dynamic logic of regular programs","authors":"J Michael, Richard E Fischer, Ladner","year":"1979","venue":"J. Com. Systems and Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fu et al., 2016] Jicheng Fu, Andres Calderon Jaramillo, Vin- cent Ng, Farokh B. Bastani, and I-Ling Yen. Fast strong planning for fully observable nondeterministic planning problems. Ann. Math. Artif. Intell., 78(2):131-155, 2016.","title":"Fast strong planning for fully observable nondeterministic planning problems","authors":"Jicheng Fu, Andres Calderon Jaramillo, Vincent Ng, Farokh B Bastani, I-Ling Yen","year":"2016","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gabaldon, 2011] Alfredo Gabaldon. Non-Markovian control in the situation calculus. Artif. Intell., 175(1):25-48, 2011.","title":"Non-Markovian control in the situation calculus","authors":"Alfredo Gabaldon","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Geffner and Bonet, 2013] Hector Geffner and Blai Bonet. A Coincise Introduction to Models and Methods for Auto- mated Planning. Morgan&Claypool, 2013.","title":"A Coincise Introduction to Models and Methods for Automated Planning","authors":"Bonet Geffner, Hector Geffner, Blai Bonet","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Geffner and Geffner, 2018] Tomas Geffner and Hector Geffner. Compact policies for fully observable non- deterministic planning as SAT. In ICAPS, 2018.","title":"Compact policies for fully observable nondeterministic planning as SAT","authors":"Geffner Geffner, Tomas Geffner, Hector Geffner","year":"2018","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Giunchiglia and Lifschitz, 1995] Enrico Giunchiglia and Vladimir Lifschitz. Dependent fluents. In IJCAI, 1995.","title":"Dependent fluents","authors":"Enrico Giunchiglia, Vladimir Lifschitz","year":"1995","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Goldman and Boddy, 1996] Robert P. Goldman and Mark S. Boddy. Expressive planning and explicit knowledge. In AIPS, 1996.","title":"Expressive planning and explicit knowledge","authors":"Robert P Goldman, Mark S Boddy","year":"1996","venue":"AIPS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gonzalez et al., 2005] Graciela Gonzalez, Chitta Baral, and Michael Gelfond. Alan: An action language for modelling non-markovian domains. Studia Logica, 79(1):115-134, 2005.","title":"Alan: An action language for modelling non-markovian domains","authors":"Graciela Gonzalez, Chitta Baral, Michael Gelfond","year":"2005","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Harel et al., 2000] David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. MIT Press, 2000.","title":"Dynamic Logic","authors":"David Harel, Dexter Kozen, Jerzy Tiuryn","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hopcroft and Ullman, 1979] J. Hopcroft and J. Ullman. In- troduction to Automata Theory, Languages, and Computa- tion. Addison-Wesley, 1979.","title":"Introduction to Automata Theory, Languages, and Computation","authors":"J Hopcroft, J Ullman","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kaelbling et al., 1998] Leslie Pack Kaelbling, Michael L. Littman, and Anthony R. Cassandra. Planning and act- ing in partially observable stochastic domains. Artif. Intell., 101(1-2):99-134, 1998.","title":"Planning and acting in partially observable stochastic domains","authors":"Leslie Pack Kaelbling, Michael L Littman, Anthony R Cassandra","year":"1998","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kissmann and Edelkamp, 2011] Peter Kissmann and Stefan Edelkamp. Gamer, a general game playing agent. KI, 25(1):49-52, 2011.","title":"Gamer, a general game playing agent","authors":"Peter Kissmann, Stefan Edelkamp","year":"2011","venue":"KI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lodaya, 2012] Kamal Lodaya. A language-theoretic view of verification. In Modern Applications of Automata Theory, pages 149-170. World Scientific, 2012.","title":"A language-theoretic view of verification","authors":"Kamal Lodaya","year":"2012","venue":"Modern Applications of Automata Theory","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mattmüller et al., 2010] Robert Mattmüller, Manuela Or- tlieb, Malte Helmert, and Pascal Bercher. Pattern database heuristics for fully observable nondeterministic planning. In ICAPS, 2010.","title":"Pattern database heuristics for fully observable nondeterministic planning","authors":"Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher","year":"2010","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mendez et al., 1996] Gisela Mendez, Jorge Lobo, Jimena Llopis, and Chitta Baral. Temporal logic and reasoning about actions. In 3rd Symp. on Logical Formalizations of Commonsense Reasoning, 1996.","title":"Temporal logic and reasoning about actions","authors":"Gisela Mendez, Jorge Lobo, Jimena Llopis, Chitta Baral","year":"1996","venue":"3rd Symp. on Logical Formalizations of Commonsense Reasoning","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Muise et al., 2012] Christian J. Muise, Sheila A. McIlraith, and J. Christopher Beck. Improved non-deterministic plan- ning by exploiting state relevance. In ICAPS, 2012.","title":"Improved non-deterministic planning by exploiting state relevance","authors":"Christian J Muise, Sheila A Mcilraith, J Christopher Beck","year":"2012","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pnueli, 1977] Amir Pnueli. The temporal logic of programs. In FOCS, 1977.","title":"The temporal logic of programs","authors":"Amir Pnueli, Pnueli","year":"1977","venue":"FOCS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Puterman, 2005] Martin L. Puterman. Markov Decision Pro- cesses: Discrete Stochastic Dynamic Programming. Wiley, 2005.","title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","authors":"Martin L Puterman","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rabin and Scott, 1959] Michael O. Rabin and Dana Scott. Finite automata and their decision problems. IBM J. Res. Dev., 3:114-125, April 1959.","title":"Finite automata and their decision problems","authors":"O Michael, Dana Rabin, Scott","year":"1959","venue":"IBM J. Res. Dev","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Reif, 1984] John H. Reif. The complexity of two-player games of incomplete information. Journal of Computer and System Sciences, 29(2):274 -301, 1984.","title":"The complexity of two-player games of incomplete information","authors":"John H Reif","year":"1984","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Reiter, 2001] Raymond Reiter. Knowledge in Action: Logi- cal Foundations for Specifying and Implementing Dynami- cal Systems. The MIT Press, 2001.","title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","authors":"Raymond Reiter","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Rintanen, 2004] Jussi Rintanen. Complexity of planning with partial observability. In ICAPS, 2004.","title":"Complexity of planning with partial observability","authors":"Jussi Rintanen","year":"2004","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Tabakov and Vardi, 2005] Deian Tabakov and Moshe Y. Vardi. Experimental evaluation of classical automata con- structions. In LPAR, 2005.","title":"Experimental evaluation of classical automata constructions","authors":"Vardi ; ] Deian Tabakov, Moshe Y Tabakov, Vardi","year":"2005","venue":"LPAR","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Thiébaux et al., 2005] Sylvie Thiébaux, Jörg Hoffmann, and Bernhard Nebel. In defense of PDDL axioms. Artif. Intell., 168(1-2):38-69, 2005.","title":"In defense of PDDL axioms","authors":"Sylvie Thiébaux, Jörg Hoffmann, Bernhard Nebel","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Vardi, 2011] Moshe Y. Vardi. The rise and fall of linear time logic. In GandALF, 2011.","title":"The rise and fall of linear time logic","authors":"Moshe Y Vardi","year":"2011","venue":"GandALF","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}