Best-First Width Search in the IPC 2018: Complete, Simulated, and Polynomial Variants (planner abstract)

Francès, Guillem and Geffner, Héctor and Lipovetzky, Nir and Ramírez, Miquel. (2018) Best-First Width Search in the IPC 2018: Complete, Simulated, and Polynomial Variants (planner abstract). Ninth International Planning Competition (IPC 2018), Deterministic Part.

Full text not available from this repository.

Official URL: https://edoc.unibas.ch/68740/

Downloads: Statistics Overview


Width-based search algorithms have recently emerged as a simple yet effective approach to planning. Best-First Width Search (BFWS) is one of the most successful satisficing width-based algorithms, as it strikes a good balance between an effective exploration based on a measure of state novelty and the exploitation provided by traditional goal-directed heuristics. Several conceptually interesting BFWS variants have recently been shown to offer state-of-the-art performance, including a polynomial-time BFWS planner which is incomplete but fast and effective, and a black-box BFWS planner that can plan efficiently with simulators, i.e. when the transition function of the problem is represented as a blackbox function. In this paper, we describe six BFWS planners involving these variations that we have entered into the 2018 International Planning Competition.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Francès Medina, Guillem
Item Type:Other
Number of Pages:5
Note:Publication type according to Uni Basel Research Database: Other publications
Related URLs:
Last Modified:28 Oct 2020 13:58
Deposited On:28 Oct 2020 13:58

Repository Staff Only: item control page