{"id":"https://openalex.org/W4383503893","doi":"https://doi.org/10.1109/lra.2023.3293319","title":"TMSTC*: A Path Planning Algorithm for Minimizing Turns in Multi-Robot Coverage","display_name":"TMSTC*: A Path Planning Algorithm for Minimizing Turns in Multi-Robot Coverage","publication_year":2023,"publication_date":"2023-07-07","ids":{"openalex":"https://openalex.org/W4383503893","doi":"https://doi.org/10.1109/lra.2023.3293319"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2023.3293319","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3293319","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/A5102854134","display_name":"Junjie Lu","orcid":"https://orcid.org/0009-0004-2506-7567"},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junjie Lu","raw_affiliation_strings":["School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I139024713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073040865","display_name":"Bi Zeng","orcid":"https://orcid.org/0000-0001-8596-8333"},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bi Zeng","raw_affiliation_strings":["School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I139024713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090440775","display_name":"Jingtao Tang","orcid":"https://orcid.org/0000-0002-4828-9021"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingtao Tang","raw_affiliation_strings":["School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076185690","display_name":"Tin Lun Lam","orcid":"https://orcid.org/0000-0002-6363-1446"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tin Lun Lam","raw_affiliation_strings":["School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038609713","display_name":"Junbin Wen","orcid":"https://orcid.org/0009-0009-1124-790X"},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junbin Wen","raw_affiliation_strings":["School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China","institution_ids":["https://openalex.org/I139024713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5102854134"],"corresponding_institution_ids":["https://openalex.org/I139024713"],"apc_list":null,"apc_paid":null,"fwci":6.1384,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.97506277,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"8","issue":"8","first_page":"5275","last_page":"5282"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.982699990272522,"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.6851776838302612},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6556872129440308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6346198320388794},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6263054013252258},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6007548570632935},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.599459707736969},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5289388298988342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5137542486190796},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49232399463653564},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4816233515739441},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.45197296142578125},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4404109716415405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43678534030914307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4256889224052429},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30960214138031006},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2856217622756958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21532350778579712},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14158865809440613},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07795846462249756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07790082693099976}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6851776838302612},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6556872129440308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6346198320388794},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6263054013252258},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6007548570632935},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.599459707736969},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5289388298988342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5137542486190796},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49232399463653564},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4816233515739441},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.45197296142578125},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4404109716415405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43678534030914307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4256889224052429},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30960214138031006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2856217622756958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21532350778579712},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14158865809440613},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07795846462249756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07790082693099976},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2023.3293319","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3293319","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5899999737739563}],"awards":[{"id":"https://openalex.org/G3744818756","display_name":null,"funder_award_id":"62172111","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1590932131","https://openalex.org/W1873425142","https://openalex.org/W1999016010","https://openalex.org/W2000889179","https://openalex.org/W2019738489","https://openalex.org/W2106498895","https://openalex.org/W2135125135","https://openalex.org/W2163947939","https://openalex.org/W2553326346","https://openalex.org/W2579187612","https://openalex.org/W2952408149","https://openalex.org/W2956901944","https://openalex.org/W2965291511","https://openalex.org/W2967496134","https://openalex.org/W3003308247","https://openalex.org/W3044306737","https://openalex.org/W3126385256","https://openalex.org/W3200142631","https://openalex.org/W3206197245","https://openalex.org/W4205268283","https://openalex.org/W4289539331"],"related_works":["https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W2618632915","https://openalex.org/W2077416514","https://openalex.org/W4292862729","https://openalex.org/W2150982344","https://openalex.org/W2157678966","https://openalex.org/W2350727589"],"abstract_inverted_index":{"Coverage":[0,41],"path":[1,18,48],"planning":[2,49],"is":[3],"a":[4,16,76,82,90],"major":[5],"application":[6],"for":[7],"mobile":[8],"robots,":[9],"which":[10],"requires":[11],"robots":[12,114],"to":[13,19,85,93,115,127],"move":[14],"along":[15],"planned":[17],"cover":[20],"the":[21,58,67,71,95,100],"entire":[22],"map.":[23],"For":[24],"large-scale":[25],"tasks,":[26],"multirobot":[27,46],"systems":[28],"offer":[29],"significant":[30],"advantages.":[31],"In":[32],"this":[33],"letter,":[34],"we":[35],"propose":[36],"Turn-minimizing":[37],"Multirobot":[38],"Spanning":[39],"Tree":[40],"Star":[42],"(TMSTC*),":[43],"an":[44],"improved":[45],"coverage":[47,103,124],"(mCPP)":[50],"algorithm":[51,56],"based":[52],"on":[53],"MSTC*.":[54],"Our":[55,105],"partitions":[57],"map":[59],"into":[60,69],"minimum":[61],"bricks":[62,87],"as":[63],"tree":[64],"branches,":[65],"transforming":[66],"problem":[68],"finding":[70],"maximum":[72],"independent":[73],"set":[74],"of":[75,97,99,123],"bipartite":[77],"graph.":[78],"We":[79],"then":[80],"use":[81],"greedy":[83],"strategy":[84],"connect":[86],"and":[88],"form":[89],"tree,":[91],"aiming":[92],"minimize":[94],"number":[96],"turns":[98],"corresponding":[101],"circumnavigating":[102],"path.":[104],"experimental":[106],"results":[107],"show":[108],"that":[109],"our":[110],"approach":[111],"enables":[112],"multiple":[113],"make":[116],"fewer":[117],"turns,":[118],"resulting":[119],"in":[120],"faster":[121],"completion":[122],"tasks":[125],"compared":[126],"other":[128],"popular":[129],"algorithms.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":28},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}