{"id":"https://openalex.org/W4317815204","doi":"https://doi.org/10.1109/wsc57314.2022.10015233","title":"Deadlock Avoidance Dynamic Routing Algorithm for a Massive Bidirectional Automated Guided Vehicle System","display_name":"Deadlock Avoidance Dynamic Routing Algorithm for a Massive Bidirectional Automated Guided Vehicle System","publication_year":2022,"publication_date":"2022-12-11","ids":{"openalex":"https://openalex.org/W4317815204","doi":"https://doi.org/10.1109/wsc57314.2022.10015233"},"language":"en","primary_location":{"id":"doi:10.1109/wsc57314.2022.10015233","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc57314.2022.10015233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Winter Simulation Conference (WSC)","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/A5100732011","display_name":"Kang Min Kim","orcid":"https://orcid.org/0000-0002-0403-2224"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kang Min Kim","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020471049","display_name":"Chang Hyun Chung","orcid":"https://orcid.org/0009-0004-0052-4477"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chang Hyun Chung","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012203130","display_name":"Young Jae Jang","orcid":"https://orcid.org/0000-0002-2342-1444"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young Jae Jang","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology,Department of Industrial and Systems Engineering,Daejeon,Republic of Korea,34141","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.8287,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72595634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"10","issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9961000084877014,"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/T12288","display_name":"Optimization and Search Problems","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8235998153686523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7652834057807922},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6704812049865723},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.6650316715240479},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.647146463394165},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5140336751937866},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5081338882446289},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4952816069126129},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.45220139622688293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4253513813018799},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.41456738114356995},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3820815682411194},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.37169283628463745},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.29152363538742065},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.21233072876930237},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20847588777542114},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1795523464679718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10314467549324036}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8235998153686523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7652834057807922},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6704812049865723},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.6650316715240479},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.647146463394165},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5140336751937866},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5081338882446289},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4952816069126129},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.45220139622688293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4253513813018799},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.41456738114356995},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3820815682411194},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.37169283628463745},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.29152363538742065},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.21233072876930237},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20847588777542114},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1795523464679718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10314467549324036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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/wsc57314.2022.10015233","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc57314.2022.10015233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5181584425","display_name":null,"funder_award_id":"NRF-2021R1A2C3008172","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1487042568","https://openalex.org/W1989407213","https://openalex.org/W2025582715","https://openalex.org/W2098803517","https://openalex.org/W2100122996","https://openalex.org/W2103597368","https://openalex.org/W2105060405","https://openalex.org/W2133158797","https://openalex.org/W2140013028","https://openalex.org/W2739205239","https://openalex.org/W2775551125","https://openalex.org/W2791724942","https://openalex.org/W2889767718","https://openalex.org/W2895506337","https://openalex.org/W3011468419","https://openalex.org/W3021673619","https://openalex.org/W3039303163","https://openalex.org/W3125055412","https://openalex.org/W3132439079","https://openalex.org/W6680692481"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W4226119751","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W4383684213","https://openalex.org/W2045082154"],"abstract_inverted_index":{"In":[0],"a":[1,41],"bidirectional":[2],"automated":[3],"guided":[4],"vehicle":[5],"(AGV)":[6],"system,":[7],"it":[8],"is":[9,22,92],"essential":[10],"to":[11,14,16,79],"allocate":[12],"routes":[13],"AGVs":[15,29],"avoid":[17],"deadlocks.":[18],"However,":[19],"avoiding":[20],"deadlocks":[21],"more":[23,112],"challenging":[24],"in":[25],"dynamic":[26,46,70],"environments":[27],"where":[28],"are":[30],"continuously":[31],"assigned":[32],"tasks":[33],"and":[34,68,123],"thus":[35],"operate":[36],"simultaneously.":[37],"This":[38],"paper":[39],"proposes":[40],"deadlock":[42],"prevention":[43],"method":[44,50,91,107,128],"for":[45,118],"environments.":[47],"The":[48,121],"proposed":[49,90,106,127],"combines":[51],"the":[52,59,62,69,75,80,86,89,100,105,109,126],"active":[53],"path":[54,81],"reservation":[55,82],"method,":[56],"which":[57,73],"restricts":[58],"directions":[60],"of":[61,64,111,125],"paths":[63],"some":[65],"moving":[66],"AGVs,":[67],"Dijkstra":[71,87],"algorithm,":[72,88],"finds":[74],"shortest":[76],"route":[77,102],"according":[78],"status.":[83],"Apart":[84],"from":[85],"compatible":[93],"with":[94],"other":[95],"routing":[96],"algorithms,":[97],"such":[98],"as":[99],"Q-learning-based":[101],"algorithm;":[103],"therefore,":[104],"enables":[108],"development":[110],"efficient":[113],"transport":[114],"systems":[115],"that":[116],"account":[117],"AGV":[119],"congestion.":[120],"efficiency":[122],"scalability":[124],"were":[129],"verified":[130],"using":[131],"Applied":[132],"Materials":[133],"AutoMod":[134],"(version":[135],"14.0)":[136],"simulation":[137],"software.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}