Augmenting disjunctive temporal problems with finite-domain constraints

Authors:
Michael D. Moffitt;Bart Peintner;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;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Year:
2005

Citing 8
Cited 8

Arc and path consistence revisited

Artificial Intelligence
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
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
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing
Constraint Processing

Constraint Processing
Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence
Resource temporal networks: definition and complexity

IJCAI'03 Proceedings of the 18th international joint conference on 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

Deploying a personalized time management agent

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Path smoothing via discrete optimization

Proceedings of the 45th annual Design Automation Conference
Temporal Reasoning in Nested Temporal Networks with Alternatives

Recent Advances in Constraints
Evaluating hybrid constraint tightening for scheduling agents

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Temporal preference optimization as weighted constraint satisfaction

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Hybrid constraint tightening for solving hybrid scheduling problems

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A constraint model for state transitions in disjunctive resources

CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general framework for augmenting instances of the Disjunctive Temporal Problem (DTP) with finite-domain constraints. In this new formalism, the bounds of the temporal constraints become conditional on the finite-domain assignment. This hybridization makes it possible to reason simultaneously about temporal relationships between events as well as their nontemporal properties. We provide a special case of this hybridization that allows reasoning about a limited form of spatial constraints; namely, the travel time induced by the locations of a set of activities. We develop a least-commitment algorithm for efficiently finding solutions to this combined constraint system and provide empirical results demonstrating the effectiveness of our approach.