Any time, complete algorithm for finding utilitarian optimal solutions to STPPs

Authors:
Bart Peintner;Martha E. Pollack
Affiliations:
Computer Science and Engineering, University of Michigan, Ann Arbor, MI;Computer Science and Engineering, University of Michigan, Ann Arbor, MI
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Year:
2005

Citing 6
Cited 4

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Remote Agent: to boldly go where no AI system has gone before

Artificial Intelligence - Special issue: artificial intelligence 40 years later
Constraint Processing

Constraint Processing
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
Temporal constraint reasoning with preferences

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Temporal preference optimization as weighted constraint satisfaction

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case

Journal of Artificial Intelligence Research
On the modelling and optimization of preferences in constraint-based temporal reasoning

Artificial Intelligence
Solving disjunctive temporal problems with preferences using maximum satisfiability

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple greedy algorithm and a novel complete algorithm for finding utilitarian optimal solutions to Simple Temporal Problems with Preferences. Unlike previous algorithms, ours does not restrict preference functions to be convex. We present experimental results showing that (1) a single iteration of the greedy algorithm produces high-quality solutions, (2) multiple iterations, bounded by the square of the number of constraints, produce near-optimal solutions, and (3) our complete, memory-boundable algorithm has compelling anylime properties and outperforms a branch-and-bound algorithm.