{"id":"https://openalex.org/W2002462870","doi":"https://doi.org/10.1109/icinfa.2014.6932742","title":"Improved hierarchical A-star algorithm for optimal parking path planning of the large parking lot","display_name":"Improved hierarchical A-star algorithm for optimal parking path planning of the large parking lot","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2002462870","doi":"https://doi.org/10.1109/icinfa.2014.6932742","mag":"2002462870"},"language":"en","primary_location":{"id":"doi:10.1109/icinfa.2014.6932742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2014.6932742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Information and Automation (ICIA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5040019000","display_name":"Liping Cheng","orcid":"https://orcid.org/0000-0002-1797-8705"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liping Cheng","raw_affiliation_strings":["Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, Taian, Shandong, China","Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, NO.223, Daizong Street, Taian, Shandong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, Taian, Shandong, China","institution_ids":["https://openalex.org/I80143920"]},{"raw_affiliation_string":"Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, NO.223, Daizong Street, Taian, Shandong, China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077529049","display_name":"Chuanxi Liu","orcid":"https://orcid.org/0000-0002-5519-1313"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chuanxi Liu","raw_affiliation_strings":["Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, Taian, Shandong, China","Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, NO.223, Daizong Street, Taian, Shandong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, Taian, Shandong, China","institution_ids":["https://openalex.org/I80143920"]},{"raw_affiliation_string":"Department of electrical and Mechanical Engineering, Shandong University of Science and Technology, NO.223, Daizong Street, Taian, Shandong, China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022104639","display_name":"Bo Yan","orcid":"https://orcid.org/0000-0002-1251-2674"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bo Yan","raw_affiliation_strings":["Traffic Road Safety (Beijing) Technology co., LTD, BeiJing, China","Traffic Road Safety (Beijing) Technology co., LTD, NO. 30, College Road, Haidian district, BeiJing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Traffic Road Safety (Beijing) Technology co., LTD, BeiJing, China","institution_ids":[]},{"raw_affiliation_string":"Traffic Road Safety (Beijing) Technology co., LTD, NO. 30, College Road, Haidian district, BeiJing, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"695","last_page":"698"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9941999912261963,"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/T11106","display_name":"Data Management and Algorithms","score":0.9778000116348267,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6771993041038513},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6431662440299988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638009250164032},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.6264313459396362},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.5551908016204834},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.5357875227928162},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5275806188583374},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.521390974521637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49407413601875305},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4792932868003845},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.47309139370918274},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4326789677143097},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.4205958843231201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1928173303604126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1545151174068451},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1356389820575714},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10541826486587524}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6771993041038513},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6431662440299988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638009250164032},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.6264313459396362},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.5551908016204834},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5357875227928162},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5275806188583374},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.521390974521637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49407413601875305},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4792932868003845},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.47309139370918274},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4326789677143097},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.4205958843231201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1928173303604126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1545151174068451},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1356389820575714},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10541826486587524},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icinfa.2014.6932742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2014.6932742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Information and Automation (ICIA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2067148637","https://openalex.org/W2363951904"],"related_works":["https://openalex.org/W2578319993","https://openalex.org/W2170980056","https://openalex.org/W2379804627","https://openalex.org/W2359532380","https://openalex.org/W3127221082","https://openalex.org/W2381419702","https://openalex.org/W2886722595","https://openalex.org/W2363342665","https://openalex.org/W2990531685","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Which":[0],"path":[1,5,43,134],"was":[2,75],"the":[3,15,23,53,59,70,77,99,103,106,117,121,125,131],"optimal":[4],"in":[6,41,80],"a":[7,37],"large":[8],"parking":[9,42,71],"guidance":[10,54],"system?":[11],"Obviously,":[12],"only":[13,21,48],"considering":[14,22],"shortest":[16,24],"distance":[17],"is":[18,26],"not":[19,31,47],"enough,":[20],"time":[25],"an":[27],"ideal":[28],"goal":[29],"but":[30,56],"easy":[32],"to":[33,98,110],"realize,":[34],"so":[35],"introduced":[36],"feasible":[38],"time-optimal":[39,101,133],"evaluation":[40,93],"planning.":[44],"It":[45],"can":[46,127],"simplify":[49],"hardware":[50],"design":[51,104],"of":[52,69,119],"system,":[55],"also":[57],"reduce":[58],"software":[60],"cost.":[61],"Mathematical":[62],"model":[63],"R":[64,81],"(P,":[65,82],"C,":[66,83],"D,":[67,84],"V)":[68,85],"lot":[72],"network":[73],"diagram":[74],"established,":[76],"all":[78],"nodes":[79],"were":[86,95],"divided":[87],"into":[88],"two":[89],"layers":[90],"and":[91,114],"different":[92,132,136],"functions":[94],"built.":[96],"According":[97],"improved":[100,107],"evaluation,":[102],"used":[105],"A-star":[108],"algorithm":[109,126],"increase":[111],"searching":[112],"efficiency":[113],"precision.":[115],"Finally,":[116],"result":[118],"running":[120],"program":[122],"shows":[123],"that":[124],"quickly":[128],"find":[129],"out":[130],"for":[135],"attribute":[137],"parameter.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}