An initial investigation into searching to satisfy soft temporal constraints

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.

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.

• Share and Export
  

  RefWorksRIS (EndNote Online, Zotero, Ref manager, etc)RDF+XMLEndNoteASCII CitationOpenURL ContextObject in SpanMPEG-21 DIDLRIOXX2 XMLBibTeXAtomEP3 XMLDublin CoreRDF+N-TriplesMODSHTML CitationJSONData Cite XMLRDF+N3Multiline CSVOpenURL ContextObjectReferSimple MetadataMETS
• Item metadata

  Item type:	Conference or Workshop Item(Paper)
  ID code:	1920
  Dates:	Date Event November 2002 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Strathprints Administrator
  Date deposited:	26 Oct 2006
  Last modified:	11 Nov 2024 16:11
  Related URLs:	http://www.cis.strath.ac.uk/research/pub...
  URI:	https://strathprints.strath.ac.uk/id/eprint/1920