A Q-decomposition LRTDP Approach to Resource Allocation

Authors:
Pierrick Plamondon;Brahim Chaib-draa;Abder Rezak Benaskeur
Affiliations:
Laval University, Canada;Laval University, Canada;Deference R&D Canada, Canada
Venue:
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Year:
2006

Citing 2
Cited 0

LAO: a heuristic search algorithm that finds solutions with loops

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Focused real-time dynamic programming for MDPs: squeezing more out of a heuristic

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.