Inner entanglements: Narrowing the search in classical planning by problem reformulation-Reference-Cited by-同舟云学术

Inner entanglements: Narrowing the search in classical planning by problem reformulation

Published:2019-03-22 Issue:2 Volume:35 Page:395-429
ISSN:0824-7935
Container-title:Computational Intelligence
language:en
Short-container-title:Computational Intelligence

Author:

Chrpa Lukáš¹²^ORCID,Vallati Mauro³^ORCID,McCluskey Thomas Leo³

Affiliation:

1. Faculty of Electrical EngineeringCzech Technical University in Prague Prague Czech Republic

2. Faculty of Mathematics and PhysicsCharles University Prague Czech Republic

3. School of Computing and EngineeringUniversity of Huddersfield Huddersfield UK

Funder

Engineering and Physical Sciences Research Council

Grantová Agentura České Republiky

Publisher

Wiley

Subject

Artificial Intelligence,Computational Mathematics

Link

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

Reference62 articles.

1. BernardDE GambleEB RouquetteNF et al.Remote Agent Experiment DS1 Technology Validation Report. Technical Report.Mountain View CA:Ames Research Center and JPL;2000.

2. The computational complexity of propositional STRIPS planning

3. GhallabM HoweA KnoblockC et al.PDDL ‐ The Planning Domain Definition Language. Technical Report.New Haven CT:Yale Center for Computational Vision and Control;1998.

4. KautzHA SelmanB.Planning as satisfiability. In: Proceedings of European Conference on Artificial Intelligence;1992;Vienna Austria.

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

1. Reformulation techniques for automated planning: a systematic review;The Knowledge Engineering Review;2023

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

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