Controllability in the max-algebra

Citation
Jm. Prou et E. Wagneur, Controllability in the max-algebra, KYBERNETIKA, 35(1), 1999, pp. 13-24
Citations number
8
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
KYBERNETIKA
ISSN journal
00235954 → ACNP
Volume
35
Issue
1
Year of publication
1999
Pages
13 - 24
Database
ISI
SICI code
0023-5954(1999)35:1<13:CITM>2.0.ZU;2-S
Abstract
We ale interested here in the reachability and controllability problems for DEDS in the max-algebra. Contrary to the situation in linear systems theor y, where controllability (resp observability) refers to a (linear) subspace , these properties are essentially discrete in the max-linear dynamic syste m. We show that these problems, which consist in solving a max-linear equat ion lead to an eigenvector problem in the min-algebra. More precisely, we s how that, given a max-linear system, then, for every natural number k great er than or equal to 1, there is a matrix Gamma(k) whose min-eigenspace asso ciated with the eigenvalue 1 (or min-fixed points set) contains all the sta tes which are reachable in k steps. This means in particular that if a stat e is not in this eigenspace, then it is not controllable. Also, we give an indirect characterization of Gamma(k) for the condition to be sufficient. A similar result also holds by duality on the observability side.