On transformation of conditional, conformant and parallel planning to linear programming
From MaRDI portal
Publication:5010277
DOI10.24425/ACS.2021.137423OpenAlexW4323641046MaRDI QIDQ5010277FDOQ5010277
Authors: Adam Galuszka, Eryka Probierz
Publication date: 25 August 2021
Published in: Archives of Control Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.24425/acs.2021.137423
Recommendations
computational complexitylinear programmingplanninguncertaintyconformant planningconditional planningparallel planning
Cites Work
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computational complexity of propositional STRIPS planning
- Soft-sensing of level of satisfaction in TOC product-mix decision heuristic using robust fuzzy-LP
- Title not available (Why is that?)
- Vendor selection problem by using an interactive fuzzy multi-objective approach with modified S-curve membership functions
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Title not available (Why is that?)
- Title not available (Why is that?)
- ADL and the State-Transition Model of Action
- Constraint satisfaction techniques in planning and scheduling: an introduction
- Scaling up Heuristic Planning with Relational Decision Trees
- Modification strategies for SAT-based plan adaptation
- On transformation of STRIPS planning to linear programming
- Saturated cost partitioning for optimal classical planning
Cited In (2)
Uses Software
This page was built for publication: On transformation of conditional, conformant and parallel planning to linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010277)