Show simple item record

dc.contributor.authorKeyder, Emil
dc.contributor.authorRichter, Silvia
dc.contributor.authorHelmert, Malte
dc.contributor.editorHelder Coelho, Rudi Studer, Michael Wooldridge
dc.date.accessioned2017-05-03T11:48:49Z
dc.date.available2017-05-03T11:48:49Z
dc.date.issued2010
dc.date.modified2013-08-20T00:16:35Z
dc.identifier.refurihttp://ecai2010.appia.pt/
dc.identifier.doi10.3233/978-1-60750-606-5-335
dc.identifier.urihttp://hdl.handle.net/10072/37746
dc.description.abstractLandmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complete, earlier approaches have focused on finding landmarks for the delete relaxation ?+. Furthermore, some of these approaches have approximated this set of landmarks, although it has been shown that the complete set of causal delete-relaxation landmarks can be identified in polynomial time by a simple procedure over the relaxed planning graph. Here, we give a declarative characterisation of this set of landmarks and show that the procedure computes the landmarks described by our characterisation. Building on this, we observe that the procedure can be applied to any delete-relaxation problem and take advantage of a recent compilation of the m-relaxation of a problem into a problem with no delete effects to extract landmarks that take into account delete effects in the original problem. We demonstrate that this approach finds strictly more causal landmarks than previous approaches and discuss the relationship between increased computational effort and experimental performance, using these landmarks in a recently proposed admissible landmark-counting heuristic.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent325294 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherIOS
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofconferencenameECAI 2010 - 19th European Conference on Artificial Intelligence
dc.relation.ispartofconferencetitleECAI 2010 - 19th European Conference on Artificial Intelligence
dc.relation.ispartofdatefrom2010-08-16
dc.relation.ispartofdateto2010-08-20
dc.relation.ispartoflocationLisbon, Portugal
dc.rights.retentionY
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classified
dc.subject.fieldofresearchcode080199
dc.titleSound and Complete Landmarks for And/Or Graphs
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.rights.copyright© 2010 IOS Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the publisher website for access to the definitive, published version.
gro.date.issued2010
gro.hasfulltextFull Text
gro.griffith.authorRichter, Silvia


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record