{"id":"https://openalex.org/W2163947939","doi":"https://doi.org/10.1109/robot.2006.1641951","title":"Constructing spanning trees for efficient multi-robot coverage","display_name":"Constructing spanning trees for efficient multi-robot coverage","publication_year":2006,"publication_date":"2006-07-10","ids":{"openalex":"https://openalex.org/W2163947939","doi":"https://doi.org/10.1109/robot.2006.1641951","mag":"2163947939"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2006.1641951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5055529558","display_name":"Noa Agmon","orcid":"https://orcid.org/0000-0003-0890-7734"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Agmon","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, IL","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055882707","display_name":"Noam Hazon","orcid":"https://orcid.org/0000-0001-9910-0762"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"N. Hazon","raw_affiliation_strings":["The MAVERICK Group, Bar Ilan University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The MAVERICK Group, Bar Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012168199","display_name":"Gal A. Kaminka","orcid":"https://orcid.org/0000-0001-8341-322X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"G.A. Kaminka","raw_affiliation_strings":["The MAVERICK Group, Bar Ilan University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The MAVERICK Group, Bar Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3151,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":{"value":0.98380026,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1698","last_page":"1703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9883999824523926,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/spanning-tree","display_name":"Spanning tree","score":0.7239825129508972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6794525384902954},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6042894721031189},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.583035945892334},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5635344386100769},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5500933527946472},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5044776201248169},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.48464280366897583},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.470090389251709},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4568394720554352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38876259326934814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35908910632133484},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22293466329574585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2034032642841339},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07265898585319519},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06466376781463623}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7239825129508972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6794525384902954},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6042894721031189},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.583035945892334},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5635344386100769},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5500933527946472},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5044776201248169},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.48464280366897583},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.470090389251709},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4568394720554352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38876259326934814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35908910632133484},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22293466329574585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2034032642841339},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07265898585319519},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06466376781463623},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2006.1641951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1544032329","https://openalex.org/W1566081062","https://openalex.org/W1873425142","https://openalex.org/W1994649922","https://openalex.org/W2022750663","https://openalex.org/W2037337557","https://openalex.org/W2093284501","https://openalex.org/W2110362031","https://openalex.org/W3160257224","https://openalex.org/W4256138906","https://openalex.org/W6659787839"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"This":[0,102],"paper":[1,103,187],"discusses":[2],"the":[3,31,41,44,57,72,81,85,92,98,105,116,124,127,136,141,150,154,157,168,172,199,202,229],"problem":[4,158],"of":[5,13,33,40,59,84,91,108,126,153,171,185,201],"building":[6],"efficient":[7,16,210],"coverage":[8,18,24,39,46,54,66,93,111,137,151,169,180,211,230,242],"paths":[9,35],"for":[10,26,64,178,208,238],"a":[11,23,37,110,205,216,236,239],"team":[12],"robots.":[14],"An":[15],"multirobot":[17],"algorithm":[19,220,243],"should":[20],"result":[21],"in":[22,224],"path":[25],"every":[27],"robot,":[28],"such":[29],"that":[30,71,114,123,165],"union":[32],"all":[34],"generates":[36],"full":[38],"terrain":[42,173],"and":[43,77,139,196],"total":[45],"time":[47,117,152,170,231],"is":[48,75,94,143,161],"minimized.":[49],"A":[50],"method,":[51],"underlying":[52],"several":[53],"algorithms,":[55],"suggests":[56],"use":[58],"spanning":[60,73,100,112,129,163],"trees":[61,164],"as":[62,176,204,222,235],"base":[63,177,207],"creating":[65],"paths.":[67],"Current":[68],"studies":[69],"assume":[70],"tree":[74,113,130,142,203,218],"given,":[76],"try":[78],"to":[79,118],"make":[80],"most":[82],"out":[83],"given":[86,99],"configuration.":[87],"However,":[88],"overall":[89],"performance":[90],"heavily":[95],"dependent":[96],"on":[97],"tree.":[101],"tackles":[104],"open":[106],"challenge":[107],"constructing":[109],"minimizes":[115],"complete":[119],"coverage.":[120],"We":[121],"argue":[122],"choice":[125],"initial":[128,193],"has":[131],"far":[132],"reaching":[133],"consequences":[134],"concerning":[135,198],"time,":[138],"if":[140],"constructed":[144],"appropriately,":[145],"it":[146,191,214],"could":[147],"considerably":[148],"reduce":[149],"terrain.":[155],"Therefore":[156],"studied":[159],"here":[160],"finding":[162],"would":[166],"decrease":[167],"when":[174,233],"used":[175,234],"multi-robot":[179],"algorithms.":[181],"The":[182],"main":[183],"contributions":[184],"this":[186],"are":[188],"twofold.":[189],"First,":[190],"provides":[192],"sound":[194],"discussion":[195],"results":[197],"construction":[200,219],"crucial":[206],"any":[209],"algorithm.":[212],"Second,":[213],"describes":[215],"polynomial-time":[217],"that,":[221],"shown":[223],"extensive":[225],"simulations,":[226],"dramatically":[227],"improves":[228],"even":[232],"basis":[237],"simple,":[240],"inefficient,":[241]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":11},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}