Halsey, K. (2002) An initial investigation into searching to satisfy soft temporal constraints. In: Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), 2002-11-01, Delft, The Netherlands.
Full text not available in this repository. (Request a copy from the Strathclyde author)Abstract
When using Simple Temporal Networks, it may be that not all constraints must be met, rather that they should be met if possible with some degree of preference. To express this, a utility value is added to represent the importance of some temporal constraints. Various search procedures are looked at to try to maximise the total utility whilst still maintaining consistency. It is found that a greedy approach with hill-climbing works well where these soft constraints interact closely and that a greedy start to the hill-climbing is better than a random start.
| Item type: | Conference or Workshop Item (Paper) |
|---|---|
| ID code: | 1920 |
| Keywords: | simple temporal networks, temporal constraints, searching, Electronic computers. Computer science |
| Subjects: | Science > Mathematics > Electronic computers. Computer science |
| Department: | Faculty of Science > Computer and Information Sciences |
| Related URLs: | |
| Depositing user: | Strathprints Administrator |
| Date Deposited: | 26 Oct 2006 |
| Last modified: | 04 Oct 2012 17:00 |
| URI: | http://strathprints.strath.ac.uk/id/eprint/1920 |
Actions (login required)
| View Item |