Skip to main content

Deliberation Levels in Theoretic-Decision Approaches for Task Allocation in Resource-Bounded Agents

  • Conference paper
  • First Online:
Balancing Reactivity and Social Deliberation in Multi-Agent Systems (BRSDMAS 2000)

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

Abstract

In this paper we develop a new model of task allocation in distributed and cooperative resource-bounded agents using a theoretic-decision approach and their effect on the responsiveness of the system. Two architectures for task allocation and their level of deliberation are discussed. In both architectures the following holds: (1) Agents have limited resources and estimated distributions over resource execution tasks and (2) Agents create new tasks that they send to a central controller to distribute among them. The main difference between the two architectures resides in the place where the allocation decision-making process is performed. In the first architecture, we assume that the central controller builds an optimal and global decision on task allocation using a dynamic programming model and an estimated distribution over resources. In the second architecture, we assume that each agent builds a locally optimal decision and the central controller coordinates these distributed locally optimal decisions. In both architectures, we formulate the standard problem of task allocation as a Markov Decision Process (MDP). The states of the MDP represent the current state of the allocation in terms of tasks allocated to each agent and available resources. It is well-known that such approaches have a high-level of deliberation that can affect their effciency in dynamic situations. We then discuss the effect of the two architectures on the balance between the deliberative and reactive behavior of the system.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Andersson and T. Sandholm. Time-quality tradeoffs in reallocative negotiation with combinatorial contract types. In AAAI, pages 3–10, 1999.

    Google Scholar 

  2. G. Boutilier, Moisés, and B. Sabata. Sequential auctions for the allocation of resources with complementaries. In IJCAI, 1999.

    Google Scholar 

  3. Davis and Smith. Negotiation as a metaphor for distributed problem solving. Artificial Intelligence, 20:63–109, 1983.

    Article  Google Scholar 

  4. T. Estlin, A. Tobias, G. Rabideau, R. Castana, S. Chien, and E. Mjolsness. An integrated system for multi-rover scientific exploration. In AAAI, pages 613–613, 1999.

    Google Scholar 

  5. R. Kalakota and A. Whinston. Frontiers of Electronic Commerce. Addison-Wesley, 1996.

    Google Scholar 

  6. A.-I. Mouaddib. Progressive negotiation for time-constrained autonomous agents. In First International Conference on Autonomous Agents, pages 8–16, 1997.

    Google Scholar 

  7. A.-I. Mouaddib. Multistage negotiation for distributed scheduling of resource-bounded agents. In AAAI Spring Symposium on Satisficing Models, pages 54–59, 1998.

    Google Scholar 

  8. A.-I. Mouaddib. Anytime coordination for progressive planning agents. In AAAI-99, pages 564–569, 1999.

    Google Scholar 

  9. A.-I. Mouaddib and S. Zilberstein. Optimal scheduling for dynamic progressive processing. In ECAI-98, pages 499–503, 1998.

    Google Scholar 

  10. T. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In AAAI, pages 256–262, 1993.

    Google Scholar 

  11. S. Sen. An automated distributed meeting scheduler. IEEE Transactions Expert, accepted, 1996.

    Google Scholar 

  12. O. Sheory and S. Kraus. Methods for task allocations via agent coalition formation. Artificial Intelligence, 101:165–200, 1998.

    Article  MathSciNet  Google Scholar 

  13. W. Walsh and M. P. Wellman. Effeciency and equilibrium in task allocation economies with hierarchical dependencies. In IJCAI-99, pages 520–526, 1999.

    Google Scholar 

  14. S. Zilberstein and A.-I. Mouaddib. Reactive control for dynamic progressive processing. In IJCAI-99, pages 1268–1273, 1999.

    Google Scholar 

  15. S. Zilberstein and A.-I. Mouaddib. Optimizing resource utilization in planetary rovers. In 2nd NASA Workshop on Planning and Scheduling for Space, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouzid, M., Hanna, H., Mouaddib, AI. (2001). Deliberation Levels in Theoretic-Decision Approaches for Task Allocation in Resource-Bounded Agents. In: Balancing Reactivity and Social Deliberation in Multi-Agent Systems. BRSDMAS 2000. Lecture Notes in Computer Science(), vol 2103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44568-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44568-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42327-0

  • Online ISBN: 978-3-540-44568-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics