
In this talk, we visit two systems and controls problems with stochastic components. The first problem relates to the control of safety critical autonomous systems. We provide a necessary and sufficient reachability result for an open and bounded safety set. In particular, we show that a stochastic system is controllable if and only if the expected system is controllable.
The second problem relates to control of large networked systems. We prove that a conjecture of Chris Godsil on controllability of graphs is true. The conjecture asserts that the number of binary symmetric matrices A that are controllable with all-one vector to the total number of binary matrices approaches one as the dimension of A approaches infinity. We also provide a result on universality of minimal controllability of networked systems
Executive Assistant to the Department Chair
Jacobs Hall, EBU1, 2nd Floor, Room 2803
sbattaglia@ucsd.edu | Ph: (858) 534-7013