A coordinated scheduling approach for task assignment and multi-agent path planning
Path finding is an essential problem in multi-agent systems, widely employed in warehousing and logistics. However, most of the current studies focus on the problem of assigning one agent with one task in a period, which may hinder the efficiency of path planning of the systems when facing multi-tas...
Main Authors: | Chengyuan Fang, Jianlin Mao, Dayan Li, Ning Wang, Niya Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2024-01-01
|
Series: | Journal of King Saud University: Computer and Information Sciences |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157824000193 |
Similar Items
-
Collaborative optimization of task scheduling and multi-agent path planning in automated warehouses
by: Zhang Honglin, et al.
Published: (2023-04-01) -
Hierarchical Task Assignment and Path Finding with Limited Communication for Robot Swarms
by: Dario Albani, et al.
Published: (2021-03-01) -
A decoupling method for solving the multi-agent path finding problem
by: Bin Liao, et al.
Published: (2023-05-01) -
A Time-Efficient Co-Operative Path Planning Model Combined with Task Assignment for Multi-Agent Systems
by: Sumana Biswas, et al.
Published: (2019-04-01) -
Multi-Agent Task Allocation with Multiple Depots Using Graph Attention Pointer Network
by: Wen Shi, et al.
Published: (2023-08-01)