An Improved Research on Algorithm of Finding out all Kinds of Cycle Deadlocks in AGVS Using Task-Resource Graph
Aiming to solve the problem of Iow emciency and inability of finding out all kinds of deadlock.an improved algorithm is proposed using graph theory.The method is as follows：firstly.according to the difierent positions and tasks of AGV in AGVS,AGVS was modelled using T-R graph.Secondly.the algorithm search out all kinds of cycle deadlock using graph theory in T-R graph at any time.Once having finished searching all T-R graphs,the algorithm find out all cycle deadlocks in AGVS.The improved algorithm can overcome the disadvantage of the previous：inability of finding out ail kinds of deadlocks.The use of control law.which are developed by the improved algorithm.is helpful to avoid new cycle deadlocks effectively.Simulating results coincide with theoretical analyse.Meanwhiie,all types of cycle deadlocks and non-cycle ones can be found in AGVS bv simply modify of the improved algorithm.
AGVS T-R Graph cycle deadlock
Liang Sun
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
1236-1239
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）