Planning for conjunctive goals
From MaRDI portal
Publication:1101262
DOI10.1016/0004-3702(87)90092-0zbMath0642.68171OpenAlexW2171798962MaRDI QIDQ1101262
Publication date: 1987
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/15119
Management decision making, including multiple objectives (90B50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (65)
Hierarchical task network and operator-based planning: two complementary approaches to real-world planning ⋮ A unified framework for explanation-based generalization of partially ordered and partially instantiated plans ⋮ Partial-order planning: Evaluating possible efficiency gains ⋮ Event scheduling using allen's algebra ⋮ The computational complexity of propositional STRIPS planning ⋮ Multi-contributor causal structures for planning: A formalization and evaluation ⋮ On point-based temporal disjointness ⋮ Modality and interrupts ⋮ Default reasoning by deductive planning ⋮ Planning for conjunctive goals ⋮ Network languages for intelligent control ⋮ Network languages for concurrent multiagent systems ⋮ A geometric approach to error detection recovery for robot motion planning with uncertainty ⋮ Integrating planning and learning: the PRODIGY architecture ⋮ Complexity results for HTN planning ⋮ Localized planning with action-based constraints ⋮ Planning parallel actions ⋮ Interpreting a dynamic and uncertain world: task-based control ⋮ State-variable planning under structural restrictions: algorithms and complexity ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ A probabilistic analysis of propositional STRIPS planning ⋮ On the nature and role of modal truth criteria in planning ⋮ Calculating criticalities ⋮ A logic of time, chance, and action for representing plans ⋮ Deriving consensus in multiagent systems ⋮ Kernel functions for case-based planning ⋮ Sound and efficient closed-world reasoning for planning ⋮ Permissive planning: Extending classical planning to uncertain task domains. ⋮ Automatically selecting and using primary effects in planning: Theory and experiments. ⋮ Fast planning through planning graph analysis ⋮ The influence of \(k\)-dependence on the complexity of planning ⋮ A new deductive approach to planning ⋮ LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES ⋮ Knowledge and communication: A first-order theory ⋮ Processes and continuous change in a SAT-based planner ⋮ Embedding decision-analytic control in a learning architecture ⋮ On information invariants in robotics ⋮ Acquiring search-control knowledge via static analysis ⋮ Theory and algorithms for plan merging ⋮ A theory of conflict resolution in planning ⋮ Collaborative planning with confidentiality ⋮ How does a box work? A study in the qualitative dynamics of solid objects ⋮ Solve-and-robustify ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ A state space analysis of propose-and-revise ⋮ The roles of associational and causal reasoning in problem solving. ⋮ Towards Real-World HTN Planning Agents ⋮ Reasoning about partially ordered events ⋮ Multiple perspective dynamic decision making ⋮ Remote Agent: to boldly go where no AI system has gone before ⋮ The logical foundations of goal-regression planning in autonomous agents ⋮ Artificial intelligence and human decision making ⋮ Reasoning about actions with imprecise and incomplete state descriptions ⋮ Stochastic dynamic programming with factored representations ⋮ On the evaluation of agent behaviors ⋮ Complexity, decidability and undecidability results for domain-independent planning ⋮ Approximate planning ⋮ Network languages for complex systems ⋮ Actions over core-closed knowledge bases ⋮ On the computational complexity of temporal projection, planning, and plan validation ⋮ The scope and limits of simulation in automated reasoning ⋮ Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results ⋮ On the undecidability of probabilistic planning and related stochastic optimization problems ⋮ Translations of network languages ⋮ Explaining by evidence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal theories of knowledge in AI and robotics
- Planning for conjunctive goals
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- STRIPS: A new approach to the application of theorem proving to problem solving
- Discussion and correspondence: A note on the Towers of Hanoi problem
- A Selection Problem of Shared Fixed Costs and Network Flows
This page was built for publication: Planning for conjunctive goals
