TY - GEN
T1 - Multi-Agent Pickup and Delivery in Transformable Production
AU - Aryadi, Hanif A.
AU - Bezerra, Ranulfo
AU - Ohno, Kazunori
AU - Gunji, Kenta
AU - Kojima, Shotaro
AU - Kuwahara, Masao
AU - Okada, Yoshito
AU - Konyo, Masashi
AU - Tadokoro, Satoshi
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - This paper focuses on multi-agent pickup and delivery (MAPD) in the context of the transformable production system. With the increasing demand for personalized products in today's globalized world, manufacturers are providing customers with the option to purchase items with specific details. Transformable production is a solution to manufacture customized products, which involves both static agents responsible for manufacturing and mobile agents responsible for pickup and delivery tasks. Numerous works in the literature have studied the MAPD problem. However, these works consider pickup-and-delivery tasks to be independent of each other. In the transformable production system, a delivery task can only start if the corresponding manufacturing process is finished. Therefore, it is necessary to consider the task dependencies when addressing MAPD in transformable production. To tackle this challenge, we propose a framework to solve this problem. We employ a heuristic algorithm to assign tasks to static and mobile agents and introduce a parameter that adjusts the expected pickup and delivery duration. Additionally, we introduce heuristic cost functions for path finding tailored to our problem. Through comparative analysis using synthetic test sets, we highlight the significance of the parameter used in pickup-and-delivery task scheduling in obtaining improved results. Furthermore, we demonstrate that our proposed algorithm and cost functions achieve slightly better performance than the baseline algorithm.
AB - This paper focuses on multi-agent pickup and delivery (MAPD) in the context of the transformable production system. With the increasing demand for personalized products in today's globalized world, manufacturers are providing customers with the option to purchase items with specific details. Transformable production is a solution to manufacture customized products, which involves both static agents responsible for manufacturing and mobile agents responsible for pickup and delivery tasks. Numerous works in the literature have studied the MAPD problem. However, these works consider pickup-and-delivery tasks to be independent of each other. In the transformable production system, a delivery task can only start if the corresponding manufacturing process is finished. Therefore, it is necessary to consider the task dependencies when addressing MAPD in transformable production. To tackle this challenge, we propose a framework to solve this problem. We employ a heuristic algorithm to assign tasks to static and mobile agents and introduce a parameter that adjusts the expected pickup and delivery duration. Additionally, we introduce heuristic cost functions for path finding tailored to our problem. Through comparative analysis using synthetic test sets, we highlight the significance of the parameter used in pickup-and-delivery task scheduling in obtaining improved results. Furthermore, we demonstrate that our proposed algorithm and cost functions achieve slightly better performance than the baseline algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85174385642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85174385642&partnerID=8YFLogxK
U2 - 10.1109/CASE56687.2023.10260587
DO - 10.1109/CASE56687.2023.10260587
M3 - Conference contribution
AN - SCOPUS:85174385642
T3 - IEEE International Conference on Automation Science and Engineering
BT - 2023 IEEE 19th International Conference on Automation Science and Engineering, CASE 2023
PB - IEEE Computer Society
T2 - 19th IEEE International Conference on Automation Science and Engineering, CASE 2023
Y2 - 26 August 2023 through 30 August 2023
ER -