scientific article; zbMATH DE number 1448981
From MaRDI portal
Publication:4954178
Recommendations
Cited in
(25)- Theory and algorithms for plan merging
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
- Failure driven dynamic search control for partial order planners: an explanation based approach
- Fast planning through planning graph analysis
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- Using genetic programming to learn and improve control knowledge.
- scientific article; zbMATH DE number 1630025 (Why is no real title available?)
- Domain-independent planning for services in uncertain and dynamic environments
- Domain-independent temporal planning in a planning-graph-based approach
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 1083038 (Why is no real title available?)
- scientific article; zbMATH DE number 2086991 (Why is no real title available?)
- scientific article; zbMATH DE number 1852127 (Why is no real title available?)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- An algorithm on interfering actions deferment for handling conditional effects in the intelligent planning
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- scientific article; zbMATH DE number 2243389 (Why is no real title available?)
- Least commitment in Graphplan
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
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 Q4954178)
