{"type":"ScholarlyArticle","title":"A lookahead strategy for solving large planning problems","authors":[{"name":"Vincent Vidal","slug":"vincent-vidal","given":"Vincent","family":"Vidal","affiliation":""}],"abstract":"Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information from the relaxed plan and for dealing with helpful actions, by considering the high quality of the relaxed plans. In numerous domains, the performance of heuristic search planning and the size of the problems that can be handled have been drastically improved.","doi":null,"url":"https://ijcai.org/proceedings/2003/260","pdf":"https://ijcai.org/proceedings/2003/0260.pdf","markdown":"https://ijcai.org/proceedings/2003/260.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/260","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":260,"pages":{"first":1524,"last":1524},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}