Mediated Conflict Recovery by Constraint Relaxation

J. Christopher Beck & Mark S. Fox

Proceedings of AAAI-94 Workshop on Models of Conflict Management in Cooperative Problem Solving, Seattle, WA, August 6, 1994.

ABSTRACT:

Dynamic events in a multiagent environment can be a source of conflict. We model the network of inter-agent commitments as a constraint graph. Conflicts arise when an event prevents fulfillment of a commitment, resulting in an infeasible constraint graph. Constraint relaxation directed by a mediating agent is used to reconfigure the commitment graph. We investigate this general approach in the domain of supply chain management and present a schema for constraint relaxation algorithms. Experimental results on Partial Constraint Satisfaction Problems (PCSPs) and schedule optimization are given along with a sketch of the conflict recovery protocol in development.

Keywords: plan execution, conflict detection and recovery, mediation, constraint relaxation

Zipped PostScript Format GZipped PostScript Format

HELP

EIL HOME PAGE

QUIT