Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/116329
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Aeronautical and Aviation Engineering | en_US |
| dc.creator | Chan, YY | en_US |
| dc.creator | Ng, KKH | en_US |
| dc.creator | Wang, T | en_US |
| dc.creator | Hon, KK | en_US |
| dc.creator | Liu, CH | en_US |
| dc.date.accessioned | 2025-12-16T06:41:11Z | - |
| dc.date.available | 2025-12-16T06:41:11Z | - |
| dc.identifier.issn | 0968-090X | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/116329 | - |
| dc.language.iso | en | en_US |
| dc.subject | Aerial systems | en_US |
| dc.subject | Collision avoidance | en_US |
| dc.subject | Minimum-time | en_US |
| dc.subject | Nonlinear model predictive control | en_US |
| dc.subject | Spatial reformulation | en_US |
| dc.title | Near time-optimal trajectory optimisation for drones in last-mile delivery using spatial reformulation approach | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 171 | en_US |
| dc.identifier.doi | 10.1016/j.trc.2024.104986 | en_US |
| dcterms.abstract | Seeking a computationally efficient and time-optimal trajectory for drones is crucial for saving time and energy costs, especially in the field of drone parcel delivery. Still, last-mile drone delivery is a challenge in urban environments, due to the existence of complex spatial constraints arising from high-rise buildings and the inherent non-linearity of the system dynamics. This paper presents a three-stage method to address the trajectory optimisation problem in a constrained environment. First, the kinematics and dynamics of the quadcopter are reformulated in terms of spatial coordinates, which enables the explicit evaluation of the progress of the path. Second, an efficient flight corridor generation algorithm is presented based on the transverse coordinates of the spatial reformulation. Third, the nonlinear model predictive control (NMPC)-based optimal control problem with obstacle avoidance is formulated for solving the time-optimal trajectory. Compared to the true time-optimal trajectory, the flight time of the near time-optimal trajectory is 3.10% longer than the true time-optimal trajectory, but with a 92.5% reduction in computation time. Numerical simulations based on an illustrative scenario as well as a real-world urban environment are conducted. Results demonstrate the effectiveness of the proposed method in generating near time-optimal trajectory but with a reduced computational burden. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Transportation research. Part C, Emerging technologies, Feb. 2025, v. 171, 104986 | en_US |
| dcterms.isPartOf | Transportation research. Part C, Emerging technologies | en_US |
| dcterms.issued | 2025-02 | - |
| dc.identifier.scopus | 2-s2.0-85213865687 | - |
| dc.identifier.eissn | 1879-2359 | en_US |
| dc.identifier.artn | 104986 | en_US |
| dc.description.validate | 202512 bchy | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000489/2025-12 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The work described in this paper was supported by grants from the Research Grants Council, the Hong Kong Government (Grant No. PolyU15201423), Department of Aeronautical and Aviation Engineering , The Hong Kong Polytechnic University , Hong Kong SAR (RJ1D), Research Centre for Unmanned Autonomous Systems (CE1W) and the National Natural Science Foundation of China (Grant number: 72301229 ). | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2026-02-28 | 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.



