Time and Space Bounds for Planning

DOI10.1613/JAIR.5535zbMATH Open1423.68433OpenAlexW2769610873MaRDI QIDQ4596722FDOQ4596722

Authors: 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

Recommendations

• Upper and lower time and space bounds for planning
• Publication:3198897
• scientific article; zbMATH DE number 2085254
• scientific article; zbMATH DE number 4218177
• Planning with Concurrency under Resources and Time Uncertainty
• Algorithms and conditional lower bounds for planning problems
• Complexity issues for timeline-based planning over dense time under future and minimal semantics
• scientific article; zbMATH DE number 140366
• On the computational complexity of temporal projection, planning, and plan validation

Mathematics Subject Classification ID

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

Cited In (14)

• Title not available (Why is that?)
• Width and serialization of classical planning problems
• Analysing approximability and heuristics in planning using the exponential-time hypothesis
• A complete parameterized complexity analysis of bounded planning
• Complexity of qualitative timeline-based planning
• Upper and lower time and space bounds for planning
• A probabilistic analysis of propositional STRIPS planning
• Computational complexity of computing symmetries in finite-domain planning
• Title not available (Why is that?)
• Algorithms and conditional lower bounds for planning problems
• Bounded-Resource Reasoning as (Strong or Classical) Planning
• Decidability and complexity of action-based temporal planning over dense time
• Cost-optimal planning, delete relaxation, approximability, and heuristics
• Title not available (Why is that?)

This page was built for publication: Time and Space Bounds for Planning

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