{"id":"https://openalex.org/W2981168246","doi":"https://doi.org/10.1109/etfa.2019.8869521","title":"Space-filling forest for multi-goal path planning","display_name":"Space-filling forest for multi-goal path planning","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2981168246","doi":"https://doi.org/10.1109/etfa.2019.8869521","mag":"2981168246"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2019.8869521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2019.8869521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","raw_type":"proceedings-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/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":true,"raw_author_name":"Vojtech Vonasek","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, 166 27 Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, 166 27 Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","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":["Faculty of Electrical Engineering, Czech Technical University in Prague, 166 27 Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, 166 27 Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083101752"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.6073,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.72775337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1587","last_page":"1590"},"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.9695000052452087,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9653000235557556,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.8102266788482666},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.7279574871063232},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6926084756851196},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6905676126480103},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6712254285812378},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6404426097869873},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6194393634796143},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.6174184679985046},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6016742587089539},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5890246629714966},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5233275890350342},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5215873122215271},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4924248158931732},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49054139852523804},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4362425208091736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3827367424964905},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33066409826278687},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2976968288421631},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25909873843193054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1766371726989746},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10969281196594238},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10803931951522827}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8102266788482666},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.7279574871063232},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6926084756851196},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6905676126480103},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6712254285812378},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6404426097869873},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6194393634796143},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.6174184679985046},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6016742587089539},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5890246629714966},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5233275890350342},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5215873122215271},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4924248158931732},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49054139852523804},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4362425208091736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3827367424964905},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33066409826278687},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2976968288421631},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25909873843193054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1766371726989746},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10969281196594238},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10803931951522827},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2019.8869521","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2019.8869521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1424654272","https://openalex.org/W1531225991","https://openalex.org/W1971086298","https://openalex.org/W2009945360","https://openalex.org/W2030174522","https://openalex.org/W2049843736","https://openalex.org/W2092498346","https://openalex.org/W2097096168","https://openalex.org/W2128990851","https://openalex.org/W2171266831","https://openalex.org/W2292566889","https://openalex.org/W2323709497","https://openalex.org/W2342400483","https://openalex.org/W2559677112","https://openalex.org/W2611243847","https://openalex.org/W2916914990","https://openalex.org/W6605295560","https://openalex.org/W6674408180"],"related_works":["https://openalex.org/W2982486675","https://openalex.org/W2124945447","https://openalex.org/W2891479590","https://openalex.org/W4200312499","https://openalex.org/W3137074541","https://openalex.org/W1660309994","https://openalex.org/W2940127232","https://openalex.org/W4366823992","https://openalex.org/W4282823369","https://openalex.org/W2996899864"],"abstract_inverted_index":{"In":[0,132],"multi-goal":[1,141,206],"path":[2,142,207],"planning,":[3],"the":[4,25,28,49,53,57,96,107,124,127,151,171,177,205],"task":[5],"is":[6,59,111,184,202],"to":[7,11,78,91,98],"find":[8,79],"a":[9,13,112,137],"sequence":[10],"visit":[12],"set":[14],"of":[15,24,36,102,126,179,193,197,214],"target":[16],"locations":[17],"in":[18,61,95,106,123,176,204,209],"an":[19,34],"environment.":[20],"The":[21,195],"combinatorial":[22],"part":[23],"problem":[26],"(finding":[27],"sequence)":[29],"can":[30,75,84,118],"be":[31,76,85],"solved":[32],"as":[33,88,188],"instance":[35],"Traveling":[37],"Salesman":[38],"Problem,":[39],"which":[40],"requires":[41],"knowledge":[42],"about":[43],"collision-free":[44,54,156],"paths":[45,55,121],"(and":[46],"distances)":[47],"between":[48,56],"individual":[50],"targets.":[51],"Finding":[52],"targets":[58,152,215],"essential":[60],"this":[62,133,198],"task.":[63],"Sampling-based":[64],"planners":[65],"like":[66],"Probabilistic":[67],"Roadmaps":[68],"(PRM)":[69],"and":[70,115,153,181,216],"Rapidly-exploring":[71],"Random":[72],"Tree":[73],"(RRT)":[74],"used":[77],"these":[80],"paths.":[81],"However,":[82],"PRM":[83],"computationally":[86],"demanding,":[87],"it":[89,189],"attempts":[90],"connect":[92],"each":[93,161],"node":[94],"roadmap":[97],"its":[99,182],"neighbors,":[100],"regardless":[101],"their":[103],"later":[104],"usage":[105],"solution.":[108],"Contrary,":[109],"RRT":[110],"tree-based":[113],"planner,":[114],"one":[116],"run":[117],"only":[119],"provide":[120],"starting":[122],"root":[125],"tree":[128],"(a":[129],"single":[130],"target).":[131],"paper,":[134],"we":[135],"propose":[136],"novel":[138],"planner":[139],"for":[140],"planning.":[143],"Multiple":[144],"trees":[145],"(forest)":[146],"are":[147],"constructed":[148],"simultaneously":[149],"from":[150],"expanded":[154],"by":[155],"configurations":[157],"until":[158],"they":[159],"touch":[160],"other":[162],"or":[163],"obstacles.":[164],"Each":[165],"tree,":[166],"therefore,":[167],"does":[168],"not":[169],"explore":[170],"whole":[172],"configuration":[173],"space":[174],"(as":[175],"case":[178],"RRT),":[180],"construction":[183],"faster":[185],"than":[186],"PRM,":[187],"uses":[190],"lower":[191],"number":[192],"edges.":[194],"efficiency":[196],"new":[199],"planning":[200,208],"approach":[201],"demonstrated":[203],"2D":[210],"environment":[211],"with":[212,217],"tens":[213],"narrow":[218],"passages.":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}