Show simple item record

dc.contributor.authorAbdulaziz, Mohammad
dc.contributor.authorGretton, Charles
dc.contributor.authorNorrish, Michael
dc.contributor.editorLaura Barbulescu, Jeremy Frank, Mausam, Stephen F. Smith
dc.date.accessioned2017-11-30T04:43:58Z
dc.date.available2017-11-30T04:43:58Z
dc.date.issued2017
dc.identifier.urihttp://hdl.handle.net/10072/354641
dc.description.abstractWe investigate compositional bounding of transition system diameters, with application in bounding the lengths of plans. We establish usefully-tight bounds by exploiting acyclicity in state-spaces. We provide mechanised proofs in HOL4 of the validity of our approach. Evaluating our bounds in a range of benchmarks, we demonstrate exponentially tighter upper bounds compared to existing methods. Treating both solvable and unsolvable benchmark problems, we also demonstrate the utility of our bounds in boosting planner performance. We enhance an existing planning procedure to use our bounds, and demonstrate significant coverage improvements, both compared to the base planner, and also in comparisons with state-of-the-art systems.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherAssociation for the Advancement of Artificial Intelligence (AAAI)
dc.publisher.placeUnited States
dc.publisher.urihttps://aaai.org/ocs/index.php/ICAPS/ICAPS17/paper/view/15768
dc.relation.ispartofconferencenameICAPS 2017
dc.relation.ispartofconferencetitleProceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017)
dc.relation.ispartofdatefrom2017-06-18
dc.relation.ispartofdateto2017-06-23
dc.relation.ispartoflocationPittsburgh, Pennsylvania, United States
dc.subject.fieldofresearchAnalysis of Algorithms and Complexity
dc.subject.fieldofresearchcode080201
dc.titleA state-space acyclicity property for exponentially tighter plan length bounds
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
dc.description.versionAccepted Manuscript (AM)
gro.rights.copyright© 2017 AAAI Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.
gro.hasfulltextFull Text
gro.griffith.authorGretton, Charles


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