Synthesis of Petri net supervisors for FMS via redundant constraint elimination

• Bo Huang ^[1] ; MengChu Zhou ^[2] ; GongXuan Zhang ^[1]
  1. [1] Nanjing University of Science and Technology

     Nanjing University of Science and Technology

     China

     
  2. [2] New Jersey Institute of Technology

     New Jersey Institute of Technology

     City of Newark, Estados Unidos

     
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 61, 2015, págs. 156-163
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The Minimal number of Control Places Problem (MCPP), which is formulated to obtain optimal and structurally minimal supervisors, needs extensive computation. The current methods to reduce the computational burden have mainly focused on revision of the original formulation of MCPP. Instead, this paper presents methods to accelerate its solution by eliminating its redundant reachability constraints. The optimization problem scale required for supervisor synthesis is thus drastically reduced. First, a sufficient and necessary condition for a reachability constraint to be redundant is established in the form of an integer linear program (ILP), based on a newly proposed concept called feasible region of supervisors. Then, two kinds of redundancy elimination methods are proposed: an ILP one and a non-ILP one. Most of the redundant reachability constraints can be eliminated by our methods in a short time. The computational time to solve MCPP is greatly reduced after the elimination, especially for large-scale systems. The obtained supervisors are still optimal and structurally minimal. Finally, numerical tests are conducted to show the efficiency and effectiveness of the proposed methods.