An initial investigation into searching to satisfy soft temporal constraints

K. Halsey

Research output: Contribution to conferencePaper

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.
Original languageEnglish
Pages58-63
Number of pages6
Publication statusPublished - Nov 2002
EventProceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG) - Delft, The Netherlands
Duration: 1 Nov 2002 → …

Conference

ConferenceProceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG)
CityDelft, The Netherlands
Period1/11/02 → …

Keywords

  • simple temporal networks
  • temporal constraints
  • searching

Cite this