Networked multi-agent systems have attracted lots of researchers to develop algorithms, techniques, and applications.A multi-agent networked system consists of more than one subsystem (agent) to cooperately solve a global problem with only local computations and communications in a fully distributed manner. These networked systems have been investigated in various different areas including signal processing, control system, and machine learning. We can see massive applications using networked systems in reality, for example, persistent surveillance, healthcare, factory manufacturing, data mining, machine learning, power system, transportation system, and many other areas. Considering the nature of those mentioned applications, traditional centralized control and optimization algorithms which require both higher communication and computational capacities are not suitable. Additionally, compared to distributed control and optimization approaches, centralized control, and optimization algorithms cannot be scaled into systems with a large number of agents, or guarantee performance and security. All of the limitations of centralized control and optimization algorithms motivate us to investigate and develop new distributed control and optimization algorithms in networked systems. Moreover, convergence rate and analysis are crucial in control and optimization literature, which motivates us to investigate how to analyze and accerlate the convergence of distributed optimization algorithms.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc1944275 |
| Date | 05 1900 |
| Creators | Zhang, Shengjun |
| Contributors | Bailey, Colleen, Li, Xinrong, Guturu, Parthasarathy, Chamadia, Shubham |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | Text |
| Rights | Public, Zhang, Shengjun, Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved. |
Page generated in 0.0045 seconds