Počet záznamů: 1  

Switched max-plus linear-dual inequalities: cycle time analysis and applications

  1. 1.
    SYSNO ASEP0582950
    Druh ASEPJ - Článek v odborném periodiku
    Zařazení RIVJ - Článek v odborném periodiku
    Poddruh JČlánek ve WOS
    NázevSwitched max-plus linear-dual inequalities: cycle time analysis and applications
    Tvůrce(i) Zorzenon, D. (DE)
    Komenda, Jan (MU-W) RID, SAI, ORCID
    Raisch, J. (DE)
    Zdroj.dok.Discrete Event Dynamic Systems-Theory and Applications. - : Springer - ISSN 0924-6703
    Roč. 34, č. 1 (2024), s. 199-250
    Poč.str.52 s.
    Jazyk dok.eng - angličtina
    Země vyd.DE - Německo
    Klíč. slovamax-plus algebra ; Petri nets ; scheduling ; switched systems
    Vědní obor RIVBA - Obecná matematika
    Obor OECDAutomation and control systems
    CEPGC19-06175J GA ČR - Grantová agentura ČR
    Způsob publikováníOpen access
    Institucionální podporaMU-W - RVO:67985840
    UT WOS001152304200001
    EID SCOPUS85183865098
    DOI10.1007/s10626-023-00389-5
    AnotaceP-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by max-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches, ii. a complete trajectory of the robot including start-up and shut-down transients.
    PracovištěMatematický ústav
    KontaktJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Rok sběru2025
    Elektronická adresahttps://doi.org/10.1007/s10626-023-00389-5
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.