Effective Decoupled Planning for Continuous Multi-Agent Pickup and Delivery

被引:0
|
作者
Nie, Zhenbang [1 ,2 ,3 ,4 ,5 ]
Zeng, Peng [1 ,2 ,3 ,4 ,5 ]
Yu, Haibin [1 ,2 ,3 ,4 ,5 ]
机构
[1] Chinese Acad Sci, Shenyang Inst Automat, State Key Lab Robot, Shenyang 110017, Peoples R China
[2] Chinese Acad Sci, Inst Robot, Shenyang 110179, Peoples R China
[3] Chinese Acad Sci, Inst Intelligent Mfg, Shenyang 110179, Peoples R China
[4] Chinese Acad Sci, Key Lab Networked Control Syst, Shenyang 110017, Peoples R China
[5] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
关键词
Multi-Agent Pickup and Delivery; Multi-Agent Path Finding; Decoupled Path Planning;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Continuous MAPD (Multi-Agent Pickup and Delivery) problem is widely encountered in material transportation systems. TP (Token Passing) is a conflict-free, deadlock-free algorithm for continuous MAPD problems. However, when TP is used, the number of tasks simultaneously handled by agents is limited by the number of task endpoint locations. To solve this problem, ITP (Improved Token Passing) is proposed in this paper. An extra path planning procedure is introduced to improve agent utilization. A complete and optimal A*-based algorithm is designed to solve the low level single agent path planning problem. ITP increases system throughput by exploiting all available agents, and remains conflict-free and deadlock-free. Experiment result shows that ITP outperforms TP in terms of system makespan under heavy workload in congested workspace.
引用
收藏
页码:2667 / 2672
页数:6
相关论文
共 50 条
  • [11] Solving Multi-Agent Pickup and Delivery Problems using Multiobjective Optimization
    Ana Carolina Queiroz
    Alex Vieira
    Heder Bernardino
    Journal of Intelligent & Robotic Systems, 2023, 109
  • [12] Task Selection Algorithm for Multi-Agent Pickup and Delivery with Time Synchronization
    Yamauchi, Tomoki
    Miyashita, Yuki
    Sugawara, Toshiharu
    PRIMA 2022: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS, 2023, 13753 : 458 - 474
  • [13] Solving Multi-Agent Pickup and Delivery Problems using Multiobjective Optimization
    Queiroz, Ana Carolina
    Vieira, Alex
    Bernardino, Heder
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2023, 109 (02)
  • [14] Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
    Ma, Hang
    Li, Jiaoyang
    Kumar, T. K. Satish
    Koenig, Sven
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 837 - 845
  • [15] Decoupled Monte Carlo Tree Search for Cooperative Multi-Agent Planning
    Asik, Okan
    Aydemir, Fatma Basak
    Akin, Huseyin Levent
    APPLIED SCIENCES-BASEL, 2023, 13 (03):
  • [16] Anytime Multi-Task Multi-Agent Pickup and Delivery Under Energy Constraint
    Kudo, Fumiya
    Cai, Kai
    IEEE Robotics and Automation Letters, 2024, 9 (11) : 10145 - 10152
  • [17] MAPDP: Cooperative Multi-Agent Reinforcement Learning to Solve Pickup and Delivery Problems
    Zong, Zefang
    Zheng, Meng
    Li, Yong
    Jin, Depeng
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 9980 - 9988
  • [18] Benchmark for multi-agent pickup and delivery problem in a robotic mobile fulfillment system
    Sun, Yangjun
    Zhao, Ning
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2024,
  • [19] A TSP-Based Online Algorithm for Multi-Task Multi-Agent Pickup and Delivery
    Kudo, Fumiya
    Cai, Kai
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2023, 8 (09): : 5910 - 5917
  • [20] A Multi-agent Framework that Facilitates Decoupled Agent Functioning
    Russell, Dave J.
    Ehlers, Elizabeth M.
    INTELLIGENT INFORMATION PROCESSING IX, 2018, 538 : 109 - 119