AIJ Journal 1992 Journal Article
Theory and algorithms for plan merging
- David E. Foulser
- Ming Li
- Qiang Yang
Author name cluster
David E. Foulser
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
2 papers
1 author row
Possible papers
2AAAI Conference 1991 Conference Paper
A Quantitative Theory for Plan Merging
- David E. Foulser
Merging operators in a plan can yield significant savings in the cost to execute a plan. Past research in planning has concentrated on handling harmful interactions among plans, but the understanding of positive ones has remained at a qualitative, heuristic level. This paper provides a quantitative study for plan optimization and presents both optimal and approximate algorithms for finding minimum-cost merged plans. With worst and average case complexity analysis and empirical tests, we demonstrate that efficient and wellbehaved approximation algorithms are applicable for optimizing general plans with large sizes.