Planning for conjunctive goals

DOI10.1016/0004-3702(87)90092-0zbMath0642.68171MaRDI QIDQ1101262

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

zbMATH Keywords

domain-independent planning; conjunctive goals; conjunctive planners; efficient general purpose planning

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Event scheduling using allen's algebra, Explaining by evidence, Hierarchical task network and operator-based planning: two complementary approaches to real-world planning, Integrating planning and learning: the PRODIGY architecture, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, Acquiring search-control knowledge via static analysis, 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, Embedding decision-analytic control in a learning architecture, Theory and algorithms for plan merging, A theory of conflict resolution in planning, 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, Network languages for complex systems, On the computational complexity of temporal projection, planning, and plan validation, Translations of network languages, A unified framework for explanation-based generalization of partially ordered and partially instantiated plans, Partial-order planning: Evaluating possible efficiency gains, The computational complexity of propositional STRIPS planning, Multi-contributor causal structures for planning: A formalization and evaluation, On point-based temporal disjointness, Network languages for intelligent control, Network languages for concurrent multiagent systems, Complexity results for HTN planning, Engineering and compiling planning domain models to promote validity and efficiency, Calculating criticalities, 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, Stochastic dynamic programming with factored representations, On the evaluation of agent behaviors, Complexity, decidability and undecidability results for domain-independent planning, Approximate planning, Modality and interrupts, Default reasoning by deductive planning, Unnamed Item