scientific article; zbMATH DE number 2038901
From MaRDI portal
Publication:4449304
zbMath1058.68103MaRDI QIDQ4449304
Alessandro Saetti, Ivan Serina, Alfonso E. Gerevini
Publication date: 8 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Decidability and complexity of action-based temporal planning over dense time ⋮ 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 ⋮ A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Sequential Monte Carlo in reachability heuristics for probabilistic planning ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ On the importance of domain model configuration for automated planning engines ⋮ Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ Kernel functions for case-based planning ⋮ Agent planning programs ⋮ Planning in domains with derived predicates through rule-action graphs and local search ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem ⋮ Processes and continuous change in a SAT-based planner ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Star-topology decoupled state space search ⋮ Discovering hidden structure in factored MDPs ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ Truncated incremental search
Uses Software
This page was built for publication:
