Partial-order planning: Evaluating possible efficiency gains

DOI10.1016/0004-3702(94)90012-4zbMath0807.68080OpenAlexW1515486073MaRDI QIDQ1329372

Anthony Barrett, Daniel S. Weld

Publication date: 1 March 1995

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90012-4

zbMATH Keywords

planning algorithms

Mathematics Subject Classification ID

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

Related Items

A unified framework for explanation-based generalization of partially ordered and partially instantiated plans, Multi-contributor causal structures for planning: A formalization and evaluation, State-set branching: leveraging BDDs for heuristic search, State-variable planning under structural restrictions: algorithms and complexity, Engineering and compiling planning domain models to promote validity and efficiency, Failure driven dynamic search control for partial order planners: an explanation based approach, Automatically selecting and using primary effects in planning: Theory and experiments., Fast planning through planning graph analysis, Using temporal logics to express search control knowledge for planning, Towards efficient universal planning: A randomized approach, Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison, The logical foundations of goal-regression planning in autonomous agents, Applying adversarial planning techniques to Go, An approach to improve argumentation-based epistemic planning with contextual preferences

Uses Software

• UCPOP

Cites Work

• Planning for conjunctive goals
• Embedding decision-analytic control in a learning architecture
• Automatically generating abstractions for planning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Regression planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item