{"id":"https://openalex.org/W7147667835","doi":"https://doi.org/10.48550/arxiv.2603.28385","title":"Critic-Free Deep Reinforcement Learning for Maritime Coverage Path Planning on Irregular Hexagonal Grids","display_name":"Critic-Free Deep Reinforcement Learning for Maritime Coverage Path Planning on Irregular Hexagonal Grids","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7147667835","doi":"https://doi.org/10.48550/arxiv.2603.28385"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28385","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.2603.28385","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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.59579998254776,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.59579998254776,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.16030000150203705,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.03099999949336052,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.6929000020027161},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5925999879837036},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5105999708175659},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4221999943256378},{"id":"https://openalex.org/keywords/heading","display_name":"Heading (navigation)","score":0.4009000062942505},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.35510000586509705},{"id":"https://openalex.org/keywords/laptop","display_name":"Laptop","score":0.3434000015258789},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.33809998631477356},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.33480000495910645}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6929000020027161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6065999865531921},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5925999879837036},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5105999708175659},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48660001158714294},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C2776937971","wikidata":"https://www.wikidata.org/wiki/Q4384217","display_name":"Heading (navigation)","level":2,"score":0.4009000062942505},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3440999984741211},{"id":"https://openalex.org/C2780008327","wikidata":"https://www.wikidata.org/wiki/Q3962","display_name":"Laptop","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30300000309944153},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C10485038","wikidata":"https://www.wikidata.org/wiki/Q48996162","display_name":"Hyperparameter optimization","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.26489999890327454},{"id":"https://openalex.org/C156172958","wikidata":"https://www.wikidata.org/wiki/Q3438407","display_name":"Grid reference","level":4,"score":0.26440000534057617},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28385","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.2603.28385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28385","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","id":"https://metadata.un.org/sdg/14","score":0.5264827609062195}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Maritime":[0],"surveillance":[1],"missions,":[2],"such":[3],"as":[4,78],"search":[5],"and":[6,8,21,41,160,177],"rescue":[7],"environmental":[9],"monitoring,":[10],"rely":[11],"on":[12,32,63,126,131,187],"the":[13,76,95,151,167],"efficient":[14],"allocation":[15],"of":[16,67,97,120],"sensing":[17],"assets":[18],"over":[19],"vast":[20],"geometrically":[22],"complex":[23],"areas.":[24,70],"Traditional":[25],"Coverage":[26],"Path":[27],"Planning":[28],"(CPP)":[29],"approaches":[30],"depend":[31],"decomposition":[33],"techniques":[34],"that":[35,138],"struggle":[36],"with":[37,161,179],"irregular":[38,68],"coastlines,":[39],"islands,":[40],"exclusion":[42],"zones,":[43],"or":[44],"require":[45],"computationally":[46],"expensive":[47],"re-planning":[48],"for":[49,193],"every":[50],"instance.":[51],"We":[52],"propose":[53],"a":[54,79,85,106,127,139,143,188],"Deep":[55],"Reinforcement":[56],"Learning":[57],"(DRL)":[58],"framework":[59],"to":[60],"solve":[61],"CPP":[62],"hexagonal":[64],"grid":[65],"representations":[66],"maritime":[69,135],"Unlike":[71],"conventional":[72],"methods,":[73],"we":[74,104],"formulate":[75],"problem":[77],"neural":[80],"combinatorial":[81],"optimization":[82],"task":[83],"where":[84],"Transformer-based":[86],"pointer":[87],"policy":[88,141],"autoregressively":[89],"constructs":[90],"coverage":[91],"tours.":[92],"To":[93],"overcome":[94],"instability":[96],"value":[98,128],"estimation":[99],"in":[100],"long-horizon":[101],"routing":[102],"problems,":[103],"implement":[105],"critic-free":[107],"Group-Relative":[108],"Policy":[109],"Optimization":[110],"(GRPO)":[111],"scheme.":[112],"This":[113],"method":[114],"estimates":[115],"advantages":[116],"through":[117],"within-instance":[118],"comparisons":[119],"sampled":[121],"trajectories":[122],"rather":[123],"than":[124,149,166],"relying":[125],"function.":[129],"Experiments":[130],"1,000":[132],"unseen":[133],"synthetic":[134],"environments":[136],"demonstrate":[137],"trained":[140],"achieves":[142],"99.0%":[144],"Hamiltonian":[145],"success":[146],"rate,":[147],"more":[148],"double":[150],"best":[152],"heuristic":[153],"(46.0%),":[154],"while":[155],"producing":[156],"paths":[157],"7%":[158],"shorter":[159],"24%":[162],"fewer":[163],"heading":[164],"changes":[165],"closest":[168],"baseline.":[169],"All":[170],"three":[171],"inference":[172],"modes":[173],"(greedy,":[174],"stochastic":[175],"sampling,":[176],"sampling":[178],"2-opt":[180],"refinement)":[181],"operate":[182],"under":[183],"50~ms":[184],"per":[185],"instance":[186],"laptop":[189],"GPU,":[190],"confirming":[191],"feasibility":[192],"real-time":[194],"on-board":[195],"deployment.":[196]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-02T00:00:00"}