Efficient assessment of state liveness in open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems: The general case

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F20%3A00537767" target="_blank" >RIV/67985840:_____/20:00537767 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989592:15310/21:73602409

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ifacol.2021.04.075" target="_blank" >http://dx.doi.org/10.1016/j.ifacol.2021.04.075</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ifacol.2021.04.075" target="_blank" >10.1016/j.ifacol.2021.04.075</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient assessment of state liveness in open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems: The general case

Popis výsledku v původním jazyce

Open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems model the operation of many automated unit-load material handling systems that are used in various production and distribution facilities. An important requirement for these systems is to preserve the system liveness – i.e., the ability of each system agent to reach any location of the underlying guidepath network – by blocking those traffic states that will result in deadlock and/or livelock. The remaining set of traffic states are characterized as “live”. The worst-case computational complexity of the decision problem of assessing the state liveness in the considered class of transport systems is an open issue. This work capitalizes upon some recent developments on the problem of assessing state liveness in the considered transport systems in order to provide a novel algorithm for this problem. The worst-case computational complexity of this algorithm is not polynomially bounded.

Název v anglickém jazyce

Efficient assessment of state liveness in open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems: The general case

Popis výsledku anglicky

Open, irreversible, dynamically routed, zone-controlled guidepath-based transport systems model the operation of many automated unit-load material handling systems that are used in various production and distribution facilities. An important requirement for these systems is to preserve the system liveness – i.e., the ability of each system agent to reach any location of the underlying guidepath network – by blocking those traffic states that will result in deadlock and/or livelock. The remaining set of traffic states are characterized as “live”. The worst-case computational complexity of the decision problem of assessing the state liveness in the considered class of transport systems is an open issue. This work capitalizes upon some recent developments on the problem of assessing state liveness in the considered transport systems in order to provide a novel algorithm for this problem. The worst-case computational complexity of this algorithm is not polynomially bounded.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

IFAC-PapersOnLine. Volume 53, Issue 4 - Proceedings of 15th IFAC Workshop on Discrete Event Systems WODES 2020

ISBN

—

ISSN

2405-8963

e-ISSN

—

Počet stran výsledku

8

Strana od-do

235-242

Název nakladatele

Elsevier

Místo vydání

Amsterdam

Místo konání akce

Rio de Janeiro

Datum konání akce

11. 11. 2020

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000651644000036