Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets

摘要: Abstract In the context of automated manufacturing systems (AMSs) with unreliable resources, most existing robust deadlock controllers have high computational complexity or relatively low permissiveness. This work focuses on control problem AMSs a kind resources. Petri nets are used to model dynamic behaviors such failure-prone AMSs. First prevention controller is developed for large class under consideration. Such guarantees that system can process all types parts continuously through any one their routes, even if resources fails. Also, this proved be optimal, i.e., maximally permissive, during resource failure period. Then by using one-step look-ahead method, we establish polynomial-complexity avoidance policy (DAP) same permissiveness as obtained controller. That is, DAP not only has complexity, but also permissive