{"id":"https://openalex.org/W3146778708","doi":"https://doi.org/10.1109/lra.2021.3068679","title":"Multi-Goal Path Planning Using Multiple Random Trees","display_name":"Multi-Goal Path Planning Using Multiple Random Trees","publication_year":2021,"publication_date":"2021-03-24","ids":{"openalex":"https://openalex.org/W3146778708","doi":"https://doi.org/10.1109/lra.2021.3068679","mag":"3146778708"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2021.3068679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3068679","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2106.03407","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jaroslav Janos","orcid":"https://orcid.org/0000-0002-0467-7356"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jaroslav Janos","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vojtech Vonasek","orcid":"https://orcid.org/0000-0001-9224-2151"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vojtech Vonasek","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":null,"display_name":"Robert Penicka","orcid":"https://orcid.org/0000-0001-8549-4932"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Robert Penicka","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":3.8756,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.94841334,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"6","issue":"2","first_page":"4201","last_page":"4208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8932999968528748,"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.8932999968528748,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.022099999710917473,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11106","display_name":"Data Management and Algorithms","score":0.01209999993443489,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.677299976348877},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6047999858856201},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5999000072479248},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5760999917984009},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5418999791145325},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.677299976348877},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6047999858856201},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5999000072479248},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5760999917984009},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5418999791145325},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4875999987125397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45559999346733093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4465000033378601},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.4180000126361847},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.40470001101493835},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30250000953674316},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2800000011920929},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26350000500679016}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2021.3068679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3068679","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"},{"id":"pmh:oai:arXiv.org:2106.03407","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.03407","pdf_url":"https://arxiv.org/pdf/2106.03407","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2106.03407","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.03407","pdf_url":"https://arxiv.org/pdf/2106.03407","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W83290899","https://openalex.org/W1545185138","https://openalex.org/W1968411483","https://openalex.org/W1970071808","https://openalex.org/W1971086298","https://openalex.org/W1987474585","https://openalex.org/W2030174522","https://openalex.org/W2046356179","https://openalex.org/W2049843736","https://openalex.org/W2055201760","https://openalex.org/W2081716160","https://openalex.org/W2092498346","https://openalex.org/W2095428110","https://openalex.org/W2097566786","https://openalex.org/W2115904688","https://openalex.org/W2128990851","https://openalex.org/W2138800545","https://openalex.org/W2141664020","https://openalex.org/W2292566889","https://openalex.org/W2342400483","https://openalex.org/W2563497056","https://openalex.org/W2587537338","https://openalex.org/W2792557859","https://openalex.org/W2952417580","https://openalex.org/W2968821825","https://openalex.org/W2981168246","https://openalex.org/W6605295560","https://openalex.org/W6779375720","https://openalex.org/W6941249815"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3],"propose":[4,126],"a":[5,60,110,127,195,227],"novel":[6],"sampling-based":[7,128],"planner":[8,129],"for":[9,176,179,188],"multi-goal":[10],"path":[11,77],"planning":[12],"among":[13],"obstacles,":[14],"where":[15],"the":[16,26,33,40,54,71,84,103,136,152,164,173,201,221],"objective":[17],"is":[18,35,114],"to":[19,50,66,82,116,156,162,203],"visit":[20],"predefined":[21],"target":[22],"locations":[23],"while":[24],"minimizing":[25],"travel":[27],"costs.":[28],"The":[29],"order":[30],"of":[31,138,186],"visiting":[32],"targets":[34,153],"often":[36],"achieved":[37],"by":[38,76],"solving":[39],"Traveling":[41],"Salesman":[42],"Problem":[43],"(TSP)":[44],"or":[45,91],"its":[46],"variants.":[47],"TSP":[48,108,223],"requires":[49,65],"define":[51,83,96],"costs":[52,85],"between":[53,70],"individual":[55],"targets,":[56],"which":[57,171],"\u2014":[58,64],"in":[59,102,194],"map":[61],"with":[62,159,199],"obstacles":[63],"compute":[67],"mutual":[68],"paths":[69,97,120,215],"targets.":[72],"These":[73],"paths,":[74],"found":[75],"planning,":[78],"are":[79,99,192],"used":[80,101],"both":[81],"(e.g.,":[86],"based":[87],"on":[88],"their":[89,205],"length":[90],"time-to-traverse)":[92],"and":[93,149,154,219],"also":[94,225],"they":[95],"that":[98,134,210],"later":[100],"final":[104,222],"solution.":[105],"To":[106],"enable":[107],"finding":[109,139],"good-quality":[111],"solution,":[112],"it":[113],"necessary":[115],"find":[117,157],"these":[118],"target-to-target":[119,214],"as":[121,123],"short":[122],"possible.":[124],"We":[125],"called":[130],"Space-Filling":[131],"Forest":[132],"(SFF*)":[133],"solves":[135],"part":[137],"collision-free":[140],"paths.":[141,165],"SFF*":[142,181,211],"uses":[143,172],"multiple":[144],"trees":[145,161,191],"(forest)":[146],"constructed":[147],"gradually":[148],"simultaneously":[150],"from":[151],"attempts":[155],"connections":[158],"other":[160],"form":[163],"Unlike":[166],"Rapidly-exploring":[167],"Random":[168],"Tree":[169],"(RRT),":[170],"nearest-neighbor":[174],"rule":[175],"selecting":[177],"nodes":[178,187,202],"expansion,":[180],"maintains":[182],"an":[183],"explicit":[184],"list":[185],"expansion.":[189],"Individual":[190],"grown":[193],"RRT*":[196],"manner,":[197],"i.e.,":[198],"rewiring":[200],"minimize":[204],"cost.":[206,229],"Computational":[207],"results":[208],"show":[209],"provides":[212],"shorter":[213],"than":[216],"existing":[217],"approaches,":[218],"consequently,":[220],"solutions":[224],"have":[226],"lower":[228]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2021-04-13T00:00:00"}