Auction-based multi-agent task assignment in smart logistic center

被引:0
|
作者
Guo Yu [1 ]
Li Yanjie [1 ]
Zhang Yumei [2 ]
机构
[1] Harbin Inst Technol, Shenzhen Grad Sch, Shenzhen 518055, Peoples R China
[2] Qingdao Agr Univ, Sch Agron & Plant Protect, Qingdao 266109, Peoples R China
关键词
Smart logistic center; Multi-agent task assignment; Auction strategy; Performance difference;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For the task assignment problem in a smart logistic center with many autonomous mobile robots, a task assignment method is proposed based on a market auction idea. Due to the existence of asymmetrical shelf-shift tasks within the center and diverse self-finished cost of each task besides the correlation between tasks, the problem of multi-robot task assignment in a logistic center is different from multi-robot routing problem. By introducing the correlation function and self-finished cost function, the model of task assignment is presented. Then, the bidding strategy is given by analyzing the performance difference. On these bases, an auction approach is developed for the static and dynamic task assignment. Finally, the simulation results show the applicability of the algorithm.
引用
收藏
页码:7487 / 7492
页数:6
相关论文
共 13 条
  • [1] [Anonymous], P 4 INT C MULT SYST
  • [2] [Anonymous], COMBINATORIAL OPTIMI
  • [3] [Anonymous], ARTIFICIAL INTELLIGE
  • [4] [Anonymous], INTEGER COMBINATORIA
  • [5] [Anonymous], DATA STRUCTURES JAVA
  • [6] [Anonymous], ROBOTICS SCI SYSTEMS
  • [7] On local search for weighted k-set packing
    Arkin, EM
    Hassin, R
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (03) : 640 - 648
  • [8] Berhault M, 2003, IROS 2003: PROCEEDINGS OF THE 2003 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, P1957
  • [9] Cao Xi- Ren, 2007, STOCHASTIC LEARNING
  • [10] D'Andrea R, 2008, 2008 IEEE INTERNATIONAL CONFERENCE ON TECHNOLOGIES FOR PRACTICAL ROBOT APPLICATIONS, P80, DOI 10.1109/TEPRA.2008.4686677