Graphplan

swMATH7746MaRDI QIDQ19763FDOQ19763

Author name not available (Why is that?)

Described by source

• Fast planning through planning graph analysis

Cited In (only showing first 100 items - show all)

• Plan coordination by revision in collective agent based systems.
• Using genetic programming to learn and improve control knowledge.
• The logical foundations of goal-regression planning in autonomous agents
• Landmark-based approaches for goal recognition as planning
• Characterization, verification and generation of strategies in games with resource constraints
• New methods for proving the impossibility to solve problems through reduction of problem spaces
• Conformant planning as a case study of incremental QBF solving
• Long-distance mutual exclusion for planning
• The factored policy-gradient planner
• Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
• Evaluating new options in the context of existing plans
• A competitive and cooperative approach to propositional satisfiability
• Learning generalized policies from planning examples using concept languages
• Planning with Noisy Probabilistic Relational Rules
• Title not available (Why is that?)
• Managing temporal cycles in planning problems requiring concurrency
• Efficient Informative Sensing using Multiple Robots
• Star-topology decoupled state space search
• Title not available (Why is that?)
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Changes of problem representation. Theory and experiments
• Extracting mutual exclusion invariants from lifted temporal planning domains
• On the complexity of planning for agent teams and its implications for single agent planning
• Let's plan it deductively!
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Probabilistic Reasoning by SAT Solvers
• Automatic workflow verification and generation
• Reasoning robots. The art and science of programming robotic agents
• A SAT approach to query optimization in mediator systems
• Agent planning programs
• Reasoning about actions with imprecise and incomplete state descriptions
• Goal recognition through goal graph analysis
• Title not available (Why is that?)
• On linear logic planning and concurrency
• Combining linear programming and satisfiability solving for resource planning
• State-variable planning under structural restrictions: algorithms and complexity
• Planning with Incomplete Information
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• A cost-effective planning graph approach for large-scale Web Service Composition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-agent path finding with mutex propagation
• Title not available (Why is that?)
• Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
• Planning and control in artificial intelligence: A unifying perspective
• Multiobjective heuristic state-space planning
• Using Satisfiability for Non-optimal Temporal Planning
• Gradient-based mixed planning with symbolic and numeric action parameters
• 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?)
• Title not available (Why is that?)
• Conflict-directed \(A^{*}\) and its role in model-based embedded systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• Title not available (Why is that?)
• Conformant planning via heuristic forward search: A new approach
• On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
• Title not available (Why is that?)
• Towards efficient universal planning: A randomized approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Goal distance estimation for automated planning using neural networks and support vector machines
• State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
• Planning as heuristic search
• Reasoning with infinite stable models
• A formal characterisation of Hamblin's action-state semantics
• Experimental evaluation of pheromone models in ACOPlan
• 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?)
• Discovering hidden structure in factored MDPs
• Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
• Probabilistic Relational Planning with First Order Decision Diagrams
• Strong planning under partial observability
• Title not available (Why is that?)
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Planning as satisfiability: parallel plans and algorithms for plan search
• Understanding planning tasks. Domain complexity and heuristic decomposition
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• An LP-Based Heuristic for Optimal Planning
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Practical solution techniques for first-order MDPs
• Model checking abilities of agents: a closer look
• Title not available (Why is that?)
• Logics in Artificial Intelligence
• A tabu search heuristic for resource management in naval warfare
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Learning from planner performance
• Solving Simple Planning Problems with More Inference and No Search
• DSOL: a declarative approach to self-adaptive service orchestrations
• Title not available (Why is that?)

This page was built for software: Graphplan