Loading...
Please wait, while we are loading the content...
Similar Documents
A Bounded Q-decomposition RDTP Approach to Resource Allocation
| Content Provider | Semantic Scholar |
|---|---|
| Author | Plamondon, Pierrick |
| Copyright Year | 2007 |
| Abstract | This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, two approaches are adapted and merged in an effective way: the Q-decomposition and the bounded Real-time Dynamic Programming (bounded rtdp). The Q-decomposition allows to coordinate reward separated agents and thus permits to reduce the set of state to consider. Bounded rtdp concentrates the planning on significant states only and prunes the action space. The pruning is accomplished by proposing tight upper and lower bounds on the value function. Combining Q-decomposition and bounded rtdp permits to further reduce the planning time to obtain the optimal solution of a resource allocation problem. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.damas.ift.ulaval.ca/_seminar/filesH07/plamondonAAMAS2007QDecBounds.pdf |
| Alternate Webpage(s) | http://www.damas.ift.ulaval.ca/_seminar/filesH07/Q-DecBounds.pdf |
| Alternate Webpage(s) | http://damas.ift.ulaval.ca/_seminar/filesH07/Q-DecBounds.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
