STAN

swMATH3348MaRDI QIDQ15880FDOQ15880

Author name not available (Why is that?)

Cited In (36)

• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• AI*IA 2003: Advances in Artificial Intelligence
• State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
• Planning as heuristic search
• Planning in domains with derived predicates through rule-action graphs and local search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Weighted \(A^*\) search - unifying view and application
• Title not available (Why is that?)
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Learning from planner performance
• Extracting mutual exclusion invariants from lifted temporal planning domains
• Title not available (Why is that?)
• Functional strips: A more flexible language for planning and problem solving
• A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Least commitment in Graphplan
• Title not available (Why is that?)
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning
• Plan-Coordination Mechanisms and the Price of Autonomy
• Planning and control in artificial intelligence: A unifying perspective
• Multiobjective heuristic state-space planning
• Title not available (Why is that?)
• Modelling and solving English peg solitaire

This page was built for software: STAN