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