Theory and algorithms for plan merging

DOI10.1016/0004-3702(92)90016-QzbMath0757.68088OpenAlexW2068849896WikidataQ59679164 ScholiaQ59679164MaRDI QIDQ1199918

Qiang Yang, Ming Li, David E. Foulser

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90016-q

zbMATH Keywords

dynamic programmingapproximation algorithmplan merging

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

Average-case analysis via incompressibility ⋮ A beam search for the shortest common supersequence problem guided by an approximate expected length calculation ⋮ Integrating planning and learning: the PRODIGY architecture ⋮ Improved heuristics and a genetic algorithm for finding short supersequences ⋮ Hybridizations of Metaheuristics With Branch & Bound Derivates ⋮ The multiple sequence sets: Problem and heuristic algorithms ⋮ The multi-spreader crane scheduling problem: partitions and supersequences ⋮ On the approximation of shortest common supersequences and longest common subsequences ⋮ Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach ⋮ On the approximation of longest common nonsupersequences and shortest common nonsubsequences ⋮ Minimum cost multi-product flow lines ⋮ Backdoors to planning ⋮ Approximate planning

Cites Work

• Planning for conjunctive goals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory and algorithms for plan merging