@inproceedings{cam-etal-ltl-knowpros16,
  title = {Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite {LTL} (Amended Version)},
  author = {Alberto Camacho and Eleni Triantafillou and Christian Muise and Jorge Baier and Sheila A. McIlraith},
  booktitle = {Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI},
  year = {2016},
  url = {cam-etal-ltl-knowpros16.pdf},
  note = {A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning ({HSDIP}'16) at ICAPS},
abstract={Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.},
  keywords = {LTL, planning}
}

{"_id":"9aqqNjWRAkcE3dcqH","bibbaseid":"camacho-triantafillou-muise-baier-mcilraith-nondeterministicplanningwithtemporallyextendedgoalscompletingthestoryforfiniteandinfiniteltlamendedversion-2016","downloads":8,"creationDate":"2016-07-19T18:10:02.808Z","title":"Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite LTL (Amended Version)","author_short":["Camacho, A.","Triantafillou, E.","Muise, C.","Baier, J.","McIlraith, S. A."],"year":2016,"bibtype":"inproceedings","biburl":"https://www.cs.toronto.edu/~sheila/publications/list.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite LTL (Amended Version)","author":[{"firstnames":["Alberto"],"propositions":[],"lastnames":["Camacho"],"suffixes":[]},{"firstnames":["Eleni"],"propositions":[],"lastnames":["Triantafillou"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Muise"],"suffixes":[]},{"firstnames":["Jorge"],"propositions":[],"lastnames":["Baier"],"suffixes":[]},{"firstnames":["Sheila","A."],"propositions":[],"lastnames":["McIlraith"],"suffixes":[]}],"booktitle":"Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI","year":"2016","url":"cam-etal-ltl-knowpros16.pdf","note":"A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning (HSDIP'16) at ICAPS","abstract":"Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.","keywords":"LTL, planning","bibtex":"@inproceedings{cam-etal-ltl-knowpros16,\n title = {Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite {LTL} (Amended Version)},\n author = {Alberto Camacho and Eleni Triantafillou and Christian Muise and Jorge Baier and Sheila A. McIlraith},\n booktitle = {Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI},\n year = {2016},\n url = {cam-etal-ltl-knowpros16.pdf},\n note = {A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning ({HSDIP}'16) at ICAPS},\nabstract={Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.},\n keywords = {LTL, planning}\n}\n\n","author_short":["Camacho, A.","Triantafillou, E.","Muise, C.","Baier, J.","McIlraith, S. A."],"key":"cam-etal-ltl-knowpros16","id":"cam-etal-ltl-knowpros16","bibbaseid":"camacho-triantafillou-muise-baier-mcilraith-nondeterministicplanningwithtemporallyextendedgoalscompletingthestoryforfiniteandinfiniteltlamendedversion-2016","role":"author","urls":{"Paper":"https://www.cs.toronto.edu/~sheila/publications/cam-etal-ltl-knowpros16.pdf"},"keyword":["LTL","planning"],"metadata":{"authorlinks":{"camacho, a":"http://www.albertocamacho.com/","mcilraith, s":"https://www.cs.toronto.edu/~sheila/publications/index.html","muise, c":"https://www.haz.ca/academic-publications.html"}},"downloads":8},"search_terms":["non","deterministic","planning","temporally","extended","goals","completing","story","finite","infinite","ltl","amended","version","camacho","triantafillou","muise","baier","mcilraith"],"keywords":["ltl","planning"],"authorIDs":["CBLksFoEERH5GZA5T","GvvCbq8Y4n9QqTySC","f4LpZ8LcDrvDyGuip"],"dataSources":["FAyKHaeKDYM4aGJk2","euD7cPywCk5gX9zDY","hqqbBi3M3BaCY6ivH","optQ3PYGE2PxhriFJ","2LLKDfkxMDdABm58M","sg6yZ29Z2xB5xP79R","T3oedZczBnZ2Y6GvJ","uKBTF27RvvtN9Ryxw","Jwuh2BtHasSBPk4uf"]}