{"id":"https://openalex.org/W7124992953","doi":"https://doi.org/10.1109/lra.2026.3655204","title":"Scalable Multi-Robot Informative Path Planning for Target Mapping via Deep Reinforcement Learning","display_name":"Scalable Multi-Robot Informative Path Planning for Target Mapping via Deep Reinforcement Learning","publication_year":2026,"publication_date":"2026-01-19","ids":{"openalex":"https://openalex.org/W7124992953","doi":"https://doi.org/10.1109/lra.2026.3655204"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2026.3655204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2026.3655204","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009636317","display_name":"Apoorva Vashisth","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Apoorva Vashisth","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0009-0005-3741-9053","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Manav Kulshrestha","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manav Kulshrestha","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123379353","display_name":"Damon Conover","orcid":null},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]},{"id":"https://openalex.org/I2802705668","display_name":"United States Army Combat Capabilities Development Command","ror":"https://ror.org/02rdkx920","country_code":"US","type":"other","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Damon Conover","raw_affiliation_strings":["DEVCOM Army Research Laboratory, Adelphi, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEVCOM Army Research Laboratory, Adelphi, MD, USA","institution_ids":["https://openalex.org/I166416128","https://openalex.org/I2802705668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123413553","display_name":"Aniket Bera","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aniket Bera","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0002-0182-6985","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5009636317"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11258724,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"3","first_page":"3414","last_page":"3421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8995000123977661,"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.8995000123977661,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.03579999879002571,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.012299999594688416,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7473999857902527},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7402999997138977},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6924999952316284},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.6747000217437744},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5774000287055969},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5044000148773193},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.478300005197525},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4499000012874603}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7473999857902527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7422999739646912},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7402999997138977},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6924999952316284},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.6747000217437744},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5960000157356262},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5774000287055969},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5353999733924866},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5044000148773193},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.44699999690055847},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.42730000615119934},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3077000081539154},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.27709999680519104},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.26589998602867126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2026.3655204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2026.3655204","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W2021042867","https://openalex.org/W2044079487","https://openalex.org/W2047599849","https://openalex.org/W2052980340","https://openalex.org/W2089108971","https://openalex.org/W2106086387","https://openalex.org/W2125069195","https://openalex.org/W2137843737","https://openalex.org/W2143088799","https://openalex.org/W2345111710","https://openalex.org/W2791580684","https://openalex.org/W2955087651","https://openalex.org/W2969167400","https://openalex.org/W3033782504","https://openalex.org/W3128478003","https://openalex.org/W3154784371","https://openalex.org/W3204996636","https://openalex.org/W4200438872","https://openalex.org/W4211049957","https://openalex.org/W4211241755","https://openalex.org/W4309078364","https://openalex.org/W4382702148","https://openalex.org/W4383066579","https://openalex.org/W4383108317","https://openalex.org/W4389666571","https://openalex.org/W4391549654","https://openalex.org/W4395703713","https://openalex.org/W4398151526","https://openalex.org/W4398187740","https://openalex.org/W4400187966","https://openalex.org/W4405785979","https://openalex.org/W7124184078"],"related_works":[],"abstract_inverted_index":{"Autonomous":[0],"robots":[1,27,153,216],"are":[2],"widely":[3],"utilized":[4],"for":[5,56,154,204],"mapping":[6],"and":[7,18,96,104,112,217],"exploration":[8],"tasks":[9,34],"due":[10],"to":[11,36,62,88,116,210],"their":[12],"cost-effectiveness.":[13],"Multi-robot":[14],"systems":[15],"offer":[16],"scalability":[17],"efficiency,":[19],"especially":[20],"in":[21,29,70,156,177],"terms":[22,178],"of":[23,26,39,66,126,152,179,182,190],"the":[24,37,57,64,109,180],"number":[25,65,151,181],"deployed":[28],"more":[30,157,205],"complex":[31,158,206],"environments.":[32],"These":[33],"belong":[35],"set":[38],"Multi-Robot":[40],"Informative":[41],"Path":[42],"Planning":[43],"(MRIPP)":[44],"problems.":[45],"In":[46],"this":[47],"paper,":[48],"we":[49],"propose":[50],"a":[51,118,187],"deep":[52],"reinforcement":[53],"learning":[54],"approach":[55,128,165],"MRIPP":[58],"problem.":[59],"We":[60,107,201],"aim":[61],"maximize":[63,89],"discovered":[67,90,183],"stationary":[68],"targets":[69,184],"an":[71],"unknown":[72,93],"3D":[73],"environment":[74],"while":[75,100,185],"operating":[76,101],"under":[77,102],"resource":[78,105],"constraints":[79],"(such":[80],"as":[81],"path":[82],"length).":[83],"Here,":[84],"each":[85],"robot":[86],"aims":[87],"targets,":[91],"avoid":[92],"static":[94],"obstacles,":[95],"prevent":[97],"inter-robot":[98],"collisions":[99],"communication":[103],"constraints.":[106],"utilize":[108],"centralized":[110],"training":[111],"decentralized":[113],"execution":[114],"paradigm":[115],"train":[117],"single":[119],"policy":[120,145],"neural":[121],"network.":[122],"A":[123],"key":[124],"aspect":[125],"our":[127,130],"is":[129],"coordination":[131],"graph":[132],"that":[133],"prioritizes":[134],"visiting":[135],"regions":[136],"not":[137,160],"yet":[138],"explored":[139],"by":[140,169],"other":[141],"robots.":[142],"Our":[143,164],"learned":[144],"can":[146],"be":[147],"copied":[148],"onto":[149],"any":[150],"deployment":[155],"environments":[159,207],"seen":[161],"during":[162],"training.":[163],"outperforms":[166],"state-of-the-art":[167],"approaches":[168],"at":[170],"least":[171],"<inline-formula":[172,193,211],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[173,194,212],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[174,195,213],"notation=\"LaTeX\">$\\bf":[175,196,214],"{26.2\\%}$</tex-math></inline-formula>":[176],"requiring":[186],"planning":[188],"time":[189],"less":[191],"than":[192],"{2}$</tex-math></inline-formula>":[197],"sec":[198],"per":[199],"step.":[200],"present":[202],"results":[203],"with":[208],"up":[209],"{64}$</tex-math></inline-formula>":[215],"compare":[218],"success":[219],"rates":[220],"against":[221],"baseline":[222],"planners.":[223]},"counts_by_year":[],"updated_date":"2026-02-07T06:11:34.122080","created_date":"2026-01-21T00:00:00"}