Not checkedNot checked for notices yet.
Estimation of Least-Cost Planning Sequence for Labeled Petri Nets
ZHOU Guangrui, XU Shulin, GUO Yiyun, LU Faming, YUE Hao
Jisuanji kexue yu tansuo · 2021
doi:10.3778/j.issn.1673-9418.2011035 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
To solve the least-cost planning sequence problem of a manufacturing system which is modeled by labeled Petri nets, an algorithm based on backtracking method is proposed. Given a labeled Petri net with its structure and an initial marking, the searching stages are divided into parts according to the given labeled sequence. In each stage, the transition with the minimal cost fires at first. With the observation of all the labels following this rule, the sum of the costs of transitions in the firing sequence is the minimum total cost. The least-cost planning sequence and the corresponding total cost are stored. The proposed method traverses the solution space tree according to the depth-first strategy. By taking the current minimum total cost as the constraint condition, the markings and the sequence of transitions that do not need to be searched can be eliminated in other paths. Therefore, the searching space is reduced. An illustrative example shows the feasibility of the method. Compared with the execution of dynamic programming method, the proposed method needs a smaller amount of calculation and achieves higher work efficiency.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.