Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost Decouplability of any Directed Weighted Network Topology

Published 2 Aug 2014 in cs.SY | (1408.0355v1)

Abstract: This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of analysis for networked dynamical systems. As an example of its application, the consensus problem of linear multi-agent systems with time-varying network topologies is addressed. As a result, a necessary and sufficient condition for uniform consensus is proposed.

Authors (2)
Citations (18)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.