Star-topology decoupled state space search
From MaRDI portal
Publication:1749386
DOI10.1016/j.artint.2017.12.004zbMath1444.68172OpenAlexW2777796911MaRDI QIDQ1749386
Publication date: 16 May 2018
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2017.12.004
Related Items
Star-Topology Decoupling in SPIN, Model checking \(\omega \)-regular properties with decoupled search, Backdoors to planning, Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
Uses Software
Cites Work
- Recent advances in unfolding technique
- The influence of \(k\)-dependence on the complexity of planning
- Efficient unfolding of contextual Petri nets
- A stubborn attack on state explosion
- Concise finite-domain representations for PDDL planning tasks
- Using regression-match graphs to control search in planning
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- Downward refinement and the efficiency of hierarchical problem solving
- Fast planning through planning graph analysis
- An improvement of McMillan's unfolding algorithm
- Planning in a hierarchy of abstraction spaces
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Towards efficient universal planning: A randomized approach
- Red-black planning: a new systematic approach to partial delete relaxation
- Unfoldings: A partial-order approach to model checking.
- On the complexity of planning for agent teams and its implications for single agent planning
- Distributed Heuristic Forward Search for Multi-agent Planning
- Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
- The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
- Merge-and-Shrink Abstraction
- Directed Unfolding of Petri Nets
- ParamILS: An Automatic Algorithm Configuration Framework
- Graph-Based Algorithms for Boolean Function Manipulation
- Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems
- Interpolants and Symbolic Model Checking
- Planning as heuristic search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
