{"type":"ScholarlyArticle","title":"Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals","authors":[{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":"Univ. Roma \"La Sapienza\" , Italy"},{"name":"Sasha Rubin","slug":"sasha-rubin","given":"Sasha","family":"Rubin","affiliation":"Univ. Napoli \"Federico II\" , Italy"}],"abstract":"We study planning for LTLf and LDLf temporally extended goals in nondeterministic fully observable domains (FOND). We consider both strong and strong cyclic plans, and develop foundational automata-based techniques to deal with both cases.  Using these techniques we provide the computational characterization of both problems, separating the complexity in the size of the domain specification from that in the size of the formula. Specifically we establish them to be EXPTIME-complete and 2EXPTIME-complete, respectively, for both problems. In doing so, we also show 2EXPTIME-hardness for strong cyclic plans, which was open.","doi":"10.24963/ijcai.2018/657","url":"https://ijcai.org/proceedings/2018/657","pdf":"https://ijcai.org/proceedings/2018/0657.pdf","markdown":"https://ijcai.org/proceedings/2018/657.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/657","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":657,"pages":{"first":4729,"last":4735},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Knowledge Representation and Reasoning: Action, Change and Causality"],"videos":[],"references":[{"position":1,"raw":"[Alur et al., 2002] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. J. of the ACM, 49(5):672-713, 2002.","title":"Alternating-time temporal logic","authors":"Rajeev Alur, Thomas A Henzinger, Orna Kupferman","year":"2002","venue":"J. of the ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Armoni et al., 2002] Armoni et al. The ForSpec temporal logic: A new temporal property-specification language. In TACAS, 2002.","title":"The ForSpec temporal logic: A new temporal property-specification language","authors":"Armoni","year":"2002","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bacchus and Kabanza, 2000] Fahiem Bacchus and Frodu- ald Kabanza. Using temporal logics to express search con- trol knowledge for planning. Artif. Intell., 116(1-2):123- 191, 2000.","title":"Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning","authors":"Kabanza Bacchus","year":"2000","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baier and McIlraith, 2006] Jorge A. Baier and Sheila A. McIlraith. Planning with first-order temporally extended goals using heuristic search. In Proc. of AAAI, 2006.","title":"Planning with first-order temporally extended goals using heuristic search","authors":"Jorge A Baier, Sheila A Mcilraith","year":"2006","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baier et al., 2008] Jorge A. Baier, Christian Fritz, Meghyn Bienvenu, and Sheila A. McIlraith. Beyond classical plan- ning: Procedural control knowledge and preferences in state-of-the-art planners. In AAAI, 2008.","title":"Beyond classical planning: Procedural control knowledge and preferences in state-of-the-art planners","authors":"Jorge A Baier, Christian Fritz, Meghyn Bienvenu, Sheila A Mcilraith","year":"2008","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brafman et al., 2018] Ronen I. Brafman, Giuseppe De Gia- como, and Fabio Patrizi. LTL f /LDL f non-markovian re- wards. AAAI, 2018.","title":"LTL f /LDL f non-markovian rewards","authors":"Ronen I Brafman, Giuseppe De, Giacomo, Fabio Patrizi","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Camacho et al., 2017a] Alberto Camacho, Oscar Chen, Scott Sanner, and Sheila A. McIlraith. Non-markovian re- wards expressed in LTL: guiding search via reward shap- ing. In SOC, pages 159-160, 2017.","title":"Non-markovian rewards expressed in LTL: guiding search via reward shaping","authors":"Camacho","year":"2017","venue":"SOC","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Camacho et al., 2017b] Alberto Camacho, Eleni Triantafil- lou, Christian Muise, Jorge A. Baier, and Sheila McIl- raith. Non-deterministic planning with temporally ex- tended goals: LTL over finite and infinite traces. In AAAI, 2017.","title":"Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces","authors":"Camacho","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chandra et al., 1981] A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of the ACM, 28(1), 1981.","title":"Alternation","authors":"A K Chandra, D C Kozen, L J Stockmeyer","year":"1981","venue":"J. of the ACM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cimatti et al., 2003] Alessandro Cimatti, Marco Pistore, Marco Roveri, and Paolo Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Arti- ficial Intelligence, 1-2(147), 2003.","title":"Weak, strong, and strong cyclic planning via symbolic model checking","authors":"Alessandro Cimatti, Marco Pistore, Marco Roveri, Paolo Traverso","year":"2003","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Daniele et al., 1999] Marco Daniele, Paolo Traverso, and Moshe Y. Vardi. Strong cyclic planning revisited. In ECP, pages 35-48, 1999.","title":"Strong cyclic planning revisited","authors":"Marco Daniele, Paolo Traverso, Moshe Y Vardi","year":"1999","venue":"ECP","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[de Alfaro et al., 2007] Luca de Alfaro, Thomas A. Hen- zinger, and Orna Kupferman. Concurrent reachability games. Theor. Comput. Sci., 386(3):188-217, 2007.","title":"Concurrent reachability games","authors":"Thomas A Luca De Alfaro, Orna Henzinger, Kupferman","year":"2007","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":13,"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":14,"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":15,"raw":"[Eisner and Fisman, 2006] Cindy Eisner and Dana Fisman. A practical introduction to PSL. Springer, 2006.","title":"A practical introduction to PSL","authors":"Fisman Eisner, Cindy Eisner, Dana Fisman","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fogarty et al., 2013] Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, and Thomas Wilke. Profile trees for Büchi word automata, with application to determinization. In GandALF, 2013.","title":"Profile trees for Büchi word automata, with application to determinization","authors":"Seth Fogarty, Orna Kupferman, Moshe Y Vardi, Thomas Wilke","year":"2013","venue":"GandALF","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fritz and McIlraith, 2007] Christian Fritz and Sheila A. McIlraith. Monitoring plan optimality during execution. In ICAPS, 2007.","title":"Monitoring plan optimality during execution","authors":"Mcilraith Fritz, Christian Fritz, Sheila A Mcilraith","year":"2007","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":18,"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":19,"raw":"[Gerevini et al., 2009] Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, and Yannis Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL 3 and experimental evaluation of the planners. Artificial Intelligence, 173(5-6):619-668, 2009.","title":"Deterministic planning in the fifth international planning competition: PDDL 3 and experimental evaluation of the planners","authors":"Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos","year":"2009","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Ghallab et al., 2004] Malik Ghallab, Dana S. Nau, and Paolo Traverso. Automated planning -Theory and Prac- tice. Elsevier, 2004.","title":"Automated planning -Theory and Practice","authors":"Malik Ghallab, Dana S Nau, Paolo Traverso","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hanks and McDermott, 1986] Steve Hanks and Drew V. McDermott. Default reasoning, nonmonotonic logics, and the frame problem. In AAAI, 1986.","title":"Default reasoning, nonmonotonic logics, and the frame problem","authors":"Steve Hanks, Drew V Mcdermott","year":"1986","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kemeny and Snell, 1976] John G. Kemeny and James Lau- rie Snell. Finite markov chains, undergraduate texts in mathematics. Springer, 1976.","title":"Finite markov chains","authors":"John G Kemeny, James Laurie Snell","year":"1976","venue":"undergraduate texts in mathematics","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kupferman and Vardi, 2005] Orna Kupferman and Moshe Y. Vardi. From linear time to branching time. ACM Trans. Comput. Log., 6(2):273-294, 2005.","title":"From linear time to branching time","authors":"Vardi ; ] Orna Kupferman, Moshe Y Kupferman, Vardi","year":"2005","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pistore and Traverso, 2001] Marco Pistore and Paolo Traverso. Planning as model checking for extended goals in non-deterministic domains. In IJCAI, 2001.","title":"Planning as model checking for extended goals in non-deterministic domains","authors":"Traverso Pistore, Marco Pistore, Paolo Traverso","year":"2001","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2001/67"},{"position":25,"raw":"[Pnueli and Rosner, 1989] Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In POPL, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, Amir Pnueli, Roni Rosner","year":"1989","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Puterman, 2005] Martin L. Puterman. Markov Decision Processes: 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":27,"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":28,"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":29,"raw":"[Sardiña and D'Ippolito, 2015] Sebastian Sardiña and Nicolás D'Ippolito. Towards fully observable non- deterministic planning as assumption-based automatic synthesis. In IJCAI, 2015.","title":"Sebastian Sardiña and Nicolás D'Ippolito. Towards fully observable nondeterministic planning as assumption-based automatic synthesis","authors":"D' Sardiña, Ippolito","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Schewe, 2006] Sven Schewe. Synthesis for probabilistic en- vironments. In ATVA, 2006.","title":"Synthesis for probabilistic environments","authors":"Sven Schewe","year":"2006","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Schoppers, 1987] Marcel J. Schoppers. Universal plans for reactive robots in unpredictable environments. In IJCAI, 1987.","title":"Universal plans for reactive robots in unpredictable environments","authors":"Marcel J Schoppers","year":"1987","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1987/214"},{"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":"[van der Aalst et al., 2009] W. van der Aalst, M. Pesic, and H. Schonenberg. Declarative Workflows: Balancing Be- tween Flexibility and Support. Computer Science -R&D, 23(2):99-113, 2009.","title":"Declarative Workflows: Balancing Between Flexibility and Support","authors":"W Van Der Aalst, M Pesic, H Schonenberg","year":"2009","venue":"Computer Science -R&D","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."}