Optimal multi-agent scheduling with constraint programming

Authors:
Willem-Jan Van Hoeve;Carla P. Gomes;Bart Selman;Michele Lombardi
Affiliations:
Dept. of Computer Science, Cornell University, Ithaca, NY;Dept. of Computer Science, Cornell University, Ithaca, NY;Dept. of Computer Science, Cornell University, Ithaca, NY;DEIS, University of Bologna, Bologna, Italy
Venue:
IAAI'07 Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2
Year:
2007

Citing 3
Cited 3

The Complexity of Decentralized Control of Markov Decision Processes

Mathematics of Operations Research
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Estimating information value in collaborative multi-agent planning systems

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Measuring the expected gain of communicating constraint information

Multiagent and Grid Systems - Planning in multiagent systems
Determining the value of information for collaborative multi-agent planning

Autonomous Agents and Multi-Agent Systems
Production Scheduling in an Agile Agent-Based Production Grid

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the objective is to maximize the total 'quality' of the schedule. More specifically, we focus on multi-agent scheduling problems with time windows, hard and soft precedence relations, and a nonlinear objective function. We show how we can model and efficiently solve these problems with constraint programming technology. Elements of our proposed method include constraint-based reasoning, search strategies, problem decomposition, scheduling algorithms, and a linear programming relaxation. We present experimental results on realistic problem instances to display the different elements of the solution process.