The following pages link to Planning for conjunctive goals (Q1101262):
Displaying 50 items.
- The scope and limits of simulation in automated reasoning (Q253998) (← links)
- The influence of \(k\)-dependence on the complexity of planning (Q420826) (← links)
- On information invariants in robotics (Q504012) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- How does a box work? A study in the qualitative dynamics of solid objects (Q543601) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (Q814422) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- A new deductive approach to planning (Q922685) (← links)
- The roles of associational and causal reasoning in problem solving. (Q989160) (← links)
- Reasoning about actions with imprecise and incomplete state descriptions (Q1037952) (← links)
- Planning for conjunctive goals (Q1101262) (← links)
- A geometric approach to error detection recovery for robot motion planning with uncertainty (Q1116358) (← links)
- Localized planning with action-based constraints (Q1128485) (← links)
- Planning parallel actions (Q1128648) (← links)
- Interpreting a dynamic and uncertain world: task-based control (Q1128764) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Embedding decision-analytic control in a learning architecture (Q1182163) (← links)
- Theory and algorithms for plan merging (Q1199918) (← links)
- A theory of conflict resolution in planning (Q1204872) (← links)
- Reasoning about partially ordered events (Q1263999) (← links)
- Multiple perspective dynamic decision making (Q1274561) (← 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)
- Artificial intelligence and human decision making (Q1278800) (← links)
- Network languages for complex systems (Q1309716) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- Translations of network languages (Q1324385) (← links)
- A unified framework for explanation-based generalization of partially ordered and partially instantiated plans (Q1329370) (← links)
- Partial-order planning: Evaluating possible efficiency gains (Q1329372) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- Multi-contributor causal structures for planning: A formalization and evaluation (Q1337681) (← links)
- On point-based temporal disjointness (Q1342229) (← links)
- Network languages for intelligent control (Q1361234) (← links)
- Network languages for concurrent multiagent systems (Q1368473) (← links)
- Complexity results for HTN planning (Q1380419) (← links)
- Engineering and compiling planning domain models to promote validity and efficiency (Q1389595) (← links)
- Calculating criticalities (Q1391896) (← 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)
- On the evaluation of agent behaviors (Q1853676) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- Approximate planning (Q1855231) (← links)
- Modality and interrupts (Q1891265) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Actions over core-closed knowledge bases (Q2104517) (← links)
