Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/120949
DC FieldValueLanguage
dc.contributorDepartment of Electrical and Electronic Engineeringen_US
dc.creatorZhang, Jen_US
dc.creatorLin, Hen_US
dc.creatorWu, Wen_US
dc.creatorGu, Wen_US
dc.date.accessioned2026-09-03T01:12:50Z-
dc.date.available2026-09-03T01:12:50Z-
dc.identifier.issn1366-5545en_US
dc.identifier.urihttp://hdl.handle.net/10397/120949-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.subjectCoverage path planningen_US
dc.subjectFix-and-Optimize methoden_US
dc.subjectForestry monitoringen_US
dc.subjectMulti-objective optimizationen_US
dc.subjectTruck-drone collaborationen_US
dc.titleMulti-objective optimization of truck-drone collaborative forestry monitoringen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume217en_US
dc.identifier.doi10.1016/j.tre.2026.105191en_US
dcterms.abstractAccuracy and timeliness of forestry monitoring are critical for reliable resource assessment and early warning of pest and disease outbreaks. While drone technologies are increasingly used for forestry monitoring, current applications often lack systematic planning. Monitoring operations rely heavily on manual experience, resulting in low efficiency, redundant coverage, and coverage gaps. To address the trade-off between coverage completeness and operational timeliness in large and topographically complex forests, we investigate a truck-drone collaborative forestry monitoring framework that jointly optimizes vehicle routes, candidate docking points, and unmanned aerial vehicle (UAV or drone) coverage paths. The dual objectives of our model are to maximize coverage and minimize total operational time subject to road-network and engineering constraints. To this end, the monitoring region is gridded in a projected coordinate system. Non-monitoring units (e.g., villages, farmlands) identified through remote sensing and field surveys are excluded to reduce redundant searches and monitoring. Road network data serves as constraints for vehicle access and docking point selection. We propose a Fix-and-Optimize (FO) iterative decomposition to decouple and alternately solve two coupled subproblems: docking-point combination selection and sub-region partitioning. Under fixed task region division, clustering-based sampling and variable neighborhood search optimization are performed for docking point combinations. Under fixed docking points, isolated block detection and local redistribution are conducted for sub-regions, and a genetic algorithm is used to optimize the heading angles of boustrophedon flight paths for efficient coverage routes. To improve the solution efficiency for large-scale cases, we devise a mechanism for maintaining and parallel evaluating the Pareto front. In the case study of Qingyuan, China, the proposed method reduces total operational time by 30.06 % at the same coverage level compared with the current manual planning scheme. The Pareto front also reveals a clear trade-off: coverage gains diminish sharply beyond approximately 55 UAV flights, and the 55-flight scheme achieves 96.6 % coverage while reducing the number of sorties by 16.7 % with only a 3.4 % coverage loss relative to the 66-flight full-coverage scheme. Our framework provides a quantitative tool for decision-makers to balance coverage goals with resource constraints, enabling more efficient and effective large-scale forestry monitoring.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationTransportation research. Part E, Logistics and transportation review, Jan. 2027, v. 217, 105191en_US
dcterms.isPartOfTransportation research. Part E, Logistics and transportation reviewen_US
dcterms.issued2027-01-
dc.identifier.eissn1878-5794en_US
dc.identifier.artn105191en_US
dc.description.validate202609 bcchen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera4802-
dc.identifier.SubFormID53932-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis work is jointly supported by Guangdong Basic and Applied Research Foundation (Project No. 2026A1515011087, 2025B1515020056), and the National Natural Science Foundation of China (Project No. 52272310, 72671115).en_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2030-01-31en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2030-01-31
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.