On the predictability of domain‐independent temporal planners-Reference-Cited by-同舟云学术

On the predictability of domain‐independent temporal planners

Published:2019-04-22 Issue:4 Volume:35 Page:745-773
ISSN:0824-7935
Container-title:Computational Intelligence
language:en
Short-container-title:Computational Intelligence

Author:

Cenamor Isabel¹,Vallati Mauro²^ORCID,Chrpa Lukáš³⁴^ORCID

Affiliation:

1. Department of Computer Science and EngineeringUniversidad Carlos III de Madrid Getafe Spain

2. School of Computing and EngineeringUniversity of Huddersfield Huddersfield UK

3. Department of Computer ScienceCzech Technical University in Prague Prague Czech Republic

4. Department of Theoretical Computer Science and Mathematical LogicCharles University in Prague Prague Czech Republic

Funder

Grantová Agentura České Republiky

Ministerstvo Školství, Mládeže a Tělovýchovy

Publisher

Wiley

Subject

Artificial Intelligence,Computational Mathematics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/coin.12211

Reference49 articles.

1. Algorithm Selection for Combinatorial Search Problems: A Survey

2. SATzilla: Portfolio-based Algorithm Selection for SAT

3. A Portfolio Solver for Answer Set Programming: Preliminary Report

4. FawcettC VallatiM HutterF HoffmannJ HoosHH Leyton‐BrownK.Improved features for runtime prediction of domain‐independent planners. In: Proceedings of Twenty‐Fourth International Conference on Automated Planning and Scheduling (ICAPS);2014;Portsmouth NH.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions;Journal of Experimental & Theoretical Artificial Intelligence;2021-10-31

2. Formal Knowledge Engineering for Planning: Pre and Post-Design Analysis;Knowledge Engineering Tools and Techniques for AI Planning;2020