TY - BOOK

T1 - Supervisory control of partially observed weighted discrete-event systems

AU - Su, Rong

AU - Schuppen, van, J.H.

AU - Rooda, J.E.

PY - 2010

Y1 - 2010

N2 - When the Ramadge-Wonham supervisory control paradigm is applied to practical problems,
it is desirable to require a closed-loop system be finitely coreachable in the sense
that a marker state can be reached within a finite number of transitions regardless of
the current state. Furthermore, considering that actions in a real system usually carry
costs, it is desirable to synthesize a supervisor that incurs only a minimum cost. Pursuing
finite coreachability with a minimum cost is the main motivation for developing a theory
about optimal supervisory control of weighted discrete-event systems in the literature. In
this paper we follow the same line of optimal supervisory control but with a new focus
on partial observation, which is common in practical applications. We first define three
finitely-weighted supervisory control problems, namely (1) to decide the existence of a
finitely-weighted controllable and normal sublanguage; (2) to compute a finitely-weighted
controllable and normal sublanguage, when the answer to Problem (1) is affirmative; (3)
to compute the supremal minimum-weighted controllable and normal sublanguage, when
the answer to Problem (1) is affirmative. Then we provide concrete algorithms to solve
them.

AB - When the Ramadge-Wonham supervisory control paradigm is applied to practical problems,
it is desirable to require a closed-loop system be finitely coreachable in the sense
that a marker state can be reached within a finite number of transitions regardless of
the current state. Furthermore, considering that actions in a real system usually carry
costs, it is desirable to synthesize a supervisor that incurs only a minimum cost. Pursuing
finite coreachability with a minimum cost is the main motivation for developing a theory
about optimal supervisory control of weighted discrete-event systems in the literature. In
this paper we follow the same line of optimal supervisory control but with a new focus
on partial observation, which is common in practical applications. We first define three
finitely-weighted supervisory control problems, namely (1) to decide the existence of a
finitely-weighted controllable and normal sublanguage; (2) to compute a finitely-weighted
controllable and normal sublanguage, when the answer to Problem (1) is affirmative; (3)
to compute the supremal minimum-weighted controllable and normal sublanguage, when
the answer to Problem (1) is affirmative. Then we provide concrete algorithms to solve
them.

M3 - Report

T3 - SE report

BT - Supervisory control of partially observed weighted discrete-event systems

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -