Abstract
Online planning algorithms are typically a tool of choice for dealing with sequential decision problems in combinatorial search spaces. Many such problems, however, also exhibit combinatorial actions, yet standard planning algorithms do not cope well with this type of 'the curse of dimensionality'. Following a recently opened line of related work on combinatorial multi-armed bandit (CMAB) problems, we propose a novel CMAB planning scheme, as well as two specific instances of this scheme, dedicated to exploiting what is called linear side information. Using a representative strategy game as a benchmark, we show that the resulting algorithms very favorably compete with the state-of-the-art.
| Original language | English |
|---|---|
| Title of host publication | ECAI 2014 - 21st European Conference on Artificial Intelligence, Including Prestigious Applications of Intelligent Systems, PAIS 2014, Proceedings |
| Editors | Torsten Schaub, Gerhard Friedrich, Barry O'Sullivan |
| Publisher | IOS Press BV |
| Pages | 825-830 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781614994183 |
| DOIs | |
| State | Published - 2014 |
| Externally published | Yes |
| Event | 21st European Conference on Artificial Intelligence, ECAI 2014 - Prague, Czech Republic Duration: 18 Aug 2014 → 22 Aug 2014 |
Publication series
| Name | Frontiers in Artificial Intelligence and Applications |
|---|---|
| Volume | 263 |
| ISSN (Print) | 0922-6389 |
| ISSN (Electronic) | 1879-8314 |
Conference
| Conference | 21st European Conference on Artificial Intelligence, ECAI 2014 |
|---|---|
| Country/Territory | Czech Republic |
| City | Prague |
| Period | 18/08/14 → 22/08/14 |
Bibliographical note
Publisher Copyright:© 2014 The Authors and IOS Press.