{"id":"https://openalex.org/W2557100306","doi":"https://doi.org/10.1109/isocc.2011.6138655","title":"Path search engine for fast optimal path search using efficient hardware architecture","display_name":"Path search engine for fast optimal path search using efficient hardware architecture","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2557100306","doi":"https://doi.org/10.1109/isocc.2011.6138655","mag":"2557100306"},"language":"en","primary_location":{"id":"doi:10.1109/isocc.2011.6138655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isocc.2011.6138655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International SoC Design Conference","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/A5108630780","display_name":"Inhyuk Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Inhyuk Choi","raw_affiliation_strings":["Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","institution_ids":["https://openalex.org/I193775966"]},{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110046812","display_name":"Taewoo Han","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Taewoo Han","raw_affiliation_strings":["Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","institution_ids":["https://openalex.org/I193775966"]},{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006058955","display_name":"Ilwoong Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ilwoong Kim","raw_affiliation_strings":["Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","institution_ids":["https://openalex.org/I193775966"]},{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068528309","display_name":"Sungho Kang","orcid":"https://orcid.org/0000-0002-7093-2095"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sungho Kang","raw_affiliation_strings":["Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Electronic Engineering, Yonsei University, Seoul, Korea","institution_ids":["https://openalex.org/I193775966"]},{"raw_affiliation_string":"Department of Electrical & Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108630780"],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.34090722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"47","issue":null,"first_page":"96","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958999752998352,"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.9958999752998352,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9950000047683716,"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/path","display_name":"Path (computing)","score":0.7705554962158203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6765881776809692},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.6184816360473633},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.5108051300048828},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4825019836425781},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.47345608472824097},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.44396623969078064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3444628417491913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3065171241760254},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.29865336418151855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16607096791267395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15322521328926086},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.11318841576576233},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05958113074302673}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7705554962158203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6765881776809692},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.6184816360473633},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.5108051300048828},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4825019836425781},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.47345608472824097},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.44396623969078064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3444628417491913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3065171241760254},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.29865336418151855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16607096791267395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15322521328926086},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.11318841576576233},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05958113074302673},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isocc.2011.6138655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isocc.2011.6138655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International SoC Design Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5400000214576721,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1977336816","https://openalex.org/W2107291568","https://openalex.org/W2120227723","https://openalex.org/W2124616857","https://openalex.org/W2166037317","https://openalex.org/W2168414938","https://openalex.org/W2555032888","https://openalex.org/W6676469674"],"related_works":["https://openalex.org/W4386269615","https://openalex.org/W4390091683","https://openalex.org/W1994919150","https://openalex.org/W58921990","https://openalex.org/W2204575588","https://openalex.org/W2081821176","https://openalex.org/W3084994579","https://openalex.org/W3106196307","https://openalex.org/W4320350517","https://openalex.org/W2998661990"],"abstract_inverted_index":{"Recently,":[0],"the":[1,27,47,53,81,103,116,121,127],"optimal":[2,83,118],"path":[3,28,77,84,94,104,112,119,129],"search":[4,29,49,66,78,95,105,113,122,130],"based":[5],"on":[6],"real-time":[7,32],"traffic":[8,33],"information":[9],"is":[10,24,38,59,100,137],"becoming":[11],"more":[12],"important":[13],"in":[14,30,70,102,131],"car":[15,43,141],"navigation":[16,44],"industries.":[17],"The":[18,111],"preference-based":[19],"Ant":[20],"Colony":[21],"Optimization":[22],"algorithm":[23,37],"suitable":[25],"for":[26,80,140],"a":[31,76,132],"circumstance.":[34],"However,":[35],"this":[36,71],"not":[39],"applicable":[40],"to":[41,46,62,92,107,126],"current":[42],"due":[45],"slow":[48],"time":[50,123],"caused":[51],"by":[52],"complex":[54],"calculations.":[55],"Likewise,":[56],"sub-optimal":[57,109],"problem":[58],"occurred":[60],"according":[61],"circumstances":[63],"of":[64],"probability-based":[65],"and":[67,89,120],"parameter":[68],"settings":[69],"algorithm.":[72,96],"This":[73],"paper":[74],"presents":[75],"engine":[79,106,114],"fast":[82],"search,":[85],"using":[86],"simplified":[87],"calculation":[88],"parallel":[90],"architectures":[91],"apply":[93],"Also,":[97],"A*":[98],"architecture":[99],"added":[101],"supplement":[108],"problem.":[110],"obtains":[115],"accurate":[117],"improvement":[124],"compared":[125],"software-based":[128],"general":[133],"purpose":[134],"processor":[135],"that":[136],"typically":[138],"used":[139],"navigation.":[142]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-08T06:01:36.053099","created_date":"2025-10-10T00:00:00"}