{"id":"https://openalex.org/W2970911366","doi":"https://doi.org/10.1109/iccar.2019.8813752","title":"Guided Hybrid A-star Path Planning Algorithm for Valet Parking Applications","display_name":"Guided Hybrid A-star Path Planning Algorithm for Valet Parking Applications","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2970911366","doi":"https://doi.org/10.1109/iccar.2019.8813752","mag":"2970911366"},"language":"en","primary_location":{"id":"doi:10.1109/iccar.2019.8813752","doi":"https://doi.org/10.1109/iccar.2019.8813752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccar.2019.8813752","pdf_url":null,"source":{"id":"https://openalex.org/S7407088985","display_name":"International Conference on Control, Automation and Robotics (ICCAR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 5th International Conference on Control, Automation and Robotics (ICCAR)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5057076172","display_name":"Saeid Sedighi","orcid":"https://orcid.org/0000-0002-4105-4166","observed_orcids":["https://orcid.org/0000-0002-4105-4166"]},"institutions":[{"id":"https://openalex.org/I4210086863","display_name":"Panasonic (Germany)","ror":"https://ror.org/000en4h24","country_code":"DE","type":"company","lineage":["https://openalex.org/I1283155146","https://openalex.org/I4210086863"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Saeid Sedighi","raw_affiliation_strings":["Panasonic Automotive Systems Europe GmbH, Langen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Panasonic Automotive Systems Europe GmbH, Langen, Germany","institution_ids":["https://openalex.org/I4210086863"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025054344","display_name":"Duong-Van Nguyen","orcid":"https://orcid.org/0000-0002-5122-0543","observed_orcids":["https://orcid.org/0000-0002-5122-0543"]},"institutions":[{"id":"https://openalex.org/I4210086863","display_name":"Panasonic (Germany)","ror":"https://ror.org/000en4h24","country_code":"DE","type":"company","lineage":["https://openalex.org/I1283155146","https://openalex.org/I4210086863"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Duong-Van Nguyen","raw_affiliation_strings":["Panasonic Automotive Systems Europe GmbH, Langen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Panasonic Automotive Systems Europe GmbH, Langen, Germany","institution_ids":["https://openalex.org/I4210086863"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110635659","display_name":"Klaus-Dieter Kuhnert","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus-Dieter Kuhnert","raw_affiliation_strings":["University of Siegen, Siegen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Siegen, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.491,"has_fulltext":false,"cited_by_count":161,"citation_normalized_percentile":{"value":0.99659744,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"570","last_page":"575"},"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/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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.0,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.0,"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/path-planning","display_name":"path planning","score":0.7580000162124634},{"id":"https://openalex.org/keywords/valet-parking","display_name":"valet parking","score":0.9240000247955322},{"id":"https://openalex.org/keywords/nonholonomic-constraints","display_name":"nonholonomic constraints","score":0.9710000157356262},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6000000238418579},{"id":"https://openalex.org/keywords/cost-function","display_name":"cost function","score":0.6480000019073486},{"id":"https://openalex.org/keywords/waypoint-generation","display_name":"waypoint generation","score":0.5350000262260437},{"id":"https://openalex.org/keywords/autonomous-vehicles","display_name":"autonomous vehicles","score":0.7080000042915344},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.8619999885559082}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7718777656555176},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7666686773300171},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.6179465651512146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6135481595993042},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.603418231010437},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.600699245929718},{"id":"https://openalex.org/C2777964439","wikidata":"https://www.wikidata.org/wiki/Q5884201","display_name":"Holonomic","level":2,"score":0.5548866987228394},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5035969614982605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4917328655719757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4775574803352356},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45257705450057983},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.41274628043174744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.371145099401474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3661620318889618},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33360350131988525},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.23994925618171692},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20907750725746155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20146363973617554},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccar.2019.8813752","doi":"https://doi.org/10.1109/iccar.2019.8813752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccar.2019.8813752","pdf_url":null,"source":{"id":"https://openalex.org/S7407088985","display_name":"International Conference on Control, Automation and Robotics (ICCAR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 5th International Conference on Control, Automation and Robotics (ICCAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1969483458","https://openalex.org/W2149906774","https://openalex.org/W2203313098","https://openalex.org/W2346755986","https://openalex.org/W2588289902","https://openalex.org/W2611243847","https://openalex.org/W2942570534","https://openalex.org/W4251391716","https://openalex.org/W4300995080","https://openalex.org/W6687918259"],"related_works":["https://openalex.org/W2990250652","https://openalex.org/W7118004375","https://openalex.org/W4366310727","https://openalex.org/W4396918212","https://openalex.org/W4367365720","https://openalex.org/W4407691875","https://openalex.org/W4408827745","https://openalex.org/W4327813429","https://openalex.org/W2990514206","https://openalex.org/W4387148719"],"abstract_inverted_index":{"Throughout":[0],"the":[1,4,9,65,72,78,105,117,123,131,135,140,146],"last":[2],"decades,":[3],"Robotics":[5],"Community":[6],"has":[7,151],"influenced":[8],"Autonomous":[10],"Vehicles":[11],"field":[12],"in":[13,83,143,162],"multiple":[14],"different":[15],"areas":[16],"ranging":[17],"from":[18,50,98],"Scene":[19],"Understanding":[20],"and":[21,27,39,59,112,121,155],"Decision":[22],"Making":[23],"to":[24,52,76,108,129,138,145,157,159],"Vehicle":[25],"Control":[26],"Optimal":[28],"Path":[29],"Planning.":[30],"Existing":[31],"path":[32,46,82,126,142],"planning":[33,75],"algorithms":[34],"such":[35],"as":[36],"A-star,":[37],"Dijkstra":[38],"Graph-based":[40],"approaches,":[41],"although":[42],"providing":[43],"good":[44],"optimal":[45],"approximations,":[47],"are":[48],"suffering":[49],"high-runtimes":[51],"convergence.":[53],"This":[54],"paper":[55],"presents":[56],"an":[57,110],"innovative":[58],"computationally":[60],"efficient":[61],"approach":[62],"of":[63,94],"fusing":[64],"well-known":[66],"Hybrid":[67,118,136,166],"A-star":[68,119,137,167],"search":[69],"engine":[70],"with":[71],"Visibility":[73,106],"Diagram":[74,107],"find":[77],"shortest":[79,125],"possible":[80],"non-holonomic":[81,147],"a":[84],"hybrid":[85],"(continuous-discrete)":[86],"environment":[87],"for":[88,116,134],"valet":[89],"parking.":[90],"The":[91,149],"primary":[92],"novelty":[93],"our":[95],"method":[96,150],"stems":[97],"two":[99],"points:":[100],"at":[101],"first,":[102],"we":[103],"use":[104],"introduce":[109],"improved":[111],"application-aware":[113],"cost":[114],"function":[115],"algorithm,":[120],"then":[122],"derived":[124],"is":[127],"used":[128],"provide":[130],"correct":[132],"waypoints":[133],"plan":[139],"optimum":[141],"regard":[144],"constraints.":[148],"been":[152],"extensively":[153],"tested":[154],"proven":[156],"up":[158],"40%":[160],"(20%":[161],"average)":[163],"faster":[164],"than":[165],"algorithm.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":29},{"year":2024,"cited_by_count":38},{"year":2023,"cited_by_count":35},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-09-05T00:00:00"}