Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation

He, Zuoli; He, Zhou; Giua, Alessandro

doi:10.1109/tcst.2016.2613967

Cited by 19 publications

(6 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can transform the time constraint on the trajectory (16) into a set of linear constraints by the following proposition.…”

Section: Transformation Of Logic Constraint Under Considered Path Reqmentioning

confidence: 99%

“…[3][4][5][6][7][8] An AGV system can be regarded as a discrete event system (DES) where the environment of the system is divided into several regions (or zones), and the vehicle movement from one region to another can be regarded as a discrete event. [9][10][11][12] Petri nets (PNs) are a graphbased mathematical tool and are widely applied for modeling, [13][14][15][16][17][18] control, [19][20][21][22][23][24][25][26][27][28][29] and scheduling [30][31][32][33] of DES, including AGV systems, manufacturing systems, and transportation systems. By assuming that some regions have a limited capacity, a deadlock prevention strategy is developed for robot planning in order to avoid collisions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Path planning for automated guided vehicle systems with time constraints using timed Petri nets

Dong

Ren

et al. 2020

Measurement and Control

Self Cite

View full text Add to dashboard Cite

Automated guided vehicles (AGVs) are extensively used in many applications such as intelligent transportation, logistics, and industrial factories. In this paper, we address the path planning problem for an AGV system (i.e. a team of identical AGVs) with logic and time constraints using Petri nets. We propose a method to model an AGV system and its static environment by timed Petri nets. Combining the structural characteristics of Petri nets and integer linear programming technique, a path planning method is developed to ensure that all task regions are visited by AGVs in time and forbidden regions are always avoided. Finally, simulation studies are presented to show the effectiveness of the proposed path planning methodology.

show abstract

“…We can transform the time constraint on the trajectory (16) into a set of linear constraints by the following proposition.…”

Section: Transformation Of Logic Constraint Under Considered Path Reqmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Path planning for automated guided vehicle systems with time constraints using timed Petri nets

Dong

Ren

et al. 2020

Measurement and Control

Self Cite

View full text Add to dashboard Cite

show abstract

“…The AMS can be regarded as a resource allocation system, and the supervisory controller is responsible for supervising the resource allocation in the control system [1][2][3][4]. The trajectories of such systems in space and time are discrete, so it is able to be extracted as a discrete-event system (DES) before investigation [5][6][7][8][9][10][11][12][13]. In the 1980s, Ramadge and Wonham put forward SCT in their research, which is also regarded as the Ramadge-Wonham (RW) framework [14][15][16] that offers a mathematical method with the intention of analyzing and controlling DES.…”

Section: Introductionmentioning

confidence: 99%

Supervisory Control of Automated Manufacturing Systems Based on State-Tree Structures

Zhao

2022

Symmetry

Self Cite

View full text Add to dashboard Cite

The automated manufacturing systems (AMS) can be regarded as a resource allocation system which can be abstracted as discrete event systems (DES) for analysis. Once an effective computational method is put forward to the DES, the corresponding real AMS, connected by networks or sensors, can be indirectly controlled. Supervisory control theory (SCT) of DES is developed with the intention of discovering the maximally permissible supervisor of AMS. The state-tree structure (STS) is an extension of SCT, whose application is mainly to solve the SCT state explosion of complicated AMS. The nonblocking supervisory control is investigated on the foundation of predicates in STS, of which the synthesis focuses on the states of the system but ignores the transition between events. In order to effectively solve the above problems, this paper puts forward a novel method based on state feedback control (SFBC) in the STS framework, by which the relation among events is discussed. First, following the definition of the SFBC for predicates, the algorithms to compute the SFBC under reachability, coreachability, and weak controllability are introduced. Second, it is proved that the nonblocking SFBC obtained by the proposed algorithm is equivalent to the one by computing predicates first, which ensures the satisfactory controllers for the supervisory control problems. To demonstrate the contribution of the proposed approach, which is designed considering the symmetry of the system behavior between the real system and its STS model, three examples are illustrated.

show abstract

“…Generally, two analysis techniques are considered to deal with deadlock problems in Petri nets: Structural analysis [1], [17], [19], [49] and reachability graph analysis [30], [38], [41], [51], [52]. Structural analysis usually exploits special structural objects of a Petri net, siphons, place invariants, and resource-transition circuits, for examples, since some substructures have a close relationship with deadlocks.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Deadlock Recovery Policy for Flexible Manufacturing Systems Modeled With Petri Nets

Yue

Chen

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper focuses on solving deadlock problems in flexible manufacturing systems modeled with Petri nets by adding a set of recovery transitions. Different from the traditional deadlock control policies that add control places to a net model, this paper employs transitions to recover all the deadlock markings to be legal ones. A live net system can be obtained with all reachable markings. First, according to reachability graph analysis, a set of recovery transitions is obtained for each deadlock marking to be recovered. Second, we present a vector intersection approach to compute a recovery transition to recover multiple deadlock markings. Then, an iterative method is developed to find a set of recovery transitions to recover all deadlock markings. At each iteration step, a recovery transition is found to recover more than one deadlock markings. This iterative method cannot obtain the minimal number of recovery transitions in theory, but it can usually lead to a minimal one supported by extensive experimental studies. Finally, several widely used examples are provided to demonstrate the presented approach. The experimental results show that the reported deadlock recovery technique is effective and efficient. INDEX TERMS Flexible manufacturing system, Petri net, deadlock, vector intersection.

show abstract

Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation

Cited by 19 publications

References 40 publications

Path planning for automated guided vehicle systems with time constraints using timed Petri nets

Path planning for automated guided vehicle systems with time constraints using timed Petri nets

Supervisory Control of Automated Manufacturing Systems Based on State-Tree Structures

An Efficient Deadlock Recovery Policy for Flexible Manufacturing Systems Modeled With Petri Nets

Contact Info

Product

Resources

About