Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the the agents. Besides the quality of coordination (i.e. efficiency of decomposition and resource allocation) we need to handle also computational efficiency restriction such as fast response time and limited communication traffic among the agents as well as optimization of the amount of private knowledge disclosure, during collaboration patterns negotiation among the semi-collaborative agents. We present a novel contracting mechanism based on the use of the approximated acquaintance model, a structure where the agents store the information about the states, capabilities and resources of possible collaborators. We suggest an approach of iterative construction of the partially-linear acquaintance models that is beneficial mainly in complex agent communities. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Pe̊chouček, M., Lerch, O., & Bíba, J. (2006). Iterative query-based approach to efficient task decomposition and resource allocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4149 LNAI, pp. 258–272). Springer Verlag. https://doi.org/10.1007/11839354_19
Mendeley helps you to discover research relevant for your work.