信息与控制2024，Vol.53Issue(3)：377-387,11.DOI:10.13976/j.cnki.xk.2024.3101
部分可观标签时间Petri网的最小代价变迁序列估计
Least-cost Transition Sequence Estimation in Partially Observable Labeled Time Petri Nets
摘要
Abstract
Aiming at the problem of planning sequences in automated manufacturing systems,this study proposes an approach to solve the least-cost transition sequence estimation problem in a partially observable labeled time Petri net(LTPN).In particular,the considered LTPN is bounded,where each transition has a nonnegative cost.Based on time-label sequences(TLS),we first introduce a graph called observed-modified state class graph(OSCG)that represents the partial state space of an LTPN system.Then,all transition sequences logically consistent with the observed TLS can be found in the OSCG.By exploiting the transition-related timing constraints in an OSCG,we propose a procedure for determining which logic-consistent transition sequences are timing consistent with the observed TLS.Then,we develop an algorithm for estimating the least-cost transition sequences.Finally,the effectiveness of the proposed method is verified using an experimental example.关键词
离散事件系统/Petri 网/变迁序列/状态类图Key words
discrete event system/Petri net/transition sequence/state class graph分类
信息技术与安全科学引用本文复制引用
李雅琼,黎良..部分可观标签时间Petri网的最小代价变迁序列估计[J].信息与控制,2024,53(3):377-387,11.基金项目
国家自然科学基金项目(62303359) （62303359）
湖北省自然科学基金项目(2021CFB036) （2021CFB036）
