Fast planning through planning graph analysis
From MaRDI portal
Publication:1402751
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
- Partial-order planning: Evaluating possible efficiency gains
- Planning for conjunctive goals
- STRIPS: A new approach to the application of theorem proving to problem solving
- The computational complexity of propositional STRIPS planning
Cited in
(only showing first 100 items - show all)- Modelling and solving English peg solitaire
- scientific article; zbMATH DE number 1974089 (Why is no real title available?)
- scientific article; zbMATH DE number 1467489 (Why is no real title available?)
- Plan coordination by revision in collective agent based systems.
- scientific article; zbMATH DE number 2038901 (Why is no real title available?)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- The logical foundations of goal-regression planning in autonomous agents
- Parallel planning via the distribution of operators
- Conformant planning via heuristic forward search: A new approach
- scientific article; zbMATH DE number 1753146 (Why is no real title available?)
- Speeding up planning through minimal generalizations of partially ordered plans
- scientific article; zbMATH DE number 2243389 (Why is no real title available?)
- Width and serialization of classical planning problems
- Landmark-based approaches for goal recognition as planning
- Automatically selecting and using primary effects in planning: Theory and experiments.
- Sound and efficient closed-world reasoning for planning
- scientific article; zbMATH DE number 2079763 (Why is no real title available?)
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Towards efficient universal planning: A randomized approach
- Characterization, verification and generation of strategies in games with resource constraints
- Long-distance mutual exclusion for planning
- The factored policy-gradient planner
- An algorithm on interfering actions deferment for handling conditional effects in the intelligent planning
- scientific article; zbMATH DE number 2243415 (Why is no real title available?)
- Conformant planning as a case study of incremental QBF solving
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- scientific article; zbMATH DE number 1852127 (Why is no real title available?)
- scientific article; zbMATH DE number 67471 (Why is no real title available?)
- Experimental evaluation of pheromone models in ACOPlan
- Planning in domains with derived predicates through rule-action graphs and local search
- Planning as heuristic search
- A formal characterisation of Hamblin's action-state semantics
- On the hierarchical community structure of practical Boolean formulas
- A competitive and cooperative approach to propositional satisfiability
- scientific article; zbMATH DE number 49438 (Why is no real title available?)
- scientific article; zbMATH DE number 1852130 (Why is no real title available?)
- Structural plan similarity based on refinements in the space of partial plans
- Discovering hidden structure in factored MDPs
- scientific article; zbMATH DE number 2085257 (Why is no real title available?)
- Evaluating new options in the context of existing plans
- Strong planning under partial observability
- Planning for conjunctive goals
- Managing temporal cycles in planning problems requiring concurrency
- Graph planning with expected finite horizon
- Planning as satisfiability: parallel plans and algorithms for plan search
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- scientific article; zbMATH DE number 67810 (Why is no real title available?)
- Planning with independent task networks
- Star-topology decoupled state space search
- Width-based search for multi agent privacy-preserving planning
- Domain-independent temporal planning in a planning-graph-based approach
- Theory and algorithms for plan merging
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- Planning under uncertainty as G<scp>OLOG</scp>programs
- Model checking abilities of agents: a closer look
- A probabilistic analysis of propositional STRIPS planning
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Tunneling and decomposition-based state reduction for optimal planning
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Automated planning as an early verification tool for distributed control
- Processes and continuous change in a SAT-based planner
- Resource separation in dynamic logic of propositional assignments
- Algorithms and limits for compact plan representations
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Approximate planning
- Extracting mutual exclusion invariants from lifted temporal planning domains
- Planning with regression analysis in transaction logic
- On the complexity of planning for agent teams and its implications for single agent planning
- Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions
- scientific article; zbMATH DE number 2196172 (Why is no real title available?)
- Efficiently deciding equivalence for standard primitives and phases
- Brothers in arms? on AI planning and cellular automata
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- The fast downward planning system
- scientific article; zbMATH DE number 1630025 (Why is no real title available?)
- Situational calculus, linear connection proofs and STRIPS-like planning: an experimental comparison
- Experiences with planning for natural language generation
- scientific article; zbMATH DE number 1929233 (Why is no real title available?)
- scientific article; zbMATH DE number 2085254 (Why is no real title available?)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Graphplan
- Automatic workflow verification and generation
- Probabilistic Reasoning by SAT Solvers
- Using temporal logics to express search control knowledge for planning
- Set-structured and cost-sharing heuristics for classical planning
- scientific article; zbMATH DE number 7453111 (Why is no real title available?)
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A SAT approach to query optimization in mediator systems
- Agent planning programs
- Task decomposition on abstract states, for planning under nondeterminism
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
- On the completeness of pruning techniques for planning with conditional effects
- Reasoning about actions with imprecise and incomplete state descriptions
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- scientific article; zbMATH DE number 2086991 (Why is no real title available?)
- COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS
- Remote Agent: to boldly go where no AI system has gone before
- Goal recognition through goal graph analysis
- Planning and acting in partially observable stochastic domains
This page was built for publication: Fast planning through planning graph analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402751)
