{"id":"https://openalex.org/W7123355609","doi":"https://doi.org/10.1109/access.2026.3652001","title":"H3CPP: Boundary-Safe Coverage Path Planning for Multi-USV Operations in Irregular Coastal Environments","display_name":"H3CPP: Boundary-Safe Coverage Path Planning for Multi-USV Operations in Irregular Coastal Environments","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7123355609","doi":"https://doi.org/10.1109/access.2026.3652001"},"language":null,"primary_location":{"id":"doi:10.1109/access.2026.3652001","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3652001","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3652001","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054072214","display_name":"Giannis Spiliopoulos","orcid":"https://orcid.org/0000-0002-5003-7923"},"institutions":[{"id":"https://openalex.org/I98805295","display_name":"University of the Aegean","ror":"https://ror.org/03zsp3p94","country_code":"GR","type":"education","lineage":["https://openalex.org/I98805295"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Giannis Spiliopoulos","raw_affiliation_strings":["Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece","institution_ids":["https://openalex.org/I98805295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052208676","display_name":"Elias K. Xidias","orcid":"https://orcid.org/0000-0002-6228-4577"},"institutions":[{"id":"https://openalex.org/I98805295","display_name":"University of the Aegean","ror":"https://ror.org/03zsp3p94","country_code":"GR","type":"education","lineage":["https://openalex.org/I98805295"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Elias Xidias","raw_affiliation_strings":["Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece","institution_ids":["https://openalex.org/I98805295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103188414","display_name":"Dimitris Zissis","orcid":"https://orcid.org/0000-0002-6957-3494"},"institutions":[{"id":"https://openalex.org/I98805295","display_name":"University of the Aegean","ror":"https://ror.org/03zsp3p94","country_code":"GR","type":"education","lineage":["https://openalex.org/I98805295"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Dimitris Zissis","raw_affiliation_strings":["Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Product and Systems Design Engineering, University of the Aegean, Ermoupoli, Greece","institution_ids":["https://openalex.org/I98805295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054072214"],"corresponding_institution_ids":["https://openalex.org/I98805295"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18113208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"6065","last_page":"6076"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.5667999982833862,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.5667999982833862,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.30649998784065247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.02329999953508377,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.628600001335144},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6021000146865845},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5633999705314636},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5266000032424927},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5203999876976013},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5098999738693237},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5095000267028809},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4650999903678894},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.439300000667572}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6697999835014343},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.628600001335144},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6021000146865845},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5633999705314636},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5203999876976013},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4496000111103058},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4068000018596649},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C199104240","wikidata":"https://www.wikidata.org/wiki/Q118291","display_name":"Marine engineering","level":1,"score":0.3799999952316284},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35260000824928284},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.33230000734329224},{"id":"https://openalex.org/C132943942","wikidata":"https://www.wikidata.org/wiki/Q2562511","display_name":"Footprint","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32249999046325684},{"id":"https://openalex.org/C2983008078","wikidata":"https://www.wikidata.org/wiki/Q863495","display_name":"Grid cell","level":3,"score":0.30720001459121704},{"id":"https://openalex.org/C128765274","wikidata":"https://www.wikidata.org/wiki/Q663314","display_name":"Hexagonal crystal system","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C91370436","wikidata":"https://www.wikidata.org/wiki/Q5608616","display_name":"Grid method multiplication","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C174128100","wikidata":"https://www.wikidata.org/wiki/Q846907","display_name":"Spiral (railway)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C156172958","wikidata":"https://www.wikidata.org/wiki/Q3438407","display_name":"Grid reference","level":4,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3652001","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3652001","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:zenodo.org:18449121","is_oa":true,"landing_page_url":"https://doi.org/10.1109/ACCESS.2026.3652001","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, 14, 6065 - 6076, (2026-01-12)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3652001","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3652001","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8345638513565063,"display_name":"Life below water","id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1526524219","https://openalex.org/W1535557537","https://openalex.org/W2019738489","https://openalex.org/W2110824994","https://openalex.org/W2117226423","https://openalex.org/W2345644119","https://openalex.org/W2789773866","https://openalex.org/W2944573081","https://openalex.org/W2956901944","https://openalex.org/W2993782368","https://openalex.org/W3007565530","https://openalex.org/W3194836578","https://openalex.org/W3197167612","https://openalex.org/W3208321106","https://openalex.org/W4225899845","https://openalex.org/W4238030919","https://openalex.org/W4285177689","https://openalex.org/W4288762357","https://openalex.org/W4390597814","https://openalex.org/W4391678819","https://openalex.org/W4392358308","https://openalex.org/W4396955871","https://openalex.org/W4399414910","https://openalex.org/W4400486216","https://openalex.org/W4402315547"],"related_works":[],"abstract_inverted_index":{"As":[0],"the":[1,60,96,120,157,184,189,199,224],"need":[2],"for":[3,253],"persistent":[4],"ocean":[5],"monitoring":[6],"grows,":[7],"fleets":[8],"of":[9,100,156],"Unmanned":[10],"Surface":[11],"Vessels":[12],"(USVs)":[13],"are":[14,87,111],"a":[15,34,55,101,133,141,211,249],"promising":[16],"way":[17],"to":[18,65,94,177,180,210,230],"survey":[19],"large":[20],"marine":[21,69],"protected":[22],"areas":[23],"with":[24,166],"low":[25],"operational":[26,121],"cost.":[27],"Their":[28],"effectiveness,":[29],"however,":[30],"depends":[31],"on":[32,80,126,132,207],"solving":[33],"challenging":[35],"multi-robot":[36],"Coverage":[37],"Path":[38],"Planning":[39],"(CPP)":[40],"problem":[41],"over":[42],"complex":[43],"coastal":[44,135,259],"geometries":[45],"while":[46,160,214],"strictly":[47],"respecting":[48],"safety":[49],"boundaries.":[50],"This":[51],"paper":[52],"presents":[53],"H3CPP,":[54],"CPP":[56,251],"framework":[57,235],"that":[58,105,117,164,196],"leverages":[59],"H3":[61,90],"hierarchical":[62],"hexagonal":[63,239],"grid":[64],"discretize":[66],"arbitrarily":[67],"shaped":[68],"areas,":[70],"cluster":[71],"them":[72],"into":[73,248],"connected":[74],"subregions,":[75],"and":[76,103,131,168,171,218,243],"construct":[77],"boundary-aware":[78],"graphs":[79],"which":[81],"Traveling":[82],"Salesman":[83],"Problem":[84],"(TSP)":[85],"tours":[86],"computed.":[88],"Each":[89],"cell":[91],"is":[92],"sized":[93],"match":[95],"nominal":[97],"sensing":[98],"footprint":[99],"USV,":[102],"edges":[104],"intersect":[106],"land":[107],"or":[108],"forbidden":[109],"zones":[110],"exponentially":[112],"penalized,":[113],"encouraging":[114],"safe":[115],"paths":[116],"remain":[118],"within":[119],"polygon.":[122],"We":[123],"evaluate":[124],"H3CPP":[125,148,197],"seven":[127],"benchmark":[128],"polygonal":[129],"maps":[130],"real-world":[134],"marina":[136,191],"using":[137],"1\u201310":[138],"USVs.":[139,232],"For":[140],"single":[142],"USV":[143,254],"in":[144,183,257],"complex,":[145],"non-convex":[146],"environments,":[147],"achieves":[149],"near-complete":[150],"coverage":[151,217],"(coverage":[152],"ratio":[153],"\u2248":[154],"1.0":[155],"target":[158],"area)":[159],"avoiding":[161],"boundary":[162],"violations":[163],"occur":[165],"swath":[167],"spiral":[169],"baselines,":[170],"reduces":[172],"path":[173],"length":[174],"by":[175,203],"up":[176],"10%":[178],"compared":[179],"these":[181],"methods":[182],"most":[185],"irregular":[186],"shapes.":[187],"In":[188],"Syros":[190],"scenario,":[192],"multi-USV":[193],"experiments":[194],"show":[195],"decreases":[198],"total":[200],"traveled":[201],"distance":[202],"4\u201334%":[204],"(\u2248":[205],"20%":[206],"average)":[208],"relative":[209],"decomposition-plus-swaths":[212],"baseline,":[213],"maintaining":[215],"similar":[216],"systematically":[219],"reducing":[220],"mission":[221],"makespan":[222],"as":[223],"fleet":[225],"size":[226],"increases":[227],"from":[228],"1":[229],"10":[231],"The":[233],"proposed":[234],"therefore":[236],"combines":[237],"geodesic":[238],"indexing,":[240],"connectivity-aware":[241],"clustering,":[242],"penalized":[244],"graph-based":[245],"TSP":[246],"planning":[247],"practical":[250],"solution":[252],"swarms":[255],"operating":[256],"realistic":[258],"environments.":[260]},"counts_by_year":[],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2026-01-14T00:00:00"}