Applying Local Search to Disjunctive Temporal Problems

Michael D. Moffitt, Martha E. Pollack
2005 International Joint Conference on Artificial Intelligence  
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
more » ... ting that the use of local search leads to substantially improved performance over systematic methods.
dblp:conf/ijcai/MoffittP05 fatcat:svx4vv532razxek5i7paucue6e