Iterative Constraint-based Repair for Multiagent Scheduling
Kazuo Miyashita · 1997
We propose a new integrated architecture for dis-tributed planning and scheduling that exploits constraints for problem decomposition and co-ordination. Our goal is to develop an efficient method to solve densely constrained planning / scheduling problems in a distributed manner without sacrificing solution quality. We im-plemented a prototype system, called CAMPS, in which hierarchy of intelligent agents try to coordinate their actions for "satisficing " plan-ning / scheduling results by handling several intra- and inter-agent constraints. In this pa-per, we show the repair-based methodology for distributed planning / scheduling and the constraint-based mechanism for dynamic coali-tion formation among agents.