Recently, distributed convex optimization has received much attention by many researchers. Current research on this problem mainly focuses on fixed network topologies, without enough attention to switching ones. This paper specially establishes a new technique called averaging-base approach to design a continuous-time distributed algorithm for convex optimization problem under switching topology. This idea of using averaging was proposed in our earlier works for the consensus problem of multi-agent...
The leader-following consensus of multiple linear time invariant (LTI) systems under switching topology is considered. The leader-following consensus problem consists of designing for each agent a distributed protocol to make all agents track a leader vehicle, which has the same LTI dynamics as the agents. The interaction topology describing the information exchange of these agents is time-varying. An averaging method is proposed. Unlike the existing results in the literatures which assume the LTI...
We discuss the stability and instability properties of steady state solutions to single equations, shadow systems, as well as systems. Our basic observation is that the more complicated the pattern are, the more unstable they tend to be.
Download Results (CSV)