{"id":"https://openalex.org/W2980929212","doi":"https://doi.org/10.1109/tsmc.2019.2945110","title":"Drivable Path Planning Using Hybrid Search Algorithm Based on E* and Bernstein\u2013B\u00e9zier Motion Primitives","display_name":"Drivable Path Planning Using Hybrid Search Algorithm Based on E* and Bernstein\u2013B\u00e9zier Motion Primitives","publication_year":2019,"publication_date":"2019-10-18","ids":{"openalex":"https://openalex.org/W2980929212","doi":"https://doi.org/10.1109/tsmc.2019.2945110","mag":"2980929212"},"language":"en","primary_location":{"id":"doi:10.1109/tsmc.2019.2945110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmc.2019.2945110","pdf_url":null,"source":{"id":"https://openalex.org/S4210209078","display_name":"IEEE Transactions on Systems Man and Cybernetics Systems","issn_l":"2168-2216","issn":["2168-2216","2168-2232"],"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 Transactions on Systems, Man, and Cybernetics: Systems","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/A5076144757","display_name":"Gregor Klan\u010dar","orcid":"https://orcid.org/0000-0002-1461-3321"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Gregor Klancar","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081774692","display_name":"Marija Seder","orcid":"https://orcid.org/0000-0002-1418-255X"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Marija Seder","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001278511","display_name":"Sa\u0161o Bla\u017ei\u010d","orcid":"https://orcid.org/0000-0002-9347-8534"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Saso Blazic","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040998302","display_name":"Igor \u0160krjanc","orcid":"https://orcid.org/0000-0002-0502-5376"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Igor Skrjanc","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001473761","display_name":"Ivan Petrovi\u0107","orcid":"https://orcid.org/0000-0001-9961-5627"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Ivan Petrovic","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5076144757"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":0.8175,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.77768821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"51","issue":"8","first_page":"4868","last_page":"4882"},"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9925000071525574,"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/any-angle-path-planning","display_name":"Any-angle path planning","score":0.735169529914856},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7096031308174133},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.6101946830749512},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.592374861240387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5450729131698608},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5437499284744263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5291486382484436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5091490149497986},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4946453273296356},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.47925615310668945},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4597286581993103},{"id":"https://openalex.org/keywords/b\u00e9zier-curve","display_name":"B\u00e9zier curve","score":0.41847318410873413},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41689029335975647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35484951734542847},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.26145851612091064},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25743550062179565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2527453899383545},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.12627249956130981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12178894877433777}],"concepts":[{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.735169529914856},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7096031308174133},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.6101946830749512},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.592374861240387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5450729131698608},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5437499284744263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5291486382484436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5091490149497986},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4946453273296356},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.47925615310668945},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4597286581993103},{"id":"https://openalex.org/C206423108","wikidata":"https://www.wikidata.org/wiki/Q214728","display_name":"B\u00e9zier curve","level":2,"score":0.41847318410873413},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41689029335975647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35484951734542847},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.26145851612091064},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25743550062179565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2527453899383545},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.12627249956130981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12178894877433777},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/tsmc.2019.2945110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsmc.2019.2945110","pdf_url":null,"source":{"id":"https://openalex.org/S4210209078","display_name":"IEEE Transactions on Systems Man and Cybernetics Systems","issn_l":"2168-2216","issn":["2168-2216","2168-2232"],"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 Transactions on Systems, Man, and Cybernetics: Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6899999976158142,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4100563467","display_name":null,"funder_award_id":"KK.01.1.1.01.0009","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G8436821565","display_name":null,"funder_award_id":"P2-0219","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"}],"funders":[{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"},{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W74092408","https://openalex.org/W101508493","https://openalex.org/W104748494","https://openalex.org/W178968090","https://openalex.org/W198732646","https://openalex.org/W1140243306","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1838947378","https://openalex.org/W1979426683","https://openalex.org/W1992157405","https://openalex.org/W1993450261","https://openalex.org/W1996183429","https://openalex.org/W1997880753","https://openalex.org/W1999244633","https://openalex.org/W2000359213","https://openalex.org/W2044666243","https://openalex.org/W2054113582","https://openalex.org/W2054585537","https://openalex.org/W2055207897","https://openalex.org/W2059435624","https://openalex.org/W2083191157","https://openalex.org/W2099144379","https://openalex.org/W2104705453","https://openalex.org/W2113029345","https://openalex.org/W2120370123","https://openalex.org/W2121002134","https://openalex.org/W2132990760","https://openalex.org/W2138403771","https://openalex.org/W2152679156","https://openalex.org/W2158285627","https://openalex.org/W2158970477","https://openalex.org/W2161076907","https://openalex.org/W2313274380","https://openalex.org/W2335799662","https://openalex.org/W2379858873","https://openalex.org/W2388591084","https://openalex.org/W2404694939","https://openalex.org/W2593272389","https://openalex.org/W2596152647","https://openalex.org/W2596795616","https://openalex.org/W2611243847","https://openalex.org/W2740783262","https://openalex.org/W2753733141","https://openalex.org/W2757731190","https://openalex.org/W2806731640","https://openalex.org/W4214854524","https://openalex.org/W4231458372","https://openalex.org/W4231761304","https://openalex.org/W4236251699","https://openalex.org/W4242811155","https://openalex.org/W4293682399","https://openalex.org/W6608150121","https://openalex.org/W6678073039","https://openalex.org/W6683620479"],"related_works":["https://openalex.org/W2946941768","https://openalex.org/W3046207687","https://openalex.org/W2995673330","https://openalex.org/W2315143898","https://openalex.org/W2116465486","https://openalex.org/W2277626332","https://openalex.org/W2948538490","https://openalex.org/W2903628194","https://openalex.org/W2129550502","https://openalex.org/W4396918647"],"abstract_inverted_index":{"This":[0],"article":[1],"proposes":[2],"a":[3,89,105,117,129,134,170,191],"hybrid":[4,156],"path-planning":[5],"algorithm,":[6,9],"the":[7,12,27,33,42,46,71,80,84,111,139,143,148,152,155,159,165,174,182,202],"HE*":[8,85,87,127,210],"which":[10,132,146,177,195],"combines":[11],"discrete":[13],"grid-based":[14],"E*":[15,140],"search":[16,58,141,157,166],"and":[17,32,63,68,78,91,124,150],"continuous":[18],"Bernstein-B\u00e9zier":[19],"(BB)":[20],"motion":[21],"primitives.":[22],"Several":[23,66],"researchers":[24],"have":[25],"addressed":[26],"smooth":[28,92],"path":[29,36,93,112,204],"planning":[30,37],"problem":[31],"sample-based":[34],"integrated":[35],"techniques.":[38],"We":[39],"believe":[40],"that":[41,94,212],"main":[43,81],"benefits":[44],"of":[45,83,108,154,172,176,209],"proposed":[47],"approach":[48],"are:":[49],"directly":[50],"drivable":[51,115],"path,":[52],"no":[53],"additional":[54,122],"post-optimization":[55,123],"tasks,":[56],"reduced":[57],"branching,":[59],"low":[60],"computational":[61],"complexity,":[62],"completeness":[64],"guarantee.":[65],"examples":[67],"comparisons":[69],"with":[70,104],"state-of-the-art":[72],"planners":[73],"are":[74],"provided":[75],"to":[76,97,181],"illustrate":[77],"evaluate":[79],"advantages":[82],"algorithm.":[86],"yields":[88],"collision-safe":[90],"is":[95,113,128,167,186,211],"close":[96],"spatially":[98],"optimal":[99],"(the":[100],"Euclidean":[101],"shortest":[102],"path)":[103],"guaranteed":[106,187],"continuity":[107],"curvature.":[109],"Therefore,":[110],"easily":[114],"for":[116,201],"wheeled":[118],"robot":[119],"without":[120],"any":[121],"smoothing":[125],"required.":[126],"two-stage":[130],"algorithm":[131],"uses":[133],"direction-guiding":[135],"heuristics":[136],"computed":[137],"by":[138,169,188],"in":[142,158],"first":[144],"stage,":[145],"improves":[147],"quality":[149],"reduces":[151],"complexity":[153],"second":[160],"stage.":[161],"In":[162],"each":[163],"iteration,":[164],"expanded":[168],"set":[171],"BBs,":[173],"parameters":[175],"adapt":[178],"continuously":[179],"according":[180],"guiding":[183],"heuristics.":[184],"Completeness":[185],"relying":[189],"on":[190],"complete":[192],"node":[193],"mechanism,":[194],"also":[196],"provides":[197],"an":[198],"upper":[199],"bound":[200],"calculated":[203],"cost.":[205],"A":[206],"remarkable":[207],"feature":[208],"it":[213],"produces":[214],"good":[215],"results":[216],"even":[217],"at":[218],"coarse":[219],"resolutions.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}