Reinforcement-Learning-Based Route Generation for Heavy-Traffic Autonomous Mobile Robot Systems

被引:9
作者
Kozjek, Dominik [1 ]
Malus, Andreja [1 ]
Vrabic, Rok [1 ]
机构
[1] Univ Ljubljana, Fac Mech Engn, SI-1000 Ljubljana, Slovenia
关键词
intralogistics; autonomous mobile robots; multi-robot cooperation; reinforcement learning; route planning;
D O I
10.3390/s21144809
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Autonomous mobile robots (AMRs) are increasingly used in modern intralogistics systems as complexity and performance requirements become more stringent. One way to increase performance is to improve the operation and cooperation of multiple robots in their shared environment. The paper addresses these problems with a method for off-line route planning and on-line route execution. In the proposed approach, pre-computation of routes for frequent pick-up and drop-off locations limits the movements of AMRs to avoid conflict situations between them. The paper proposes a reinforcement learning approach where an agent builds the routes on a given layout while being rewarded according to different criteria based on the desired characteristics of the system. The results show that the proposed approach performs better in terms of throughput and reliability than the commonly used shortest-path-based approach for a large number of AMRs operating in the system. The use of the proposed approach is recommended when the need for high throughput requires the operation of a relatively large number of AMRs in relation to the size of the space in which the robots operate.
引用
收藏
页数:19
相关论文
共 19 条
  • [1] [Anonymous], 1998, RAPIDLY EXPLORING RA
  • [2] Multi-Robot Path Planning Method Using Reinforcement Learning
    Bae, Hyansu
    Kim, Gidong
    Kim, Jonguk
    Qian, Dianwei
    Lee, Sukgyu
    [J]. APPLIED SCIENCES-BASEL, 2019, 9 (15):
  • [3] Digani V, 2014, IEEE INT C INT ROBOT, P1736, DOI 10.1109/IROS.2014.6942789
  • [4] ON MULTIPLE MOVING-OBJECTS
    ERDMANN, M
    LOZANOPEREZ, T
    [J]. ALGORITHMICA, 1987, 2 (04) : 477 - 521
  • [5] Faust A, 2018, IEEE INT CONF ROBOT, P5113
  • [6] Deep Reinforcement Learning for Indoor Mobile Robot Path Planning
    Gao, Junli
    Ye, Weijie
    Guo, Jing
    Li, Zhongjuan
    [J]. SENSORS, 2020, 20 (19) : 1 - 15
  • [7] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS
    HART, PE
    NILSSON, NJ
    RAPHAEL, B
    [J]. IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02): : 100 - +
  • [8] Optimized Directed Roadmap Graph for Multi-Agent Path Finding Using Stochastic Gradient Descent
    Henkel, Christian
    Toussaint, Marc
    [J]. PROCEEDINGS OF THE 35TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'20), 2020, : 776 - 783
  • [9] Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    Kavraki, LE
    Svestka, P
    Latombe, JC
    Overmars, MH
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1996, 12 (04): : 566 - 580
  • [10] Khatib O., 1985, IEEE INT C ROB AUT P, V2, P500, DOI [10.1109/ROBOT.1985.1087247, DOI 10.1109/ROBOT.1985.1087247]