Show simple item record

dc.contributor.authorRichter, Silviaen_US
dc.contributor.authorThayer, Jordanen_US
dc.contributor.authorRuml, Wheeleren_US
dc.contributor.editorRonen Brafman, Hector Geffner, Jorg Hoffmann, Henry Kautzen_US
dc.date.accessioned2017-05-03T12:55:38Z
dc.date.available2017-05-03T12:55:38Z
dc.date.issued2010en_US
dc.date.modified2011-07-14T05:52:28Z
dc.identifier.refurihttp://www.icaps10.upf.edu/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/36142
dc.description.abstractAnytime search algorithms solve optimisation problems by quickly finding a (usually suboptimal) first solution and then finding improved solutions when given additional time. To deliver an initial solution quickly, they are typically greedy with respect to the heuristic cost-to-go estimate h. In this paper, we show that this low-h bias can cause poor performance if the greedy search makes early mistakes. Building on this observation, we present a new anytime approach that restarts the search from the initial state every time a new solution is found. We demonstrate the utility of our method via experiments in PDDL planning as well as other domains, and show that it is particularly useful for problems where the heuristic has systematic errors.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent272976 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherThe AAAI Pressen_US
dc.publisher.placeCaliforniaen_US
dc.publisher.urihttp://www.icaps10.upf.edu/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameICAPS 2010: 20th International Conference on Automated Planning and Schedulingen_US
dc.relation.ispartofconferencetitleICAPS 2010 Conference Proceedingsen_US
dc.relation.ispartofdatefrom2010-05-12en_US
dc.relation.ispartofdateto2010-05-16en_US
dc.relation.ispartoflocationCanadaen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classifieden_US
dc.subject.fieldofresearchcode080199en_US
dc.titleThe Joy of Forgetting: Faster Anytime Search via Restartingen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2010 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.en_AU
gro.date.issued2010
gro.hasfulltextFull Text


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