{"id":"https://openalex.org/W4414229144","doi":"https://doi.org/10.1109/access.2025.3610079","title":"MRSimEx-DSTC: A Dynamic Spanning Tree Coverage Approach for Multi-Robot Exploration and Coverage Path Planning","display_name":"MRSimEx-DSTC: A Dynamic Spanning Tree Coverage Approach for Multi-Robot Exploration and Coverage Path Planning","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414229144","doi":"https://doi.org/10.1109/access.2025.3610079"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3610079","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3610079","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.2025.3610079","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040804134","display_name":"K. P. Jayalakshmi","orcid":null},"institutions":[{"id":"https://openalex.org/I164861460","display_name":"Manipal Academy of Higher Education","ror":"https://ror.org/02xzytt36","country_code":"IN","type":"education","lineage":["https://openalex.org/I164861460"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. P. Jayalakshmi","raw_affiliation_strings":["Department of Aeronautical and Automobile Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"],"raw_orcid":"https://orcid.org/0000-0002-4093-7442","affiliations":[{"raw_affiliation_string":"Department of Aeronautical and Automobile Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India","institution_ids":["https://openalex.org/I164861460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057625504","display_name":"Vishnu G. Nair","orcid":"https://orcid.org/0000-0003-0599-748X"},"institutions":[{"id":"https://openalex.org/I164861460","display_name":"Manipal Academy of Higher Education","ror":"https://ror.org/02xzytt36","country_code":"IN","type":"education","lineage":["https://openalex.org/I164861460"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vishnu G. Nair","raw_affiliation_strings":["Department of Aeronautical and Automobile Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"],"raw_orcid":"https://orcid.org/0000-0003-0599-748X","affiliations":[{"raw_affiliation_string":"Department of Aeronautical and Automobile Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India","institution_ids":["https://openalex.org/I164861460"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015571760","display_name":"Dayakshini Sathish","orcid":"https://orcid.org/0000-0002-0952-9176"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dayakshini Sathish","raw_affiliation_strings":["Department of Electronics and Communication Engineering, St. Joseph Engineering College, Mangaluru, Karnataka, India","Department of Electronics and Communication Engineering, St Joseph Engineering College, Mangaluru, Karnataka, India"],"raw_orcid":"https://orcid.org/0000-0002-0952-9176","affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, St. Joseph Engineering College, Mangaluru, Karnataka, India","institution_ids":[]},{"raw_affiliation_string":"Department of Electronics and Communication Engineering, St Joseph Engineering College, Mangaluru, Karnataka, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.9349,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79120141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"13","issue":null,"first_page":"163085","last_page":"163102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9570000171661377,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9162999987602234,"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/motion-planning","display_name":"Motion planning","score":0.6888999938964844},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6546000242233276},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.5710999965667725},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.5146999955177307},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5090000033378601},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.49779999256134033},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45410001277923584},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.42160001397132874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8166000247001648},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6888999938964844},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6546000242233276},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6395999789237976},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.5710999965667725},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.5146999955177307},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5090000033378601},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.49779999256134033},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.42160001397132874},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.3799999952316284},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.36660000681877136},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3619999885559082},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3537999987602234},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.3122999966144562},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2784999907016754},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.266400009393692},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3610079","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3610079","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:doaj.org/article:cbf9dc9fd20b41a8a536a58804e01669","is_oa":true,"landing_page_url":"https://doaj.org/article/cbf9dc9fd20b41a8a536a58804e01669","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 163085-163102 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3610079","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3610079","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1873425142","https://openalex.org/W2140929789","https://openalex.org/W2790828517","https://openalex.org/W2892432523","https://openalex.org/W2956901944","https://openalex.org/W2969637259","https://openalex.org/W3004758596","https://openalex.org/W3028504345","https://openalex.org/W3072883259","https://openalex.org/W3150257791","https://openalex.org/W3164666502","https://openalex.org/W3197167612","https://openalex.org/W3198407111","https://openalex.org/W4210376712","https://openalex.org/W4210597237","https://openalex.org/W4288450909","https://openalex.org/W4296616182","https://openalex.org/W4317604158","https://openalex.org/W4322502584","https://openalex.org/W4383903999","https://openalex.org/W4390751615","https://openalex.org/W4392005914","https://openalex.org/W4392726774","https://openalex.org/W4398162670","https://openalex.org/W4399802562","https://openalex.org/W4404035431","https://openalex.org/W4404692614","https://openalex.org/W4405237355","https://openalex.org/W4405785045","https://openalex.org/W4408348673","https://openalex.org/W4408441586","https://openalex.org/W4409014346","https://openalex.org/W4411171757","https://openalex.org/W4411742534","https://openalex.org/W4414431462"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"MRSimEx-DSTC,":[3],"a":[4],"decentralized":[5,59],"and":[6,16,50,61,77,92,98,116,127,138],"adaptive":[7],"framework":[8,85],"for":[9],"multi-robot":[10],"coverage":[11,43,109],"path":[12,44],"planning":[13,136],"in":[14,45,90],"unknown":[15],"dynamic":[17],"environments.":[18],"The":[19,84],"proposed":[20,130],"method":[21],"integrates":[22],"frontier-based":[23],"exploration":[24],"with":[25],"Dynamic":[26],"Spanning":[27],"Tree":[28],"Coverage":[29],"(DSTC),":[30],"allowing":[31],"each":[32],"robot":[33],"to":[34,47,112,121],"incrementally":[35],"map":[36],"the":[37,65,129],"environment":[38],"while":[39],"dynamically":[40],"replanning":[41],"its":[42],"response":[46],"both":[48],"static":[49],"moving":[51],"obstacles":[52],"detected":[53],"via":[54],"onboard":[55],"LiDAR.":[56],"To":[57],"enable":[58],"execution":[60],"prevent":[62],"task":[63,75],"redundancy,":[64],"workspace":[66],"is":[67,86],"partitioned":[68],"using":[69],"Manhattan-distance-based":[70],"Voronoi":[71],"decomposition,":[72],"ensuring":[73],"disjoint":[74],"allocation":[76],"collision-free":[78],"parallel":[79],"operation":[80],"without":[81],"centralized":[82],"coordination.":[83],"validated":[87],"through":[88],"simulations":[89],"Python":[91],"Gazebo":[93],"across":[94],"varying":[95],"obstacle":[96],"densities":[97],"robot\u2013obstacle":[99],"speed":[100],"scenarios.":[101],"Experimental":[102],"results":[103],"show":[104],"that":[105],"MRSimEx-DSTC":[106],"achieves":[107],"high":[108],"efficiency":[110],"(up":[111],"99.5%),":[113],"minimal":[114],"overlap,":[115],"robust":[117],"real-time":[118],"adaptability.":[119],"Compared":[120],"state-of-the-art":[122],"methods":[123],"such":[124],"as":[125],"MR-SimExCoverage":[126],"MAC-Planner,":[128],"approach":[131],"demonstrates":[132],"superior":[133],"performance,":[134],"lower":[135],"overhead,":[137],"greater":[139],"resilience":[140],"under":[141],"real-world":[142],"constraints.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}