Skip to main content

Cooperative Agents Based-Decentralized and Scalable Complex Task Allocation Approach Pro Massive Multi-Agents System

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5991))

Abstract

A major challenge in the field of Multi-Agent Systems is to enable autonomous agents to allocate tasks efficiently. In previous work, we have developed a decentralized and scalable method for complex task allocation for Massive Multi-Agent System (MMAS). The method was based on two steps: 1) hierarchical organization of agent groups using Formal Concepts Analysis approach (FCA) and 2) computing the optimal allocation. The second step distributes the tasks allocation process among all agent groups as follows:

i. Each local allocator proposes a local allocation, then

ii. The global allocator computes the global allocation by resolution of eventual conflict situations.

Nevertheless, a major boundary of the method used to compute the global allocation is its centralized aspect. Moreover, conflicts process is a greedy solution. In fact, if a conflict is detected steps i) and ii) are reiterated until a non conflict situation is attained. This paper extends our last approach by distributing the global allocation process among all agents. It provides a solution based on cooperation among agents. This solution prohibits generation of conflicts. It’s based on the idea that each agent picks out its own sub-task.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tosic, P.T., Agha, G.A.: Maximal Clique Based Distributed Group Formation For Task Allocation in Large-Scale Multi-Agent Systems. In: Ishida, T., Gasser, L., Nakashima, H. (eds.) MMAS 2005. LNCS (LNAI), vol. 3446, pp. 104–120. Springer, Heidelberg (2005)

    Google Scholar 

  2. Rahwan, T., Jennings, N.R.: An Algorithm for Distributing Coalitional Value Calculations among cooperating Agents. Artificial Intelligence Journal 171(8-9), 535–567 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Viswanathan, V., DesJardins, M.: A Model for Large-Scale Team Formation for a Disaster Rescue Problem. In: Proceedings of AAMAS 2005, LSMAS (2005)

    Google Scholar 

  4. Tsvetovat, M., Sycara, K.P., Chen, Y., Ying, J.: Customer coalitions in the electronic marketplace. In: Proceedings of the Fourth International Conference on Autonomous Agents, pp. 263–264 (2000)

    Google Scholar 

  5. Sims, M., Goldman, C.V., Lesser, V.R.: Self-Organization through Bottom-up Coalition Formation. In: AAMAS 2003, Melbourne, Australia, July 14-18 (2003)

    Google Scholar 

  6. Samee, U.K., Ishfaq, A.: Non-cooperative, Semi-cooperative, and Cooperative Games-based Grid Resource Allocation. In: Proceedings of IPDPS 2006, Rhodes Island, Greece (April 2006)

    Google Scholar 

  7. Brahmi, Z., Gammoudi, M.M.: Decentralized method for complex task allocation in massive MAS. In: Proc. of 1st Mediterranean Conference on Intelligent Systems and Automation (CISA 2008), vol. 1019, pp. 287–293 (2008)

    Google Scholar 

  8. Brahmi, Z., Gammoudi, M.M.: Hierarchical organization of agents based on Galois subhierarchy for complex tasks allocation in Massive MAS. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds.) KES AMSTA 2009. LNCS (LNAI), vol. 5559, pp. 460–470. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Manisterski, E., David, E., Kraus, S., Jennungs, N.R.: Forming Efficient Agent Groups for Completing Complex Tasks. In: AAMAS 2006, Hakodate, Hokkaido-Japan (May 2006)

    Google Scholar 

  10. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundation. Springer, Berlin (1999)

    Google Scholar 

  11. Godin, R., Mili, H.: Building and Maintaining Analysis-Level Class Hierarchies using Galois Lattices. In: Proc. of OOPSLA 1993, October 1993, vol. 28, pp. 394–410. ACM Press, New York (1993)

    Chapter  Google Scholar 

  12. Montealegre Vazquez, L.E., Lopez, Y., Lopez, F.: An Agent-Based Model for Hierarchical Organizations. In: Proceedings of AAMAS (May 2006)

    Google Scholar 

  13. Gammoudi, M.M., Nafkha, I.: A formal method for inheritance graph hierarchy construction. Information Sciences 140(3-4), 295–317 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brahmi, Z., Gammoudi, M.M., Ghenima, M. (2010). Cooperative Agents Based-Decentralized and Scalable Complex Task Allocation Approach Pro Massive Multi-Agents System. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12101-2_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12100-5

  • Online ISBN: 978-3-642-12101-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics