Learning Situation-Specific Coordination in Generalized Partial Global Planning

M. V. Nagendra Prasad and Victor Lesser

Achieving effective cooperation in a multi-agent system is a difficult problem for a number of reasons llke local views of problem-solvlng task and uncertainty about the outcomes of interacting non-local tasks. Algorithms llke Generalized Partial Global Planning (GPGP) have responded to these problems by cresting sophiticated coordination mechanisms trigerred in response to the characteristics of particular task environments. In this paper, we present a learning algorithm that endows agents with the capability to choose a suitable subset of the coordination mechanisms based on the present problem solving situation.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.