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

@inproceedings{Tsamardinos2000MergingPW,
  title={Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches},
  author={Ioannis Tsamardinos and Martha E. Pollack and John F. Horty},
  booktitle={AIPS},
  year={2000}
}
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, we are concerned with plans that have (i) quantitative temporal constraints, (ii) actions that are not instantaneous, but rather have temporal extent, and (iii) conditional branches. Given a set S of such plans, our algorithm nds a set of constraints that jointly ensure that the plans in S are mutually consistent, if such a set of constraints exists. The algorithm has three phases. In… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…