Pages that link to "Item:Q835819"

The following pages link to Concise finite-domain representations for PDDL planning tasks (Q835819):

Displaying 13 items.

• Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
• Efficient symbolic search for cost-optimal planning (Q343909) (← links)
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
• Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
• Star-topology decoupled state space search (Q1749386) (← links)
• Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I (Q2188783) (← links)
• Book review of: P. Haslum et. al., An introduction to the planning domain definition language (Q2302292) (← links)
• Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
• On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
• Writing Declarative Specifications for Clauses (Q2835876) (← links)
• Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
• A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning (Q5870537) (← links)
• OMTPlan: A Tool for Optimal Planning Modulo Theories (Q6113550) (← links)