Network configuration control via connectivity graph processes

In this paper, we discuss how to generate trajectories, modeled as connectivity graph processes, on the space of graphs induced by the network topology. We discuss the role of feasibility, reachability, and optimality in this context. In particular, we study in detail the role of reachability and the computation of reachable sets by using the cylindrical algebraic decomposition (CAD) algorithm