Affiliation:
1. School of Automation Southeast University Nanjing China
2. Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing China
Abstract
AbstractThis article proposes a new distributed finite‐time optimization algorithm for agents under directed graphs. By employing the nonsmooth technique and graph theory, a distributed discontinuous algorithm for continuous‐time agents subject to strongly convex local cost functions is first designed with a finite‐time distributed estimator, where the gradients of the local cost functions are estimated in finite time. It is shown that for a strongly connected graph and arbitrary initial conditions, the proposed algorithms can achieve consensus, and the systems can converge to the optimal point in finite time. Then, a two‐step approach is proposed to achieve finite‐time optimization of high‐order agents with disturbances under directed graphs. Finally, the validity of the proposed finite‐time optimization algorithm is verified by two numerical examples.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Jiangsu Province
Subject
Electrical and Electronic Engineering,Industrial and Manufacturing Engineering,Mechanical Engineering,Aerospace Engineering,Biomedical Engineering,General Chemical Engineering,Control and Systems Engineering
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献