This paper provides a formal theory for plan merging and presents both optimal and efficient heuristic algorithms for finding minimum cost merged plans.
A theory for merging plans constructed using STRIPS operators is described. The theory is initially developed for linear plans and then extended to partially ...
We discuss a resource-based planning framework where agents are able to merge plans by exchanging resources. In this framework, plans are specified as ...
David E. Foulser, Ming Li & Qiang Yang, Theory and algorithms for ...
philpapers.org › rec › FOUTAA-2
Theory and algorithms for plan merging. Artificial Intelligence 57 (2-3):143 ... Planning as satisfiability: parallel plans and algorithms for plan search.
Theory and Algorithms for Plan Merging. Bibliographic Details. Author, Foulser, Dave E. Li, Ming · Yang, Qiang · View this author's profile. Issue Date, 1992.
People also ask
What is the 2 way merging algorithm?
What are the major approaches algorithms of planning?
This paper provides a formal theory for plan merging and presents both optimal and efficient heuristic algorithms for finding minimum cost merged plans. The ...
Distributed Artificial Intelligence (DAI) deals with computational systems where several intelligent components interact in a common environment.
This paper provides a quantitative study for plan optimization and presents both optimal and approximate algorithms for finding minimum-cost merged plans ...
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, we are concerned with plans that have.
Theory and algorithms for plan merging. Foulser, D.E.; Li, M.; Yang, Q. Artificial Intelligence 57(2-3): 143-181. 1992. ISSN/ISBN: 0004-3702.