首页|部分可观标签时间Petri网的最小代价变迁序列估计

部分可观标签时间Petri网的最小代价变迁序列估计

扫码查看
针对自动制造系统的计划序列问题,研究了一种部分可观标签时间Petri网的最小代价变迁序列估计方法.所考虑的标签时间Petri网是有界的,且每个变迁都有一个非负代价.首先,提出了一种基于时间标签序列(time-label sequence,TLS)的观测-修正状态类图(observed-modified state class graph,OSCG),其代表标签时间Petri网系统的部分状态空间.在OSCG中,搜索出所有与TLS逻辑一致的变迁序列.其次,通过利用OSCG中与逻辑一致的变迁序列相关的时间约束,提出了 一种基于线性规划的方法以判定与TLS时间一致的变迁序列,进而求出最小代价的变迁序列.最后,通过一个实例验证了本文所提方法的有效性.
Least-cost Transition Sequence Estimation in Partially Observable Labeled Time Petri Nets
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.

discrete event systemPetri nettransition sequencestate class graph

李雅琼、黎良

展开 >

武昌理工学院人工智能学院,湖北武汉 430223

武汉科技大学信息科学与工程学院,湖北武汉 430081

离散事件系统 Petri 变迁序列 状态类图

国家自然科学基金项目湖北省自然科学基金项目

623033592021CFB036

2024

信息与控制
中国自动化学会 中国科学院沈阳自动化研究所

信息与控制

CSTPCD北大核心
影响因子:0.576
ISSN:1002-0411
年,卷(期):2024.53(3)