Incrementally Refined Acquaintance Model for Distributed Planning and Resource Allocation in Semi-trusted Environments

This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The presented contraction algorithm is based on incrementally refined acquaintance models (IRAM) of the agents that provide the right set of approximate knowledge needed for appropriate task decomposition.

[1]  Marie desJardins,et al.  Coordinating a Distributed Planning System , 1999, AI Mag..

[2]  Eithan Ephrati,et al.  A heuristic technique for multi‐agent planning , 1997, Annals of Mathematics and Artificial Intelligence.

[3]  E. Ephrati.  A Heuristic Technique for Multiagent PlanningEithan , 1997 .

[4]  Michal Pechoucek,et al.  Role of acquaintance models in agent's private and semi-private knowledge disclosure , 2006, Knowl. Based Syst..

[5]  Michal Pechoucek,et al.  Social Knowledge in Multi-agent Systems , 2001, EASSS.

[6]  Cees Witteveen,et al.  A Resource Logic for Multi-Agent Plan Merging , 2004, Annals of Mathematics and Artificial Intelligence.

[7]  Michal Pechoucek,et al.  Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation , 2006, CIA.

[8]  Edmund H. Durfee,et al.  Distributed Problem Solving and Planning , 2001, EASSS.

[9]  Michal Pechoucek,et al.  Social knowledge in multi-agent systems , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).