Maintaining global hull consistency with local search for continuous CSPs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational efforts required. In alternative to local consistency, we propose maintaining global hull-consistency and present experimental results that show that this may be an appropriate alternative to other higher order consistencies. We tested various global hull enforcing algorithms and the best results were obtained with the integration of a local search procedure within interval constraint propagation.

Original languageEnglish
Title of host publicationGlobal Optimization and Constraint Satisfaction
Subtitle of host publicationFirst International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2002. Revised Selected Papers
EditorsChristian Bliek, Christophe Jermann, Arnold Neumaier
Place of PublicationBerlin
PublisherSpringer
Pages178-193
Number of pages16
ISBN (Electronic)978-3-540-39901-8
ISBN (Print)978-3-540-20463-3
DOIs
Publication statusPublished - 2003
Event1st International Workshop on Global Constraint Optimization and Constraint Satisfaction -
Duration: 1 Jan 2002 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Volume2861
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Workshop on Global Constraint Optimization and Constraint Satisfaction
Period1/01/02 → …

Keywords

  • Search Space
  • Local Search
  • Constraint Satisfaction Problem
  • Variable Domain
  • Local Search Procedure

Fingerprint

Dive into the research topics of 'Maintaining global hull consistency with local search for continuous CSPs'. Together they form a unique fingerprint.

Cite this