Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/117689
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | - |
| dc.contributor | Research Institute for Advanced Manufacturing | - |
| dc.creator | Keung, KL | - |
| dc.creator | Lee, CKM | - |
| dc.creator | Yung, KL | - |
| dc.creator | Chung, KT | - |
| dc.creator | Hou, Z | - |
| dc.date.accessioned | 2026-02-26T08:14:30Z | - |
| dc.date.available | 2026-02-26T08:14:30Z | - |
| dc.identifier.issn | 0954-4828 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/117689 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Taylor & Francis | en_US |
| dc.subject | Robotic mobile fulfilment system | en_US |
| dc.subject | Small language model | en_US |
| dc.subject | UAV | en_US |
| dc.subject | Warehousing | en_US |
| dc.title | Small language model-assisted zone prioritisation for UAV-integrated robotic mobile fulfilment systems | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.doi | 10.1080/09544828.2025.2612462 | - |
| dcterms.abstract | Robotic mobile fulfilment systems (RMFS) and unmanned aerial vehicles (UAVs) are among the new solutions in handling goods and order fulfilment in high-tech warehouse logistics, which are on the rise. A major issue in the warehouses is the dynamic situation that is usually present in warehouses, causing unreliable task priorities for the different parts of the warehouse, leading to low scalability and poor resource rates. This paper proposes an innovative framework that helps to function the algorithms with the help of small language models (SLMs), developed for the edge deployment in RMFS. Customer order information is the SLMs’ main input, including the processing of natural language specifications on the item's urgency and requirements, which can be used to produce prioritised zone and uncertainty quantification. The zones obtained are further optimised based on the improved parallel multi-ant colony optimisation (IP-MACO) algorithm, which is made fair and efficient by our modifications for the UAV navigation. In the virtual warehouse model, simulations prove the effectiveness of this approach in cutting down fulfilment time, energy savings and also in achieving better overall task fairness. This method works on the conversed drawbacks posed by traditional heuristics, facilitating proper operations in dynamic and high-speed RMFS. | - |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Journal of engineering design, Published online: 11 Jan 2026, Latest Articles, https://doi.org/10.1080/09544828.2025.2612462 | - |
| dcterms.isPartOf | Journal of engineering design | - |
| dcterms.issued | 2026 | - |
| dc.identifier.scopus | 2-s2.0-105027985491 | - |
| dc.identifier.eissn | 1466-1837 | - |
| dc.description.validate | 202602 bcjz | - |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G001063/2026-02 | en_US |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | This work was supported by the Department of Industrial and Systems Engineering – Department General Research Fund (DGFR – Project Code: 4-ZZSD), The Hong Kong Polytechnic University, Hong Kong. Our gratitude is also extended to the Research Committee and the Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hong Kong, and The Innovation and Technology Commission, The Government of the Hong Kong SAR, Hong Kong for support of this project (ITS/008/24SC/ZPEV). The work described in this paper was also supported by the funding support from the Research Institute for Advanced Manufacturing (RIAM) of The Hong Kong Polytechnic University (Project code: 1-CDNQ). | en_US |
| dc.description.pubStatus | Early release | en_US |
| dc.date.embargo | 2027-01-11 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



