scholarly journals Computationally Improved Optimal Control Methodology for Linear Programming Problems of Flexible Manufacturing Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Yen-Liang Pan ◽  
Yi-Sheng Huang ◽  
Yi-Shun Weng ◽  
Weimin Wu ◽  
MuDer Jeng
Keyword(s):  
Linear Programming ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Computational Cost ◽  
Deadlock Prevention ◽  
Prevention Policy ◽  
Linear Programming Problems ◽  
Control Methodology ◽  
State Separation

Deadlock prevention policies are used to solve the deadlock problems of FMSs. It is well known that the theory of regions is the efficient method for obtaining optimal (i.e., maximally permissive) controllers. All legal and live maximal behaviors of Petri net models can be preserved by using marking/transition-separation instances (MTSIs) or event-state-separation-problem (ESSP) methods. However, they encountered great difficulties in solving all sets of inequalities that is an extremely time consuming problem. Moreover, the number of linear programming problems (LPPs) of legal markings is also exponential with net size when a plant net grows exponentially. This paper proposes a novel methodology to reduce the number of MTSIs/ESSPs and LPPs. In this paper, we used the well-known reduction approach Murata (1989) to simply the construct of system such that the problem of LPPs can then be reduced. Additionally, critical ones of crucial marking/transition-separation instances (COCMTSI) are developed and used in our deadlock prevention policy that allows designers to employ few MTSIs to deal with deadlocks. Experimental results indicate that the computational cost can be reduced. To our knowledge, this deadlock prevention policy is the most efficient policy to obtain maximal permissive behavior of Petri net models than past approaches.

Petri Net Channelized-Based Deadlock Prevention Policy for Flexible Manufacturing Systems

2011 ◽  
Vol 317-319 ◽  
pp. 552-555
Author(s):  
Yi Sheng Huang ◽  
Ter Chan Row
Keyword(s):  
Control System ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Original Model ◽  
Deadlock Prevention ◽  
Prevention Policy ◽  
Maximal Permissiveness

Petri nets are employed to model flexible manufacturing systems (FMSs). However, the system deadlocked are possible happened. The conventional deadlock prevention policies are always to forbid the system entering the deadlock by using the control places. To obtain a live system, some dead markings must be sacrificed in the traditional policies. Therefore, the original reachability states of the original model can not be conserved. However, this paper is able to maintain all the reachability states of the original net and guaranty the control system live. Under our control policy, all number of reachability states of the original net will be preserved. Finally, two examples are performed that can reach the maximal permissiveness for FMSs using Petri net models (PNMs).

A Channelized Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models

2011 ◽  
Vol 284-286 ◽  
pp. 1498-1501
Author(s):  
Yi Sheng Huang ◽  
Ter Chan Row
Keyword(s):  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Deadlock Avoidance ◽  
Deadlock Prevention ◽  
Deadlock Detection ◽  
Prevention Policy ◽  
Maximal Permissiveness

Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadlock zone will be channelized to live markings such that all the dead markings in reachability states will be conserved. Finally, an example is performed and can obtain the maximal permissiveness of a Petri net model. The other examples are all getting the same result. To our knowledge, this is the first work that employs the channelized method to prevent the deadlock problem for FMSs.

Deadlock Prevention for Automated Manufacturing Systems with Uncontrollable and Unobservable Transitions

2013 ◽  
pp. 367-387
Author(s):  
Meng Qin
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Deadlock Prevention ◽  
Sufficient Condition ◽  
Prevention Policy ◽  
Automated Manufacturing Systems ◽  
Partial Observability

Many deadlock prevention policies on the basis of Petri nets dealing with deadlock problems in flexible manufacturing systems exist. However, most of them do not consider uncontrollable and unobservable transitions. This chapter solves deadlock problems in Petri nets with uncontrollable and unobservable transitions. A sufficient condition is developed to decide whether an existing deadlock prevention policy is still applicable in a Petri net with uncontrollable and unobservable transitions, when the policy itself is developed under the assumption that all the transitions are controllable and observable. Moreover, the author develops a deadlock prevention policy to design liveness-enforcing supervisors for a class of Petri nets with partial observability and controllability of transitions. Furthermore, a sufficient condition to decide the existence of a monitor to enforce a liveness constraint is developed.

Solutions for Deadlocked Problem of FMSs Using Theory of Regions

2011 ◽  
Vol 314-316 ◽  
pp. 535-538
Author(s):  
Yen Liang Pan ◽  
Yi Sheng Huang
Keyword(s):  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Deadlock Prevention ◽  
Reachability Graph ◽  
Separation Problem ◽  
Prevention Method ◽  
Computational Difficulty ◽  
State Separation

Deadlock prevention problem is an important issue in essence for flexible manufacturing systems (FMS). Many works make efforts in the issue. Theory of regions is recognized as one of the powerful deadlock prevention method for obtaining maximally permissive controllers. All legal and live maximal behavior of Petri net models can be preserved by using marking/transition-separation instance (MTSI) or event-state-separation-problem (ESSP) methods. However, solving all sets of inequalities are an extremely time consuming problem since all MTSIs and ESSPs need to be considered in the reachability graph of a deadlock FMS. In our previous work, we propose crucial MTSI (CMTSI) method to improve computational difficulty successfully. In this work, we further enhance the computational efficiency of CMTSI by combining critical markings and CMTSI methods. Experimental results reveal that this approach is more practical than the conventional methods.

Sign in / Sign up

Export Citation Format

Share Document