11,297 research outputs found
Observability and Decentralized Control of Fuzzy Discrete Event Systems
Fuzzy discrete event systems as a generalization of (crisp) discrete event
systems have been introduced in order that it is possible to effectively
represent uncertainty, imprecision, and vagueness arising from the dynamic of
systems. A fuzzy discrete event system has been modelled by a fuzzy automaton;
its behavior is described in terms of the fuzzy language generated by the
automaton. In this paper, we are concerned with the supervisory control problem
for fuzzy discrete event systems with partial observation. Observability,
normality, and co-observability of crisp languages are extended to fuzzy
languages. It is shown that the observability, together with controllability,
of the desired fuzzy language is a necessary and sufficient condition for the
existence of a partially observable fuzzy supervisor. When a decentralized
solution is desired, it is proved that there exist local fuzzy supervisors if
and only if the fuzzy language to be synthesized is controllable and
co-observable. Moreover, the infimal controllable and observable fuzzy
superlanguage, and the supremal controllable and normal fuzzy sublanguage are
also discussed. Simple examples are provided to illustrate the theoretical
development.Comment: 14 pages, 1 figure. to be published in the IEEE Transactions on Fuzzy
System
Observable Graphs
An edge-colored directed graph is \emph{observable} if an agent that moves
along its edges is able to determine his position in the graph after a
sufficiently long observation of the edge colors. When the agent is able to
determine his position only from time to time, the graph is said to be
\emph{partly observable}. Observability in graphs is desirable in situations
where autonomous agents are moving on a network and one wants to localize them
(or the agent wants to localize himself) with limited information. In this
paper, we completely characterize observable and partly observable graphs and
show how these concepts relate to observable discrete event systems and to
local automata. Based on these characterizations, we provide polynomial time
algorithms to decide observability, to decide partial observability, and to
compute the minimal number of observations necessary for finding the position
of an agent. In particular we prove that in the worst case this minimal number
of observations increases quadratically with the number of nodes in the graph.
From this it follows that it may be necessary for an agent to pass through
the same node several times before he is finally able to determine his position
in the graph. We then consider the more difficult question of assigning colors
to a graph so as to make it observable and we prove that two different versions
of this problem are NP-complete.Comment: 15 pages, 8 figure
- …