Abstract
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may create other tasks. Then, positive and negative interactions among the resources are considered, in achieving the tasks, in order to obtain and maintain an efficient coordination. A standard Multiagent Markov Decision Process (MMDP) approach is too prohibitive to solve this type of problem in real-time. To address this complex resource management problem, the merging of an approach which considers the complexity associated to a high number of different resource types (i.e. Multiagent Task Associated Markov Decision Processes (MTAMDP)), with an approach which considers the complexity associated to the creation of task by other tasks (i.e. Acyclic Decomposition) is proposed. The combination of these two approaches produces a near-optimal solution in much less time than a standard MMDP approach.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aberdeen, D., Thiebaux, S., Zhang, L.: Decision-theoretic military operations planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, Whistler, Canada, June 3–7 (2004)
Bertsekas, D.: Rollout algorithms for constrained dynamic programming. Technical report 2646, Lab. for Information and Decision Systems, MIT, Mass., USA (2005)
Boutilier, C.: Sequential optimality and coordination in multiagent systems. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-1999), Stockholm, August 1999, pp. 478–485 (1999)
Decker, K.S., Lesser, V.R.: Generalizing the partial global planning algorithm. International Journal of Intelligent Cooperative Information Systems 1(2), 319–346 (1992)
Nilsson, N.J.: Principles or Artificial Intelligence. Tioga Publishing, Palo Alto, Ca (1980)
Plamondon, P., Chaib-draa, B., Benaskeur, A.: Decomposition techniques for a loosely-coupled resource allocation problem. In: Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2005) (September 2005)
Plamondon, P., Chaib-draa, B., Benaskeur, A.: A multiagent task associated mdp (mtamdp) approach to resource allocation. In: AAAI 2006 Spring Symposium on Distributed Plan and Schedule Management (March 2006)
Russell, S.J., Zimdars, A.: Q-decomposition for reinforcement learning agents. In: ICML, pp. 656–663 (2003)
Tarjan, R.E.: Depth first search and linear graph algorithm. SIAM Journal on Computing 1(2), 146–172 (1972)
Wu, C.C., Castanon, D.A.: Decomposition techniques for temporal resource allocation. Technical report: Afrl-va-wp-tp-2004-311, Air Force Research Laboratory, Air force base, OH (2004)
Wu, J., Durfee, E.H.: Automated resource-driven mission phasing techniques for constrained agents. In: Proceedings of the Fourth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), August 2005, pp. 331–338 (2005)
Zhang, W.: Modeling and solving a resource allocation problem with soft constraint techniques. Technical report: Wucs-2002-13, Washington University, Saint-Louis, Missouri (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plamondon, P., Chaib-draa, B., Benaskeur, A.R. (2006). An Efficient Resource Allocation Approach in Real-Time Stochastic Environment. In: Lamontagne, L., Marchand, M. (eds) Advances in Artificial Intelligence. Canadian AI 2006. Lecture Notes in Computer Science(), vol 4013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766247_5
Download citation
DOI: https://doi.org/10.1007/11766247_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34628-9
Online ISBN: 978-3-540-34630-2
eBook Packages: Computer ScienceComputer Science (R0)