Pages that link to "Item:Q1402751"
From MaRDI portal
The following pages link to Fast planning through planning graph analysis (Q1402751):
Displaying 50 items.
- Graphplan (Q19763) (← links)
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← 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)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- A heuristic search approach to planning with temporally extended preferences (Q835825) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Agent planning programs (Q899440) (← links)
- Reasoning about actions with imprecise and incomplete state descriptions (Q1037952) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- Planning for conjunctive goals (Q1101262) (← links)
- Planning parallel actions (Q1128648) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Theory and algorithms for plan merging (Q1199918) (← links)
- Remote Agent: to boldly go where no AI system has gone before (Q1274747) (← links)
- A feedback transformation of the planning problems (Q1277242) (← links)
- The logical foundations of goal-regression planning in autonomous agents (Q1277699) (← links)
- Using many-sorted logic in the object-oriented data model for fast robot task planning (Q1286807) (← links)
- Using regression-match graphs to control search in planning (Q1292308) (← links)
- Engineering and compiling planning domain models to promote validity and efficiency (Q1389595) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Automatically selecting and using primary effects in planning: Theory and experiments. (Q1399131) (← links)
- Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Discovering hidden structure in factored MDPs (Q1761300) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- Plan coordination by revision in collective agent based systems. (Q1852864) (← links)
- Approximate planning (Q1855231) (← links)
- The mathematics of spatial configuration: revisiting, revising and critiquing justified plan graph theory (Q1934332) (← links)
- A cost-effective planning graph approach for large-scale Web Service Composition (Q1955179) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- Learning action strategies for planning domains (Q1978381) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
