Advertisement

Optimize Cooperative Agents with Organization in Distributed Scheduling System

  • Wei Fan
  • Fan Xue
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4114)

Abstract

DSAFO (Dynamic Scheduling Agents with Federation Organization) is a novel multi-agent constraint satisfaction algorithm for AGSS problem (a NP-hard scheduling problem). This paper improves on DSAFO by employing a resource requisition strategy, and models this parallel multi-agent algorithm in polyadic π-calculus. The time complexity of the improved DSAFO is \(\mathrm{O}(n^3)+\mathrm{O}(n^2)\times t_{\mathrm{trans}}\). Experiments show improved DSAFO performs well in AGSS consumptions optimization of resources and man-days. Though it is unstable, improved DSAFO makes good probability to find better solutions than classical heuristics and its distributed and parallel agents viewpoint is potential to deal with distributed dynamic troubles in real applications.

Keywords

Multiagent System Member Agent Classical Heuristic Gate Assignment Federation Organization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wei Fan
    • 1
  • Fan Xue
    • 1
  1. 1.Software Technology Research Center, Civil Aviation University of China, Tianjin 300300China

Personalised recommendations