Time and Space Bounds for Planning
From MaRDI portal
Publication:4596722
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
Cited in
(14)- scientific article; zbMATH DE number 1931653 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4218177 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4162304 (Why is no real title available?)
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)
