{"id":"https://openalex.org/W4292257919","doi":"https://doi.org/10.1109/tase.2022.3193946","title":"Deadlock Avoidance in Closed Guide-Path Based MultiAGV Systems","display_name":"Deadlock Avoidance in Closed Guide-Path Based MultiAGV Systems","publication_year":2022,"publication_date":"2022-08-17","ids":{"openalex":"https://openalex.org/W4292257919","doi":"https://doi.org/10.1109/tase.2022.3193946"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3193946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3193946","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","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/A5056260374","display_name":"Daiyu He","orcid":"https://orcid.org/0000-0002-7137-5120"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Daiyu He","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100750387","display_name":"Bo Ouyang","orcid":"https://orcid.org/0000-0003-2378-981X"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Ouyang","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051780992","display_name":"Hongkai Fan","orcid":"https://orcid.org/0009-0003-7354-9360"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongkai Fan","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016151276","display_name":"Chenjia Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenjia Hu","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102834541","display_name":"Kailai Zhang","orcid":"https://orcid.org/0000-0002-9062-0865"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kailai Zhang","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102757940","display_name":"Zhi Yan","orcid":"https://orcid.org/0000-0003-3849-2496"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi Yan","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5056260374"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":null,"apc_paid":null,"fwci":1.0562,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79621818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"2088","last_page":"2098"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962000250816345,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.6079764366149902},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5678415894508362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5399200320243835},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.523749589920044},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5092793703079224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5092557668685913},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.5055413246154785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37730875611305237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28720033168792725},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.27599024772644043},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12806054949760437},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08629626035690308}],"concepts":[{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.6079764366149902},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5678415894508362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5399200320243835},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.523749589920044},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5092793703079224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5092557668685913},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.5055413246154785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37730875611305237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28720033168792725},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27599024772644043},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12806054949760437},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08629626035690308}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2022.3193946","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3193946","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1144827473","display_name":null,"funder_award_id":"2020YFB1712600","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G1805033422","display_name":null,"funder_award_id":"2021JJ30146","funder_id":"https://openalex.org/F4320322843","funder_display_name":"Natural Science Foundation of\u00a0Hunan Province"}],"funders":[{"id":"https://openalex.org/F4320322843","display_name":"Natural Science Foundation of\u00a0Hunan Province","ror":null},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W567899822","https://openalex.org/W1655990431","https://openalex.org/W2011282943","https://openalex.org/W2037933704","https://openalex.org/W2038331462","https://openalex.org/W2040029476","https://openalex.org/W2041329792","https://openalex.org/W2082134540","https://openalex.org/W2098899007","https://openalex.org/W2103597368","https://openalex.org/W2108666666","https://openalex.org/W2137890200","https://openalex.org/W2144126367","https://openalex.org/W2150974097","https://openalex.org/W2152253733","https://openalex.org/W2155372793","https://openalex.org/W2160999345","https://openalex.org/W2765883527","https://openalex.org/W2890194976","https://openalex.org/W2891520517","https://openalex.org/W2897405579","https://openalex.org/W2968809557","https://openalex.org/W2998671458","https://openalex.org/W3004415749","https://openalex.org/W3013758117","https://openalex.org/W3097175827","https://openalex.org/W4253331343","https://openalex.org/W4283733393"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W4226119751","https://openalex.org/W2001478969","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W4383684213","https://openalex.org/W2045082154","https://openalex.org/W2166954426"],"abstract_inverted_index":{"Automated":[0],"guided":[1],"vehicle":[2],"(AGV)":[3],"is":[4,23,72,80,97,131,149,167,179,207,226,233,280,287,311,341,352],"widely":[5],"used":[6],"in":[7,40,68,74,155,175,211,229,238,248,282,332],"transportation":[8],"and":[9,59,86,170,173,185,252,258,285,294,308,349],"distribution":[10],"of":[11,16,116,128,152,190,323,339,355],"materials.":[12],"In":[13],"the":[14,54,91,94,104,108,111,114,129,150,153,156,161,188,194,219,291,315,324,337,353],"development":[15],"multi-AGV":[17,214],"systems,":[18,231],"how":[19],"to":[20,49,99,120,133,204,237,262,264,346],"handle":[21],"deadlocks":[22],"a":[24,122,198,208],"core":[25,209],"issue.":[26],"Most":[27],"existing":[28],"researches":[29],"focus":[30],"on":[31,160,314],"open":[32],"systems.":[33,42,177,215,266],"Thus":[34],"those":[35],"results":[36,55,189],"are":[37,56,243,260],"not":[38,57,342],"applicable":[39],"real-world":[41],"A":[43],"few":[44],"works":[45],"have":[46],"paid":[47,234],"attention":[48,236],"closed":[50,69,230],"systems":[51],"recently,":[52],"but":[53],"flexible":[58,289],"generic":[60],"enough.":[61],"Therefore,":[62],"an":[63,83,87,163,271,298],"improved":[64,272],"deadlock":[65,217,241,273,316],"avoidance":[66,274,317],"algorithm":[67,79,112,130,184,196,275,293],"guide-path":[70,95,157,212],"system":[71,221,326],"proposed":[73,78,195,281],"this":[75,269,283,333],"paper.":[76],"The":[77,125],"divided":[81],"into":[82],"offline":[84,92],"stage":[85],"online":[88,105,109],"stage.":[89,106],"At":[90,107],"stage,":[93,110],"graph":[96],"processed":[98],"obtain":[100],"useful":[101],"information":[102],"for":[103],"assesses":[113],"safety":[115],"each":[117],"resource":[118,250],"allocation":[119],"ensure":[121],"deadlock-free":[123],"operation.":[124],"computational":[126,278],"complexity":[127,279],"shown":[132],"be":[134],"<inline-formula":[135,143],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[136,144,202],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[137,145],"<tex-math":[138,146],"notation=\"LaTeX\">$O(|E|)$":[139],"</tex-math></inline-formula>":[140,148],",":[141],"where":[142],"notation=\"LaTeX\">$E$":[147],"set":[151],"edges":[154],"graph.":[158],"Based":[159],"algorithm,":[162,318],"overall":[164,299,334],"control":[165,300,335],"strategy":[166],"also":[168,180],"developed,":[169],"then":[171],"implemented":[172],"tested":[174],"real":[176],"It":[178],"compared":[181],"with":[182,276,344],"Banker\u2019s":[183,292],"its":[186,295],"variants,":[187],"which":[191,232,319,351],"show":[192],"that":[193],"has":[197],"better":[199],"performance.":[200],"<italic":[201],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Note":[203],"Practitioners</i>":[205],"\u2014Deadlock":[206],"issue":[210],"based":[213,313],"Once":[216],"occurs,":[218],"whole":[220],"will":[222],"collapse.":[223],"This":[224],"problem":[225],"more":[227,288],"serious":[228],"less":[235],"literature.":[239],"Current":[240],"solutions":[242],"either":[244],"too":[245],"restrictive,":[246],"resulting":[247],"inefficient":[249],"utilization":[251],"poor":[253],"flexibility,":[254],"or":[255],"computationally":[256],"intensive":[257],"thus":[259],"unable":[261],"scale":[263],"large":[265],"To":[267],"solve":[268],"problem,":[270],"polynomial":[277],"paper,":[284],"it":[286],"than":[290],"variants.":[296],"Furthermore,":[297],"framework":[301],"(i.e.,":[302],"including":[303],"task":[304],"assignment,":[305],"path":[306,340],"planning":[307],"real-time":[309],"scheduling)":[310],"developed":[312],"keeps":[320],"persistent":[321],"operation":[322],"considered":[325],"while":[327],"still":[328],"guaranteeing":[329],"deadlock-free.":[330],"However,":[331],"framework,":[336],"choice":[338],"optimized":[343],"respect":[345],"travel":[347],"distance":[348],"makespan,":[350],"direction":[354],"future":[356],"research.":[357]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}