Computing infinite plans for LTL goals using a classical planner

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Pompeu Fabra > Articles, congressos, llibres > View document

To access the full text documents, please follow this link: http://hdl.handle.net/10230/19944

dc.contributor	Universitat Pompeu Fabra
dc.contributor.author	Patrizini, Fabio
dc.contributor.author	Lipovetzky, Nir
dc.contributor.author	Giacomo, Giuseppe de
dc.contributor.author	Geffner, Héctor
dc.date	2011
dc.identifier.citation	Patrizi F, Lipovetzky N, Giacomo G, Geffner H. Computing infinite plans for LTL goals using a classical planner. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence; july 16-22, 2011; Barcelona. Menlo Park, California: AAAI Press ; 2011. p. 2003-2008.
dc.identifier.citation	http://dx.doi.org/10.5591/978-1-57735-516-8/IJCAI11-334
dc.identifier.uri	http://hdl.handle.net/10230/19944
dc.format	6 p.
dc.format	application/pdf
dc.language.iso	eng
dc.publisher	Association for the Advancement of Artificial Intelligence (AAAI)
dc.relation	Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence; july 16-22, 2011; Barcelona. Menlo Park, California: AAAI Press ; 2011. p. 2003-2008.
dc.relation	info:eu-repo/grantAgreement/EC/FP7/257593
dc.rights	© [2011], Association for the Advancement of Artificial Intelligence (www.aaai.org)
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Intel·ligència artificial
dc.subject	Planificació -- Informàtica
dc.title	Computing infinite plans for LTL goals using a classical planner
dc.type	info:eu-repo/semantics/conferenceObject
dc.type	info:eu-repo/semantics/acceptedVersion
dc.description.abstract	Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally extended goals, expressed in temporal logics such as LTL, to impose restrictions on the state sequences generated by finite plans. In this work, we take the next step and consider the computation of infinite plans for achieving arbitrary LTL goals. We show that infinite plans can also be obtained efficiently by calling a classical planner once over a classical planning encoding that represents and extends the composition of the planning/ndomain and the B¨uchi automaton representing/nthe goal. This compilation scheme has been implemented and a number of experiments are reported.
dc.description.abstract	This work was partially supported by grants TIN2009-10232, MICINN, Spain, EC-7PM-SpaceBook, and EU Programme FP7/2007-2013, 257593 (ACSI).

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author