Recommendations
- scientific article; zbMATH DE number 139935
- Distributed Computing – IWDC 2005
- A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
- Mutual exclusion scheduling
- Adaptive and efficient mutual exclusion
- scientific article; zbMATH DE number 1080096
- scientific article; zbMATH DE number 1290295
- scientific article; zbMATH DE number 1773058
Cites work
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Engineering and compiling planning domain models to promote validity and efficiency
- Fast planning through planning graph analysis
- scientific article; zbMATH DE number 5547917 (Why is no real title available?)
- scientific article; zbMATH DE number 1249653 (Why is no real title available?)
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- scientific article; zbMATH DE number 2038901 (Why is no real title available?)
- Planning as heuristic search
- Planning as satisfiability: parallel plans and algorithms for plan search
- State-variable planning under structural restrictions: algorithms and complexity
- The fast downward planning system
Cited in
(5)- Extracting mutual exclusion invariants from lifted temporal planning domains
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
- Fact-alternating mutex groups for classical planning
- Mutex graphs and multicliques: reducing grounding size for planning
- Answer set planning: a survey
This page was built for publication: Long-distance mutual exclusion for planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835814)
