Abstract
One of the problems that must be solved during coalition operations is the planning problem: finding a course of actions for the operation. Knowledge-based planning is a technique that can be used to address this problem. However, traditional planning has focussed on the finding of a plan that achieves a given goal or accomplishes a given task. During a coalition operation such a plan may need to be agreed between the different parties
involved in the coalition. In this paper we shall describe an approach that can be used for finding an agreed plan. This plan will include a set of decommitment
rules allowing participants to specify conditions under which they are allowed to deviate from the agreed course of action. The proposed algorithm can be used as the basis for an automated planner, but it should also be usable in a mixedinitiative setting.
involved in the coalition. In this paper we shall describe an approach that can be used for finding an agreed plan. This plan will include a set of decommitment
rules allowing participants to specify conditions under which they are allowed to deviate from the agreed course of action. The proposed algorithm can be used as the basis for an automated planner, but it should also be usable in a mixedinitiative setting.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Fifth International Conference on Knowledge Systems for Coalition Operations (KSCO-2009) |
| Subtitle of host publication | Chilworth Manor, Southampton, UK, 31 March-1 April 2009 |
| Number of pages | 10 |
| Publication status | Published - Apr 2009 |