Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches

We develop ml algorithm for merging plans that m'c represented in a richly expressive language. Specifically. we arc concerned with plans that have (i) quantitative temporal constraints, (ii} at.lions that are not instantaneous, but rather have tem- poral extent, and (iii) conditional branches. Given a set ~q of such plans, our algorithm ...更多