The following pages link to UCPOP (Q32504):
Displaying 40 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Multiobjective heuristic state-space planning (Q814441) (← links)
- Learning from planner performance (Q835821) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Reasoning about actions with imprecise and incomplete state descriptions (Q1037952) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- What robots can do: robot programs and effective achievability (Q1274278) (← links)
- Let's plan it deductively! (Q1274761) (← links)
- The logical foundations of goal-regression planning in autonomous agents (Q1277699) (← links)
- Partial-order planning: Evaluating possible efficiency gains (Q1329372) (← links)
- Failure driven dynamic search control for partial order planners: an explanation based approach (Q1391908) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Permissive planning: Extending classical planning to uncertain task domains. (Q1399128) (← links)
- Automatically selecting and using primary effects in planning: Theory and experiments. (Q1399131) (← links)
- Fast planning through planning graph analysis (Q1402751) (← links)
- Stochastic dynamic programming with factored representations (Q1583230) (← links)
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan (Q1606337) (← links)
- Agenda control for heterogeneous reasoners (Q1764797) (← links)
- Using genetic programming to learn and improve control knowledge. (Q1852856) (← links)
- Approximate planning (Q1855231) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- Flexible and scalable cost-based query planning in mediators: A transformational approach (Q1978788) (← links)
- A constraint-based approach to learn temporal features on action models from multiple plans (Q2152282) (← links)
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I (Q2188783) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- A logic of delegation (Q2269132) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- A probabilistic analysis of propositional STRIPS planning (Q2674188) (← links)
- On the nature and role of modal truth criteria in planning (Q2674199) (← links)
- Forward Chaining Hierarchical Partial-Order Planning (Q3381983) (← links)
- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison (Q4645236) (← links)
- The Relative Power of Semantics and Unification (Q4916085) (← links)
- Formalizing sensing actions -- a transition function based approach (Q5940779) (← links)
- Evaluating new options in the context of existing plans (Q5941210) (← links)
- Reasoning about nonlinear system identification (Q5958395) (← links)
