Author:
Pini Giovanni,Brutschy Arne,Francesca Gianpiero,Dorigo Marco,Birattari Mauro
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Agrawal, R.: Sample mean based index policies with O(log n) regret for the multi-armed bandit problem. Advances in Applied Probability 27, 1054–1078 (1995)
2. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235–256 (2002)
3. Berry, D.A., Fristedt, B.: Bandit problems: Sequential allocation of experiments. Chapman & Hall, London (1985)
4. Brutschy, A., Pini, G., Baiboun, N., Decugnière, A., Birattari, M.: The IRIDIA TAM: A device for task abstraction for the e-puck robot. Tech. Rep. TR/IRIDIA/2010-015, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2010)
5. Dorigo, M., Şahin, E.: Guest editorial. Special Issue: Swarm robotics. Autonomous Robots 17(2-3), 111–113 (2004)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Collaborative Learning in General Graphs With Limited Memorization: Complexity, Learnability, and Reliability;IEEE/ACM Transactions on Networking;2023-12
2. A Distributed Privacy-Preserving Learning Dynamics in General Social Networks;IEEE Transactions on Knowledge and Data Engineering;2023-09-01
3. Multi-armed Bandit Approach for Task Scheduling of a Fixed-Base Robot in the Warehouse;Artificial Intelligence for Robotics and Autonomous Systems Applications;2023
4. Multi-robot Object Finding Using Thompson Sampling;2022 International Symposium on Control Engineering and Robotics (ISCER);2022-02
5. Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory;Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems;2019-06-20