Sciweavers

IAT
2006
IEEE

A Q-decomposition LRTDP Approach to Resource Allocation

14 years 6 months ago
A Q-decomposition LRTDP Approach to Resource Allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of two approaches is made: The Q-decomposition model, which coordinates reward separated agents through an arbitrator, and the Labeled Real-Time Dynamic Programming (LRTDP) approaches are adapted in an effective way. The Q-decomposition permits to reduce the set of states to consider, while LRTDP concentrates the planning on significant states only. As demonstrated by the experiments, combining these two distinct approaches permits to further reduce the planning time to obtain the optimal solution of a resource allocation problem.
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where IAT
Authors Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak Benaskeur
Comments (0)