{"id":"https://openalex.org/W4400232023","doi":"https://doi.org/10.1109/vnc61989.2024.10575968","title":"Poster: Adaptive Astar Algorithm for Calculation Time Reduction of Autonomous Vehicle's Pathfinding","display_name":"Poster: Adaptive Astar Algorithm for Calculation Time Reduction of Autonomous Vehicle's Pathfinding","publication_year":2024,"publication_date":"2024-05-29","ids":{"openalex":"https://openalex.org/W4400232023","doi":"https://doi.org/10.1109/vnc61989.2024.10575968"},"language":"en","primary_location":{"id":"doi:10.1109/vnc61989.2024.10575968","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/vnc61989.2024.10575968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Vehicular Networking Conference (VNC)","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/A5113481526","display_name":"Y.W. Jeon","orcid":null},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yeongwon Jeon","raw_affiliation_strings":["School of Electronic and Electrical Engineering, Kyungpook National University,Daegu,Republic of Korea"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Electrical Engineering, Kyungpook National University,Daegu,Republic of Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030304824","display_name":"Daejin Park","orcid":"https://orcid.org/0000-0002-5560-873X"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Daejin Park","raw_affiliation_strings":["School of Electronic and Electrical Engineering, Kyungpook National University,Daegu,Republic of Korea"],"affiliations":[{"raw_affiliation_string":"School of Electronic and Electrical Engineering, Kyungpook National University,Daegu,Republic of Korea","institution_ids":["https://openalex.org/I31419693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113481526"],"corresponding_institution_ids":["https://openalex.org/I31419693"],"apc_list":null,"apc_paid":null,"fwci":0.2624,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50304502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"253","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955999851226807,"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":0.9955999851226807,"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/T10805","display_name":"Vehicle Dynamics and Control Systems","score":0.9878000020980835,"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"}},{"id":"https://openalex.org/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.954800009727478,"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/pathfinding","display_name":"Pathfinding","score":0.8865474462509155},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7487491965293884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6260645389556885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4735873341560364},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.3872462511062622},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3235047161579132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18095755577087402},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0990670919418335},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.04922565817832947}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8865474462509155},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7487491965293884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6260645389556885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4735873341560364},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3872462511062622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3235047161579132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18095755577087402},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0990670919418335},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.04922565817832947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vnc61989.2024.10575968","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/vnc61989.2024.10575968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Vehicular Networking Conference (VNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.7099999785423279}],"awards":[{"id":"https://openalex.org/G284294426","display_name":null,"funder_award_id":"2020M3H2A1078119","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W3005757019","https://openalex.org/W4391022044","https://openalex.org/W4391935169"],"related_works":["https://openalex.org/W2355768292","https://openalex.org/W2058170566","https://openalex.org/W2755342338","https://openalex.org/W2772917594","https://openalex.org/W2775347418","https://openalex.org/W2166024367","https://openalex.org/W3116076068","https://openalex.org/W2229312674","https://openalex.org/W2951359407","https://openalex.org/W2079911747"],"abstract_inverted_index":{"With":[0],"the":[1,26,39,50,76,79,134,144],"development":[2],"of":[3,45,78,97,128],"autonomous":[4,35,92],"driving,":[5],"multi":[6],"agent":[7],"pathfinding":[8,27,59,80],"is":[9,72,84,90,100,105],"necessary.":[10],"Because":[11],"a":[12,17,20],"little":[13],"delay":[14],"can":[15,52],"cause":[16,53],"collision":[18],"with":[19],"median":[21],"strip":[22],"or":[23,126],"other":[24],"vehicles,":[25],"process":[28],"must":[29,60,116],"be":[30,62,117],"fast":[31],"and":[32,55,114],"immediate.":[33],"Many":[34],"vehicle":[36],"companies":[37],"use":[38,87],"cloud":[40,51],"for":[41,91,119],"central":[42],"processing":[43],"because":[44,102],"complicated":[46],"calculations,":[47],"but":[48,82],"using":[49],"delays":[54],"disconnection.":[56],"So,":[57],"edge-level":[58],"also":[61],"executed":[63],"together.":[64],"The":[65],"A":[66,94,98,103,136],"*":[67,99,104,137],"algorithm":[68,107,138],"based":[69],"on":[70],"dijkstra":[71],"frequently":[73],"used":[74],"as":[75,88,122],"prototype":[77],"algorithm,":[81],"it":[83,89],"difficult":[85],"to":[86,146],"driving.":[93],"proper":[95],"transformation":[96],"essential":[101],"greedy":[106],"that":[108,139],"less":[109,124],"useful":[110],"in":[111],"MAPF":[112],"situation,":[113],"heuristics":[115],"modified":[118],"purposes":[120],"such":[121],"\u2018using":[123],"memory\u2019":[125],"\u2018reduction":[127],"calculation":[129,148],"time\u2019.":[130],"This":[131],"paper":[132],"presents":[133],"adaptive":[135],"explores":[140],"more":[141],"nodes":[142],"near":[143],"wall":[145],"reduce":[147],"time.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}