Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/115714
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Aeronautical and Aviation Engineering | en_US |
| dc.creator | He, Q | en_US |
| dc.creator | Liu, W | en_US |
| dc.creator | Liu, TL | en_US |
| dc.creator | Tian, Q | en_US |
| dc.date.accessioned | 2025-10-23T08:15:30Z | - |
| dc.date.available | 2025-10-23T08:15:30Z | - |
| dc.identifier.issn | 0191-2615 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/115714 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Pergamon Press | en_US |
| dc.subject | Branch-and-price-and-cut | en_US |
| dc.subject | Coordinated path planning | en_US |
| dc.subject | Maritime monitoring | en_US |
| dc.subject | Robust optimization | en_US |
| dc.subject | Unmanned aerial vehicles | en_US |
| dc.subject | Unmanned surface vehicles | en_US |
| dc.title | Robust coordinated path planning for unmanned aerial vehicles and unmanned surface vehicles in maritime monitoring with travel time uncertainty | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 199 | en_US |
| dc.identifier.doi | 10.1016/j.trb.2025.103284 | en_US |
| dcterms.abstract | This study examines the routing and scheduling of an integrated system of unmanned aerial vehicles (UAVs) and unmanned surface vehicles (USVs) for maritime surveillance. The uncertainties in air and maritime conditions can cause delays in the movements of UAVs and USVs. We introduce a robust coordinated path planning approach for the UAV-USV system, optimizing operational efficiency while accounting for UAV/USV travel time unreliability. Specifically, we propose a novel robust compact formulation for the coordinated path planning problem using the budgeted uncertainty sets. To solve this complex problem, we decompose it into a master problem, i.e., a set partitioning problem, and a subproblem that deals with the robust resource-constrained elementary shortest paths. Furthermore, we propose a customized branch-and-price-and-cut solution algorithm to efficiently solve the robust path planning problem. Numerical studies illustrate that our approach can produce solutions that are significantly more robust than those that ignore uncertainty. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Transportation research. Part B, Methodological, Sept 2025, v. 199, 103284 | en_US |
| dcterms.isPartOf | Transportation Research Part B: Methodological | en_US |
| dcterms.issued | 2025-09 | - |
| dc.identifier.scopus | 2-s2.0-105011703676 | - |
| dc.identifier.eissn | 1879-2367 | en_US |
| dc.identifier.artn | 103284 | en_US |
| dc.description.validate | 202510 bcwc | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000247/2025-08 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The authors would like to thank the anonymous referees for their useful comments, which helped improve both the technical quality and exposition of this paper. This research was partly supported by funding from the Research Grants Council of Hong Kong through the NSFC/RGC Joint Research Scheme (N_PolyU521/22), the National Natural Science Foundation of China (No. 72288101), and The Hong Kong Polytechnic University, Hong Kong (P0039246, P0040900, P0041316). This research project (Project Number: S2024.A7.022.24S) is also partly funded by the Strategic Public Policy Research Funding Scheme of The Government of the Hong Kong Special Administrative Region, China. | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2027-09-30 | 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.



