An Efficient Resource Allocation Approach in Real-Time Stochastic Environment

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.

[1]  Weixiong Zhang,et al.  Modeling and Solving a Resource Allocation Problem with Soft Constraint Techniques , 2002 .

[2]  Stuart J. Russell,et al.  Q-Decomposition for Reinforcement Learning Agents , 2003, ICML.

[3]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms (Working Paper) , 1971, SWAT.

[4]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Brahim Chaib-draa,et al.  A Multiagent Task Associated MDP (MTAMDP) Approach to Resource Allocation , 2006, AAAI Spring Symposium: Distributed Plan and Schedule Management.

[6]  Craig Boutilier,et al.  Sequential Optimality and Coordination in Multiagent Systems , 1999, IJCAI.

[7]  Keith Price,et al.  Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1. , 1980, SGAR.

[8]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[9]  D.A. Castanon,et al.  Decomposition techniques for temporal resource allocation , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[10]  D. Bertsekas Rollout Algorithms for Constrained Dynamic Programming , 2005 .

[11]  D. Bertsekas Rollout Algorithms for Constrained Dynamic Programming 1 , 2005 .

[12]  Lin Zhang,et al.  Decision-Theoretic Military Operations Planning , 2004, ICAPS.

[13]  Jianhui Wu,et al.  Automated resource-driven mission phasing techniques for constrained agents , 2005, AAMAS '05.

[14]  Brahim Chaib-draa,et al.  Decomposition techniques for a loosely-coupled resource allocation problem , 2005, IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[15]  Brahim Chaib-draa,et al.  A Q-decomposition LRTDP Approach to Resource Allocation , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[16]  Victor R. Lesser,et al.  Generalizing the Partial Global Planning Algorithm , 1992, Int. J. Cooperative Inf. Syst..