Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/115714
DC FieldValueLanguage
dc.contributorDepartment of Aeronautical and Aviation Engineeringen_US
dc.creatorHe, Qen_US
dc.creatorLiu, Wen_US
dc.creatorLiu, TLen_US
dc.creatorTian, Qen_US
dc.date.accessioned2025-10-23T08:15:30Z-
dc.date.available2025-10-23T08:15:30Z-
dc.identifier.issn0191-2615en_US
dc.identifier.urihttp://hdl.handle.net/10397/115714-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.subjectBranch-and-price-and-cuten_US
dc.subjectCoordinated path planningen_US
dc.subjectMaritime monitoringen_US
dc.subjectRobust optimizationen_US
dc.subjectUnmanned aerial vehiclesen_US
dc.subjectUnmanned surface vehiclesen_US
dc.titleRobust coordinated path planning for unmanned aerial vehicles and unmanned surface vehicles in maritime monitoring with travel time uncertaintyen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume199en_US
dc.identifier.doi10.1016/j.trb.2025.103284en_US
dcterms.abstractThis 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.accessRightsembargoed accessen_US
dcterms.bibliographicCitationTransportation research. Part B, Methodological, Sept 2025, v. 199, 103284en_US
dcterms.isPartOfTransportation Research Part B: Methodologicalen_US
dcterms.issued2025-09-
dc.identifier.scopus2-s2.0-105011703676-
dc.identifier.eissn1879-2367en_US
dc.identifier.artn103284en_US
dc.description.validate202510 bcwcen_US
dc.description.oaNot applicableen_US
dc.identifier.SubFormIDG000247/2025-08-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThe 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.pubStatusPublisheden_US
dc.date.embargo2027-09-30en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2027-09-30
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.