Pages that link to "Item:Q1402751"

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)
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← 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)
• 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)
• 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)
• 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)
• 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)
• A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
• Multi-agent path finding with mutex propagation (Q2082515) (← links)
• Gradient-based mixed planning with symbolic and numeric action parameters (Q2093396) (← links)
• On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
• Characterization, verification and generation of strategies in games with resource constraints (Q2125548) (← links)
• Efficiently deciding equivalence for standard primitives and phases (Q2167745) (← links)
• A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
• Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
• Representing and planning with interacting actions and privacy (Q2287194) (← links)
• Landmark-based approaches for goal recognition as planning (Q2287208) (← links)
• Automated planning as an early verification tool for distributed control (Q2352501) (← 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)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
• Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)