Time and Space Bounds for Planning

DOI10.1613/jair.5535zbMath1423.68433OpenAlexW2769610873MaRDI QIDQ4596722

Christer Bäckström, Peter Jonsson

Publication date: 8 December 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5535

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Decidability and complexity of action-based temporal planning over dense time ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Algorithms and conditional lower bounds for planning problems ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning