Automatic construction of optimal static sequential portfolios for AI planning and beyond

DOI10.1016/J.ARTINT.2015.05.005MaRDI QIDQ898741zbMATHOpenAlexFDO

Authors Sergio Núñez, Daniel Borrajo, Carlos Linares López

Publication date 18 December 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2015.05.005

zbMATH Keywords

SATportfoliosautomated planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Automatic construction of parallel portfolios via algorithm configuration
• A synthesis of automated planning and reinforcement learning for efficient, robust decision-making
• Automated streamliner portfolios for constraint satisfaction problems
• Automatic generation of efficient policy alternatives via simulation-optimization
• Learning dynamic algorithm portfolios
• scientific article; zbMATH DE number 4093191

Cites work

• scientific article; zbMATH DE number 1946847 (Why is no real title available?)
• scientific article; zbMATH DE number 6261538 (Why is no real title available?)
• Algorithm portfolios
• Algorithm runtime prediction: methods \& evaluation
• Paramils: an automatic algorithm configuration framework
• Planning as heuristic search
• SATzilla: portfolio-based algorithm selection for SAT
• The FF planning system: Fast plan generation through heuristic search
• The LAMA planner: guiding cost-based anytime planning with landmarks
• The complexity of theorem-proving procedures
• The fast downward planning system
• Theory and Applications of Satisfiability Testing

Cited in

(9)

• Algorithm portfolios for noisy optimization
• Portfolio approaches for constraint optimization problems
• Real-time solving of computationally hard problems using optimal algorithm portfolios
• Why CP portfolio solvers are (under)utilized? Issues and challenges
• Portfolio theorem proving and prover runtime prediction for geometry
• An empirical evaluation of portfolios approaches for solving CSPs
• Symbolic perimeter abstraction heuristics for cost-optimal planning
• SUNNY-CP and the MiniZinc challenge
• SATzilla: portfolio-based algorithm selection for SAT

Describes a project that uses

Uses Software

• MiniSat
• Paramils
• SATzilla
• SATenstein
• aspeed

This page was built for publication: Automatic construction of optimal static sequential portfolios for AI planning and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898741)