Applying Local Search to Disjunctive Temporal Problems

Moffitt, Michael D.; Pollack, Martha E.

Applying Local Search to Disjunctive Temporal Problems

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 242-246.

Abstract

We present a method for applying local search to overconstrained instances of the Disjunctive Temporal Problem (DTP). Our objective is to generate high quality solutions (i.e., solutions that violate few constraints) in as little time as possible. The technique presented here differs markedly from previous work on DTPs, as it operates within the total assignment space of the underlying CSP rather than the partial assignment space of the related meta-CSP. We provide experimental results demonstrating that the use of local search leads to substantially improved performance over systematic methods.

Michael D. Moffitt, and Martha E. Pollack. 2005. Applying Local Search to Disjunctive Temporal Problems. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 242–246. https://ijcai.org/proceedings/2005/43

@inproceedings{ijcai2005p43,
  title     = {Applying Local Search to Disjunctive Temporal Problems},
  author    = {Moffitt, Michael D. and Pollack, Martha E.},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {242--246},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/43},
}

TY  - CPAPER
TI  - Applying Local Search to Disjunctive Temporal Problems
AU  - Moffitt, Michael D.
AU  - Pollack, Martha E.
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 242
EP  - 246
UR  - https://ijcai.org/proceedings/2005/43
ER  -