Applying local search to disjunctive temporal problems

Authors:
Michael D. Moffitt;Martha E. Pollack
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 13
Cited 1

Arc and path consistence revisited

Artificial Intelligence
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
New search spaces for sequencing problems with application to job shop scheduling

Management Science
Backtracking algorithms for disjunctions of temporal constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Tabu Search

Tabu Search
SAT-Based Procedures for Temporal Reasoning

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Low-cost addition of preferences to DTPs and TCSPs

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Tractable Pareto optimization of temporal preferences

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Planning by rewriting: efficiently generating high-quality plans

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A SAT-based decision procedure for the boolean combination of difference constraints

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

NMUS: Structural Analysis for Improving the Derivation of All MUSes in Overconstrained Numeric CSPs

Current Topics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.