{"id":"https://openalex.org/W7154715093","doi":"https://doi.org/10.48550/arxiv.2604.15202","title":"Benchmarking Classical Coverage Path Planning Heuristics on Irregular Hexagonal Grids for Maritime Coverage Scenarios","display_name":"Benchmarking Classical Coverage Path Planning Heuristics on Irregular Hexagonal Grids for Maritime Coverage Scenarios","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154715093","doi":"https://doi.org/10.48550/arxiv.2604.15202"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15202","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101675145","display_name":"Carlos Sep\u00falveda","orcid":"https://orcid.org/0000-0003-4429-1324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sep\u00falveda, Carlos S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053436240","display_name":"Gonzalo A. Ruz","orcid":"https://orcid.org/0000-0001-7740-9865"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ruz, Gonzalo A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11622","display_name":"Maritime Navigation and Safety","score":0.5034000277519226,"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.5034000277519226,"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.36500000953674316,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.01640000008046627,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/heuristics","display_name":"Heuristics","score":0.8337000012397766},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6417999863624573},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.5526000261306763},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5411999821662903},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5202000141143799},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47099998593330383},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45669999718666077}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8337000012397766},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6417999863624573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5665000081062317},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.5526000261306763},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5411999821662903},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5406000018119812},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5202000141143799},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3995000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3953999876976013},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C128765274","wikidata":"https://www.wikidata.org/wiki/Q663314","display_name":"Hexagonal crystal system","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3165999948978424},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.30869999527931213},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.27889999747276306},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26030001044273376},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.15202","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Life below water","score":0.6774498820304871,"id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Coverage":[0],"path":[1,43,86],"planning":[2,44],"on":[3,24,30,46,182],"irregular":[4,47,68],"hexagonal":[5,48],"grids":[6],"is":[7,122,129,152,161,166,190],"relevant":[8],"to":[9],"maritime":[10],"surveillance,":[11],"search":[12],"and":[13,15,67,75,90],"rescue":[14],"environmental":[16],"monitoring,":[17],"yet":[18],"classical":[19,126],"methods":[20],"are":[21],"often":[22],"compared":[23],"small":[25],"ad":[26],"hoc":[27],"examples":[28],"or":[29],"rectangular":[31],"grids.":[32],"This":[33,172],"paper":[34],"presents":[35],"a":[36,76,130,140,193,202],"reproducible":[37],"benchmark":[38,59,189],"of":[39,56,204],"deterministic":[40],"single-vehicle":[41],"coverage":[42,105],"heuristics":[45,71,97],"graphs":[49,185],"derived":[50],"from":[51,72],"synthetic":[52],"but":[53,108,156],"maritime-motivated":[54],"areas":[55],"interest.":[57],"The":[58,124,148,188],"contains":[60],"10,000":[61],"Hamiltonian-feasible":[62],"instances":[63],"spanning":[64],"compact,":[65],"elongated,":[66],"morphologies,":[69],"17":[70],"seven":[73],"families,":[74],"common":[77],"evaluation":[78],"protocol":[79],"covering":[80],"Hamiltonian":[81,127,146],"success,":[82,84],"complete-coverage":[83],"revisits,":[85],"length,":[87],"heading":[88],"changes,":[89],"CPU":[91],"latency.":[92],"Across":[93],"the":[94,103,158,164,169],"released":[95,120],"dataset,":[96],"with":[98,139,186],"explicit":[99],"shortest-path":[100],"reconnection":[101],"solve":[102],"relaxed":[104],"task":[106],"reliably":[107],"almost":[109],"never":[110],"produce":[111],"zero-revisit":[112],"tours.":[113],"Exact":[114],"Depth-First":[115],"Search":[116],"confirms":[117],"that":[118,133,174],"every":[119],"instance":[121],"Hamiltonian-feasible.":[123],"strongest":[125],"baseline":[128],"Warnsdorff":[131],"variant":[132],"uses":[134],"an":[135],"index-based":[136],"tie-break":[137],"together":[138],"terminal-inclusive":[141],"residual-degree":[142],"policy,":[143],"reaching":[144],"79.0%":[145],"success.":[147],"dominant":[149],"design":[150],"choice":[151],"not":[153],"tie-breaking":[154],"alone,":[155],"how":[157],"residual":[159],"degree":[160],"defined":[162],"when":[163],"endpoint":[165],"reserved":[167],"until":[168],"final":[170],"move.":[171],"shows":[173],"underreported":[175],"implementation":[176],"details":[177],"can":[178],"materially":[179],"affect":[180],"performance":[181],"sparse":[183],"geometric":[184],"bottlenecks.":[187],"intended":[191],"as":[192,201],"controlled":[194],"testbed":[195],"for":[196],"heuristic":[197],"analysis":[198],"rather":[199],"than":[200],"claim":[203],"operational":[205],"optimality":[206],"at":[207],"fleet":[208],"scale.":[209]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-18T00:00:00"}