Counter approach for the estimation of optimal sequences in Partially Observable Untimed Petri Nets
| العنوان: | Counter approach for the estimation of optimal sequences in Partially Observable Untimed Petri Nets |
|---|---|
| المؤلفون: | Philippe Declerck |
| المساهمون: | Laboratoire Angevin de Recherche en Ingénierie des Systèmes (LARIS), Université d'Angers (UA) |
| المصدر: | Discrete Event Dynamic Systems Discrete Event Dynamic Systems, In press |
| بيانات النشر: | HAL CCSD, 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | 030213 general clinical medicine, 0209 industrial biotechnology, Current (mathematics), Optimization problem, Computer science, Time horizon, 02 engineering and technology, Unobservable, 03 medical and health sciences, 020901 industrial engineering & automation, 0302 clinical medicine, Untimed Petri nets, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Electrical and Electronic Engineering, partially observable, Timed Petri nets, Horizon, Observable, Petri net, Subnet, sequence estimation, Control and Systems Engineering, Modeling and Simulation, sliding time horizon, relaxed structural boundedness, counter, Algorithm |
| الوصف: | International audience; In this paper, we consider the on-line estimation of optimal current subsequences in Partially Observable Untimed Petri Nets. Applying the counter approach classically used in max-plus algebra for Timed Petri nets, the idea is to exploit the assumption of a non immediate consumption of the tokens for each place which introduces an order of precedence between events. The approach can estimate a global price depending on the costs and gains provided by the tasks. The estimation of optimal sequences is based on the determination of a time horizon necessary to describe the sequences. The estimation is relevant to a step defined by two successive occurrences of observable transition firings. We show that the approach can consider any optimization problem if the dates of the observations are known or, if a guaranteed horizon can be computed which is always possible when the unobservable subnet satisfies a weak assumption close to the structural boundedness (relaxed structurally boundedness). As the technique avoids the generation of sets, the approach does not depend on their cardinalities and is numerically efficient. |
| اللغة: | English |
| تدمد: | 1573-7594 |
| الوصول الحر: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92b6a296c8d862fd82827fe203f0caa2Test https://hal.univ-angers.fr/hal-03185188Test |
| حقوق: | OPEN |
| رقم الانضمام: | edsair.doi.dedup.....92b6a296c8d862fd82827fe203f0caa2 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 15737594 |
|---|