We study a transport equation in a network and control it in a single vertex. We describe all possible reachable states and prove a criterion of Kalman type for those vertices in which the problem is maximally controllable. The results are then applied to concrete networks to show the complexity of the problem.
Vertex control of flows in networks
ENGEL, KLAUS JOCHEN OTTO;
2008-01-01
Abstract
We study a transport equation in a network and control it in a single vertex. We describe all possible reachable states and prove a criterion of Kalman type for those vertices in which the problem is maximally controllable. The results are then applied to concrete networks to show the complexity of the problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
