FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION

DOI10.1142/S0218488501001277zbMath1113.68484OpenAlexW1977081184MaRDI QIDQ3427990

No author found.

Publication date: 27 March 2007

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218488501001277

zbMATH Keywords

planningoptimal planning

Mathematics Subject Classification ID

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

Related Items (1)

Towards optimal use of multi-precision arithmetic: a remark

Cites Work

• The computational complexity of propositional STRIPS planning
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Complexity, decidability and undecidability results for domain-independent planning

This page was built for publication: FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION