{"id":"https://openalex.org/W2024447493","doi":"https://doi.org/10.1080/10248070108903688","title":"A Path Planning Method for Road Networks Having Turn Prohibitions","display_name":"A Path Planning Method for Road Networks Having Turn Prohibitions","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2024447493","doi":"https://doi.org/10.1080/10248070108903688","mag":"2024447493"},"language":"en","primary_location":{"id":"doi:10.1080/10248070108903688","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248070108903688","pdf_url":null,"source":{"id":"https://openalex.org/S136111043","display_name":"ITS Journal - Intelligent Transportation Systems Journal","issn_l":"1024-8072","issn":["1024-8072","1027-751X","1563-5082"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITS Journal - Intelligent Transportation Systems Journal","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/A5075586816","display_name":"Tae Kyung Sung","orcid":"https://orcid.org/0000-0001-8610-6727"},"institutions":[{"id":"https://openalex.org/I196345858","display_name":"Chungnam National University","ror":"https://ror.org/0227as991","country_code":"KR","type":"education","lineage":["https://openalex.org/I196345858"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"T.K. SUNG","raw_affiliation_strings":["Department of Electrical Engineering , Chungnam National University ,","Department of Electrical Engineering, Chungnam National University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering , Chungnam National University ,","institution_ids":["https://openalex.org/I196345858"]},{"raw_affiliation_string":"Department of Electrical Engineering, Chungnam National University","institution_ids":["https://openalex.org/I196345858"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038898138","display_name":"Soon-Koo MYOUNG","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S.Y. MYOUNG","raw_affiliation_strings":["R&D Center, Navicom Co., Ltd. ,"],"affiliations":[{"raw_affiliation_string":"R&D Center, Navicom Co., Ltd. ,","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075586816"],"corresponding_institution_ids":["https://openalex.org/I196345858"],"apc_list":null,"apc_paid":null,"fwci":0.3031,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59642193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"2","first_page":"125","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.9932000041007996,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.6141266822814941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5945489406585693},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.582927942276001},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5551643967628479},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5422601699829102},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5289666056632996},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5133858919143677},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4778018593788147},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4768610894680023},{"id":"https://openalex.org/keywords/metropolitan-area","display_name":"Metropolitan area","score":0.4296555817127228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2844686508178711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2626912593841553},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25127774477005005},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21043828129768372},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14591732621192932},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14138218760490417},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.11251074075698853},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05981108546257019}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6141266822814941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5945489406585693},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.582927942276001},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5551643967628479},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5422601699829102},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5289666056632996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5133858919143677},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4778018593788147},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4768610894680023},{"id":"https://openalex.org/C158739034","wikidata":"https://www.wikidata.org/wiki/Q1907114","display_name":"Metropolitan area","level":2,"score":0.4296555817127228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2844686508178711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2626912593841553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25127774477005005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21043828129768372},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14591732621192932},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14138218760490417},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.11251074075698853},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05981108546257019},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10248070108903688","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10248070108903688","pdf_url":null,"source":{"id":"https://openalex.org/S136111043","display_name":"ITS Journal - Intelligent Transportation Systems Journal","issn_l":"1024-8072","issn":["1024-8072","1027-751X","1563-5082"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ITS Journal - Intelligent Transportation Systems Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W25746047","https://openalex.org/W1485547936","https://openalex.org/W2020147819","https://openalex.org/W2060484689","https://openalex.org/W2061632451","https://openalex.org/W2063317962","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2994190048"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2586992284","https://openalex.org/W2389896347","https://openalex.org/W3139139461","https://openalex.org/W2904203243","https://openalex.org/W2106119116","https://openalex.org/W2125569607","https://openalex.org/W2140766902"],"abstract_inverted_index":{"In":[0,78],"metropolitan":[1],"areas,":[2],"intersections":[3],"having":[4,30],"turn":[5,31],"prohibitions":[6],"are":[7,45,65,149],"often":[8],"found":[9],"and":[10,105,141],"should":[11],"be":[12],"taken":[13],"into":[14],"account":[15],"in":[16,39,68],"path":[17,24,84,92,156],"planning.":[18],"This":[19],"paper":[20],"presents":[21],"a":[22,82,89,129],"new":[23,90],"planning":[25,157],"method":[26],"for":[27,43,98],"road":[28,34,71,131],"networks":[29,72],"prohibitions.":[32],"A":[33,96,122],"network":[35,53],"model":[36,54],"is":[37,55,94,102,106],"proposed":[38,52,87,147],"which":[40],"alternative":[41,114],"routes":[42],"turn-prohibitions":[44],"prepared":[46],"using":[47],"U-turns":[48],"or":[49],"P-turns,":[50],"The":[51],"efficient":[56],"since":[57],"it":[58],"requires":[59],"no":[60],"additional":[61],"virtual":[62],"nodes":[63],"that":[64,117,136],"usually":[66],"used":[67],"the":[69,86,99,110,113,119,138,142,146,154],"conventional":[70,155],"to":[73,80,108,116],"represent":[74],"turns":[75],"at":[76],"intersections.":[77],"order":[79],"find":[81],"shortest":[83,91],"with":[85],"network,":[88],"algorithm":[93],"proposed.":[95],"knot":[97],"turn-prohibited":[100],"node":[101],"newly":[103],"defined":[104],"utilized":[107],"compare":[109],"cost":[111],"of":[112,118,124,145,153],"route":[115],"other":[120],"path.":[121],"number":[123],"experiments":[125],"were":[126],"performed":[127],"on":[128],"real":[130],"network.":[132],"Experimental":[133],"results":[134],"show":[135],"both":[137],"database":[139],"size":[140],"computation":[143],"time":[144],"scheme":[148],"less":[150],"than":[151],"half":[152],"method.":[158]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}