Conference Proceedings

A polynomial planning algorithm that beats lama and FF

N Lipovetzky, H Geffner

Proceedings International Conference on Automated Planning and Scheduling, ICAPS | Association for the Advancement of Artificial Intelligence | Published : 2017


Copyright © 2017, Association for the Advancement of Artificial Intelligence ( All rights reserved. It has been shown recently that heuristic and width-based search can be combined to produce planning algorithms with a performance that goes beyond the state-of-the-art. Such algorithms are based on best-first width search (BFWS), a plain best-first search set with evaluations functions combined lexicographically to break ties, some of which express noveltybased preferences. In BFWS(f5), for example, the evaluation function/5 weights nodes by a novelty measure, breaking ties by the number of non-achieved goals. BFWS(f5) is a best-first algorithm, and hence, it is complete but not..

View full abstract


Awarded by Australian Research Council

Funding Acknowledgements

The work by N. Lipovetzky is partially supported by the Australian Research Council linkage grant LP11010015. H. Geffner is partially supported by grant TIN2015-67959-P, MEC, Spain.