{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T23:50:03Z","timestamp":1773445803538,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"23","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research Foundation of Korea (NRF)","award":["2022R1A4A3033961"],"award-info":[{"award-number":["2022R1A4A3033961"]}]},{"name":"National Research Foundation of Korea (NRF)","award":["2020R1F1A1076667"],"award-info":[{"award-number":["2020R1F1A1076667"]}]},{"DOI":"10.13039\/501100003725","name":"Korea government (MSIT)","doi-asserted-by":"publisher","award":["2022R1A4A3033961"],"award-info":[{"award-number":["2022R1A4A3033961"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"Korea government (MSIT)","doi-asserted-by":"publisher","award":["2020R1F1A1076667"],"award-info":[{"award-number":["2020R1F1A1076667"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grant of Kwangwoon University","award":["2022R1A4A3033961"],"award-info":[{"award-number":["2022R1A4A3033961"]}]},{"name":"Research Grant of Kwangwoon University","award":["2020R1F1A1076667"],"award-info":[{"award-number":["2020R1F1A1076667"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Remote Sensing"],"abstract":"<jats:p>For the logistics environment, multi-UAV algorithms have been studied for the purpose of order picking in warehouses. However, modern order picking adopts static order picking methods that struggle to cope with increasing volumes of goods because the algorithms receive orders for a certain period of time and pick only those orders. In this paper, by using the modified interventionist method and dynamic path planning, we aim to assign orders received in real-time to multi-UAVs in the warehouse, and to determine the order picking sequence and path of each UAV. The halting and correcting strategy is proposed to assign orders to UAVs in consideration of the similarity between the UAV\u2019s picking list and the orders. A UAV starts picking orders by using the ant colony optimization algorithm for the orders initially assigned. For additional orders, the UAV modifies the picking sequence and UAV\u2019s path in real time by using the k-opt-based algorithm. We evaluated the proposed method by changing the parameters in a simulation of a general warehouse layout. The results show that the proposed method not only reduces completion time compared to the previous algorithm but also reduces UAV\u2019s travel distance and the collapsed time.<\/jats:p>","DOI":"10.3390\/rs14236106","type":"journal-article","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T03:00:36Z","timestamp":1669950036000},"page":"6106","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic Order Picking Method for Multi-UAV System in Intelligent Warehouse"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-2055","authenticated-orcid":false,"given":"Changwan","family":"Han","sequence":"first","affiliation":[{"name":"Department of Robotics, Kwangwoon University, Seoul 01897, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6091-7951","authenticated-orcid":false,"given":"Hyeongjun","family":"Jeon","sequence":"additional","affiliation":[{"name":"Department of Robotics, Kwangwoon University, Seoul 01897, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0502-7600","authenticated-orcid":false,"given":"Junghyun","family":"Oh","sequence":"additional","affiliation":[{"name":"Department of Robotics, Kwangwoon University, Seoul 01897, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7292-0741","authenticated-orcid":false,"given":"Heungjae","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Kwangwoon University, Seoul 01897, Republic of Korea"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"7741535","DOI":"10.1155\/2022\/7741535","article-title":"Utilizing artificial intelligence and lotus effect in an emerging intelligent drone for persevering solar panel efficiency","volume":"2022","author":"Almalki","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Takechi, H., Aragaki, S., and Irie, M. (2021). Differentiation of river sediments fractions in UAV aerial images by convolution neural network. Remote Sens., 13.","DOI":"10.3390\/rs13163188"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Padmanabhan, M., and Suresh, G.R. (2015, January 26\u201328). Coalition formation and task allocation of multiple autonomous robots. Proceedings of the International Conference on Signal Processing, Communication and Networking (ICSCN), Chennai, India.","DOI":"10.1109\/ICSCN.2015.7219891"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"44173","DOI":"10.1109\/ACCESS.2020.3032450","article-title":"Blockchain-Empowered multi-robot collaboration to fight COVID-19 and future pandemics","volume":"9","author":"Alsamhi","year":"2021","journal-title":"IEEE Access"},{"key":"ref_5","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"Wurman","year":"2008","journal-title":"AI Mag."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"128125","DOI":"10.1109\/ACCESS.2019.2934998","article-title":"Survey on collaborative smart drones and internet of things for improving smartness of smart cities","volume":"7","author":"Alsamhi","year":"2019","journal-title":"IEEE Access"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1142\/S2301385020500090","article-title":"Multiple UAV systems: A survey","volume":"8","author":"Skorobogatov","year":"2020","journal-title":"Unmanned Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1109\/COMST.2019.2924143","article-title":"Design challenges of multi-UAV systems in cyber-physical applications: A comprehensive survey and future directions","volume":"21","author":"Shakeri","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0307-904X(99)00009-8","article-title":"An integrated performance model for orderpicking systems with randomized storage","volume":"24","author":"Malmborg","year":"2000","journal-title":"Appl. Math. Model."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","article-title":"Design and control of warehouse order picking: A literature review","volume":"182","author":"Roodbergen","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/S0360-8352(97)00245-3","article-title":"Order picking systems: Batching and storage assignment strategies","volume":"33","author":"Tang","year":"1997","journal-title":"Comput. Ind. Eng."},{"key":"ref_12","unstructured":"Tompkins, J.A., White, J.A., Bozer, Y.A., and Tanchoco, J.M.A. (2010). Facilities Planning, John Wiley & Sons."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1007\/s10514-018-09820-5","article-title":"Dynamic task allocation in an uncertain environment with heterogeneous multi-agents","volume":"43","author":"ElGibreen","year":"2019","journal-title":"Auton. Robot."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1080\/07408170802167670","article-title":"A polling-based dynamic order picking system for online retailers","volume":"40","author":"Gong","year":"2008","journal-title":"IIE Trans."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.rcim.2010.06.011","article-title":"Online rescheduling of multiple picking agents for warehouse management","volume":"27","author":"Rubrico","year":"2011","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ijpe.2017.04.002","article-title":"An interventionist strategy for warehouse order picking: Evidence from two case studies","volume":"189","author":"Giannikas","year":"2017","journal-title":"Int. J. Prod. Econ."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4595316","DOI":"10.1155\/2020\/4595316","article-title":"A polling-based dynamic order-picking system considering priority orders","volume":"2020","author":"Ran","year":"2020","journal-title":"Complexity"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., George, J., and Ramanathan, U. (2014). The role of logistics in e-commerce transactions: An exploratory study of customer feedback and risk. Supply Chain Strategies, Issues and Models, Springer.","DOI":"10.1007\/978-1-4471-5352-8_10"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.ejor.2005.03.052","article-title":"Travel time estimation and order batching in a 2-block warehouse","volume":"176","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.apm.2016.12.012","article-title":"On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm","volume":"45","author":"Zhang","year":"2017","journal-title":"Appl. Math. Model."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ijpe.2009.01.013","article-title":"Evaluating order throughput time in 2-block warehouses with time window batching","volume":"121","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2549","DOI":"10.1016\/j.cor.2011.12.019","article-title":"Algorithms for on-line order batching in an order picking warehouse","volume":"39","author":"Henn","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Stodola, P., Michenka, K., Nohel, J., and Rybansk\u1ef3, M. (2020). Hybrid algorithm based on ant colony optimization and simulated annealing applied to the dynamic traveling salesman problem. Entropy, 22.","DOI":"10.3390\/e22080884"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Str\u0105k, \u0141., Skinderowicz, R., Boryczka, U., and Nowakowski, A. (2019). A self-adaptive discrete PSO algorithm with heterogeneous parameter values for dynamic TSP. Entropy, 21.","DOI":"10.20944\/preprints201905.0187.v1"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Sim\u00f5es, A., and Costa, E. (2013, January 6\u201310). Extended virtual loser genetic algorithm for the dynamic traveling salesman problem. Proceedings of the Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands.","DOI":"10.1145\/2463372.2463472"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Guntsch, M., and Middendorf, M. (2001, January 18\u201320). Pheromone modification strategies for ant algorithms applied to dynamic TSP. Proceedings of the Workshops on Applications of Evolutionary Computation, Como, Italy.","DOI":"10.1007\/3-540-45365-2_22"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","article-title":"Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors","volume":"13","author":"Mavrovouniotis","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Melo, L., Pereira, F., and Costa, E. (2013, January 4\u20136). Multi-caste ant colony algorithm for the dynamic traveling salesperson problem. Proceedings of the International Conference on Adaptive and Natural Computing Algorithms, Lausanne, Switzerland.","DOI":"10.1007\/978-3-642-37213-1_19"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Boryczka, U., and Str\u0105k, \u0141. (2012, January 28\u201330). A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem. Proceedings of the International Conference on Computational Collective Intelligence, Ho Chi Minh City, Vietnam.","DOI":"10.1007\/978-3-642-34707-8_51"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1108\/IR-04-2020-0073","article-title":"Review on state-of-the-art dynamic task allocation strategies for multiple-robot systems","volume":"47","author":"Saravanan","year":"2020","journal-title":"Ind. Robot"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TMECH.2009.2014157","article-title":"Multiple traveling robot problem: A solution based on dynamic task selection and robust execution","volume":"14","author":"Balch","year":"2009","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.robot.2016.10.008","article-title":"A taxonomy for task allocation problems with temporal and ordering constraints","volume":"90","author":"Nunes","year":"2017","journal-title":"Robot. Auton. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/TCST.2016.2599486","article-title":"Energy-Constrained Coordination of Multi-Robot Teams","volume":"25","author":"Setter","year":"2017","journal-title":"IEEE Trans. Control Syst. Technol."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"9871","DOI":"10.1109\/TCYB.2021.3079346","article-title":"Moving-Distance-Minimized PSO for Mobile Robot Swarm","volume":"52","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10845-014-0871-1","article-title":"An ACO-Based online routing method for multiple order pickers with congestion consideration in warehouse","volume":"27","author":"Chen","year":"2016","journal-title":"J. Intell. Manuf."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_37","unstructured":"Choe, K. (1990). Aisle-Based order pick systems with batching, zoning, and sorting. School of Industrial and Systems Engineering, Georgia Institute of Technology."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN ant system","volume":"16","author":"Sttzle","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.promfg.2020.01.302","article-title":"Order Batching Optimization for Warehouses with Cluster-Picking","volume":"39","author":"Aboelfotoh","year":"2019","journal-title":"Procedia Manuf."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"6552","DOI":"10.1080\/00207543.2019.1567948","article-title":"Dynamic order batching in bucket brigade order picking systems with consecutive batch windows and non-identical pickers","volume":"57","author":"Fibrianto","year":"2019","journal-title":"Int. J. Prod. Res."}],"container-title":["Remote Sensing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2072-4292\/14\/23\/6106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:32:27Z","timestamp":1760146347000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2072-4292\/14\/23\/6106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":40,"journal-issue":{"issue":"23","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["rs14236106"],"URL":"https:\/\/doi.org\/10.3390\/rs14236106","relation":{},"ISSN":["2072-4292"],"issn-type":[{"value":"2072-4292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]}}}