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.

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

Halsey, K. (2002). An initial investigation into searching to satisfy soft temporal constraints. 58-63. Paper presented at Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), Delft, The Netherlands, .
Halsey, K. / An initial investigation into searching to satisfy soft temporal constraints. Paper presented at Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), Delft, The Netherlands, .6 p.
@conference{afdd45a168684bf58fe52fa79635d307,
title = "An initial investigation into searching to satisfy soft temporal constraints",
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.",
keywords = "simple temporal networks, temporal constraints, searching",
author = "K. Halsey",
year = "2002",
month = "11",
language = "English",
pages = "58--63",
note = "Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG) ; Conference date: 01-11-2002",

}

Halsey, K 2002, 'An initial investigation into searching to satisfy soft temporal constraints' Paper presented at Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), Delft, The Netherlands, 1/11/02, pp. 58-63.

An initial investigation into searching to satisfy soft temporal constraints. / Halsey, K.

2002. 58-63 Paper presented at Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), Delft, The Netherlands, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - An initial investigation into searching to satisfy soft temporal constraints

AU - Halsey, K.

PY - 2002/11

Y1 - 2002/11

N2 - 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.

AB - 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.

KW - simple temporal networks

KW - temporal constraints

KW - searching

UR - http://www.cis.strath.ac.uk/research/publications/papers/strath_cis_publication_45.pdf

M3 - Paper

SP - 58

EP - 63

ER -

Halsey K. An initial investigation into searching to satisfy soft temporal constraints. 2002. Paper presented at Proceedings of the 21st UK Planning and Scheduling Special Interest Group (PlanSIG), Delft, The Netherlands, .