Using Multi-Agent Systems for Learning optimal Policies for complex Problems


The automatic computation of an optimal solution for a complex problem is a challenging task if no additional knowledge is available. For bounded sized problems there are universally applicable algorithms (e.g. genetic algorithms, branch and bound, reinforcement learning). The disadvantage of these algorithms is their high computational complexity so that real world problems can only be solved efficiently, if the search space is reduced dramatically. In this paper we present an approach that enables the automatic computation of the parameter dependencies of a complex problem without any additional information. The basic idea is to apply reinforcement learning and to incrementally acquire knowledge about the implicit parameters dependencies. Based on the obtained data an optimal strategy is learned. For speeding up the learning process a multi-agent architecture is applied, that supports the simultaneous analysis of alternative strategies. We prove the advantages of our approach by successfully learning a control strategy for a model helicopter.

 author = {Andreas Lommatzsch and Sahin Albayrak},
 title = {Using multi-agent systems for learning optimal policies for complex problems},
 booktitle = {ACM-SE 45: Proceedings of the 45th annual southeast regional conference},
 year = {2007},
 isbn = {978-1-59593-629-5},
 pages = {244--249},
 location = {Winston-Salem, North Carolina},
 doi = {},
 publisher = {ACM Press},
 address = {New York, NY, USA},
Conference Paper
ACM Southeast 2007 Conference, Winston-Salem, North Carolina, USA, 2007.