An empirical study of task bundling for sequential stochastic tasks in multi-robot task allocation
暂无分享,去创建一个
[1] Michal Feldman,et al. Efficient parking allocation as online bipartite matching with posted prices , 2013, AAMAS.
[2] Maurice Pagnucco,et al. Sequential Single-Cluster Auctions for Robot Task Allocation , 2011, Australasian Conference on Artificial Intelligence.
[3] Maja J. Mataric,et al. Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..
[4] Sven Koenig,et al. Improving Sequential Single-Item Auctions , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[5] Bradford Heap,et al. Sequential Single-Cluster Auctions for Multi-Robot Task Allocation , 2014 .
[6] Choi,et al. Optimization by multicanonical annealing and the traveling salesman problem. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[7] T. Bektaş. The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .
[8] Sergei Vassilvitskii,et al. Optimal online assignment with forecasts , 2010, EC '10.
[9] Sven Koenig,et al. Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control , 2007, IJCAI.
[10] Anthony Stentz,et al. A Market Approach to Multirobot Coordination , 2001 .
[11] David M. Stein,et al. An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..
[12] Rada Y. Chirkova,et al. Queuing Systems , 2018, Encyclopedia of Database Systems.
[13] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] Steven Okamoto,et al. Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints , 2014, AAAI.