Pages that link to "Item:Q1402751"
From MaRDI portal
The following pages link to Fast planning through planning graph analysis (Q1402751):
Displayed 37 items.
- Graphplan (Q19763) (← links)
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Complexity results for standard benchmark domains in planning (Q814425) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Multiobjective heuristic state-space planning (Q814441) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Remote Agent: to boldly go where no AI system has gone before (Q1274747) (← links)
- The logical foundations of goal-regression planning in autonomous agents (Q1277699) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- Plan coordination by revision in collective agent based systems. (Q1852864) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- Automatic workflow verification and generation (Q2368986) (← links)
- An approach to efficient planning with numerical fluents and multi-criteria plan quality (Q2389640) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Model checking abilities of agents: a closer look (Q2481560) (← links)
- Modelling and solving English peg solitaire (Q2489133) (← links)
- A formal characterisation of Hamblin's action-state semantics (Q2642475) (← links)
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
- COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS (Q3379523) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- Planning under uncertainty as G<scp>OLOG</scp>programs (Q4467045) (← links)
- Parallel planning via the distribution of operators (Q4784350) (← links)
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks (Q5302730) (← links)
- Evaluating new options in the context of existing plans (Q5941210) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Least commitment in Graphplan (Q5958108) (← links)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search (Q5958540) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)