{"id":"https://openalex.org/W4386737223","doi":"https://doi.org/10.1109/lra.2023.3315539","title":"CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments","display_name":"CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments","publication_year":2023,"publication_date":"2023-09-14","ids":{"openalex":"https://openalex.org/W4386737223","doi":"https://doi.org/10.1109/lra.2023.3315539"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2023.3315539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3315539","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/A5076889901","display_name":"Matej Novosad","orcid":"https://orcid.org/0009-0007-3782-693X"},"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":"Matej Novosad","raw_affiliation_strings":["Multi-robot Systems Group, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Multi-robot Systems Group, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045281591","display_name":"Robert P\u011bni\u010dka","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":["Multi-robot Systems Group, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Multi-robot Systems Group, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083101752","display_name":"Vojt\u011bch Von\u00e1sek","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":["Multi-robot Systems Group, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Multi-robot Systems Group, 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":["https://openalex.org/A5076889901"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":2.2813,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.90296559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"8","issue":"11","first_page":"7336","last_page":"7343"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9796000123023987,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6876351237297058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6843175888061523},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6756548881530762},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6559494733810425},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5528978109359741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5195949077606201},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5128050446510315},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3957062363624573},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3854609727859497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33826369047164917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1714945137500763},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.15243801474571228},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.10960671305656433}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6876351237297058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6843175888061523},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6756548881530762},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6559494733810425},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5528978109359741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5195949077606201},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5128050446510315},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3957062363624573},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3854609727859497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33826369047164917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1714945137500763},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.15243801474571228},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10960671305656433},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2023.3315539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3315539","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":[{"score":0.7599999904632568,"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":28,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1483286533","https://openalex.org/W1971086298","https://openalex.org/W1992787855","https://openalex.org/W2024924397","https://openalex.org/W2045726379","https://openalex.org/W2085917651","https://openalex.org/W2117828438","https://openalex.org/W2128990851","https://openalex.org/W2142963440","https://openalex.org/W2161473822","https://openalex.org/W2169528473","https://openalex.org/W2173849134","https://openalex.org/W2549200707","https://openalex.org/W2563524432","https://openalex.org/W2738024282","https://openalex.org/W2964489245","https://openalex.org/W3003664035","https://openalex.org/W3004930912","https://openalex.org/W3022776424","https://openalex.org/W3082616782","https://openalex.org/W3159537771","https://openalex.org/W4200193636","https://openalex.org/W4213454489","https://openalex.org/W4224914563","https://openalex.org/W4312769317","https://openalex.org/W4315472272","https://openalex.org/W6697205691"],"related_works":["https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2126380264","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583"],"abstract_inverted_index":{"In":[0],"this":[1,160],"letter,":[2],"we":[3,162],"propose":[4,163],"a":[5,33,57,62,93,114,127,145,168,179],"new":[6],"method":[7,226],"called":[8,90],"Clustering":[9],"Topological":[10],"PRM":[11],"(CTopPRM)":[12],"for":[13,46,96,101,130],"finding":[14,102,208],"multiple":[15,103,110,131],"topologically":[16,186],"distinct":[17,25,104,154,187,210],"paths":[18,66,132,155,188,211],"in":[19,38,83,156,190,215],"3D":[20],"cluttered":[21],"environments.":[22,158],"Finding":[23],"such":[24,126],"paths,":[26],"e.g.,":[27],"going":[28],"around":[29],"an":[30,173,230],"obstacle":[31],"from":[32],"different":[34],"side,":[35],"is":[36,44,92,133,227],"useful":[37],"many":[39],"applications.":[40],"Among":[41],"others,":[42],"it":[43],"necessary":[45],"optimization-based":[47],"trajectory":[48],"planners":[49],"where":[50],"found":[51],"trajectories":[52],"are":[53],"restricted":[54],"to":[55,71,118,151,198],"only":[56,144],"single":[58],"topological":[59],"class":[60],"of":[61,81,122,140,185,207,224],"given":[63],"path.":[64],"Distinct":[65],"can":[67],"also":[68,100],"be":[69],"used":[70],"guide":[72],"sampling-based":[73],"motion":[74],"planning":[75,82,98],"and":[76,99],"thus":[77],"increase":[78],"the":[79,120,123,138,164,191,199,202,205],"effectiveness":[80],"environments":[84,108],"with":[85,109],"narrow":[86,111],"passages.":[87],"Graph-based":[88],"representation":[89,95],"roadmap":[91,117,129,147,181],"common":[94],"path":[97],"paths.":[105],"However,":[106],"challenging":[107,157],"passages":[112],"require":[113],"densely":[115],"sampled":[116,175],"capture":[119],"connectivity":[121],"environment.":[124],"Searching":[125],"dense":[128,176,192],"computationally":[134],"too":[135],"expensive.":[136],"Therefore,":[137],"majority":[139],"existing":[141,200],"methods":[142,201],"construct":[143],"sparse":[146,169],"which,":[148],"however,":[149],"struggles":[150],"find":[152],"all":[153,209],"To":[159],"end,":[161],"CTopPRM":[165,203],"which":[166],"creates":[167],"graph":[170],"by":[171,212],"clustering":[172],"initially":[174],"roadmap.":[177,193],"Such":[178],"reduced":[180],"allows":[182],"fast":[183],"identification":[184],"captured":[189],"We":[194],"show,":[195],"that":[196],"compared":[197],"improves":[204],"probability":[206],"almost":[213],"20%":[214],"tested":[216],"environments,":[217],"during":[218],"same":[219],"run-time.":[220],"The":[221],"source":[222],"code":[223],"our":[225],"released":[228],"as":[229],"open-source":[231],"package.":[232]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":5}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2023-09-15T00:00:00"}