scientific article; zbMATH DE number 2038901
From MaRDI portal
Publication:4449304
Recommendations
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Domain-independent temporal planning in a planning-graph-based approach
- scientific article; zbMATH DE number 2038893
- Fast planning through planning graph analysis
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cited in
(35)- Star-topology decoupled state space search
- Discovering hidden structure in factored MDPs
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Decidability and complexity of action-based temporal planning over dense time
- A constraint-based approach to learn temporal features on action models from multiple plans
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
- Set-structured and cost-sharing heuristics for classical planning
- Red-black planning: a new systematic approach to partial delete relaxation
- Sequential Monte Carlo in reachability heuristics for probabilistic planning
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Processes and continuous change in a SAT-based planner
- Truncated incremental search
- On the importance of domain model configuration for automated planning engines
- Graph planning with expected finite horizon
- Managing temporal cycles in planning problems requiring concurrency
- Domain-independent temporal planning in a planning-graph-based approach
- Continuing plan quality optimisation
- Temporal planning using subgoal partitioning and resolution in SGPlan
- Planning in domains with derived predicates through rule-action graphs and local search
- On the completeness of pruning techniques for planning with conditional effects
- scientific article; zbMATH DE number 2085254 (Why is no real title available?)
- scientific article; zbMATH DE number 1852127 (Why is no real title available?)
- scientific article; zbMATH DE number 1852130 (Why is no real title available?)
- On the tractability of minimal model computation for some CNF theories
- Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- Kernel functions for case-based planning
- Maintenance of plan libraries for case-based planning: offline and online policies
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- Managing concurrency in temporal planning using planner-scheduler interaction
- Long-distance mutual exclusion for planning
- Learning from planner performance
- Anytime heuristic search for partial satisfaction planning
- Task decomposition on abstract states, for planning under nondeterminism
- Agent planning programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449304)
