Cuts and cycles in relative sensing and control of spatially distributed systems
Jordan Sandhu, Mehran Mesbahi, Takashi Tsukamaki · 2005
We consider transformations that characterize equivalent classes of relative sensing and control topologies for spatially distributed systems. We employ tools from algebraic graph theory, and in particular, notions associated with cut and cycle spaces of a graph, to derive explicit formula for such characterizations. Simulation results, demonstrating the utility of the developed framework in the context of reconfigurable control, conclude our presentation.