Name
Abstract | ||
|---|---|---|
A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal design problems for an abstracted network are more amenable to efficient optimization algorithms. From the implementation point of view, maintaining such networ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TAC.2018.2791471 | IEEE Transactions on Automatic Control |
Keywords | Field | DocType |
Couplings,Laplace equations,Symmetric matrices,Algorithm design and analysis,Resistance,Optimization,Approximation algorithms | Network abstraction,Approximation algorithm,Mathematical optimization,Coupling,Algorithm design,Abstraction,Optimal design,Symmetric matrix,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
63 | 10 | 0018-9286 |
Citations | PageRank | References |
5 | 0.44 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milad Siami | 1 | 122 | 15.65 |
| Nader Motee | 2 | 181 | 28.18 |