Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies

  • Authors:

  • Kiam Tian Seow;Kwang Mong Sim

  • Affiliations:

  • School of Computer Engineering, Nanyang Technological University, 50 Nanyang Avenue, Blk N4, #2a-32, Nanyang 639798, Singapore;Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Kowloon, Hong Kong

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed.