CASIA OpenIR  > 复杂系统管理与控制国家重点实验室  > 先进机器人
Neuro-adaptive containment seeking of multiple networking agents with unknown dynamics
Guanghui Wen; Peijun Wang; Tingwen Huang; Long Cheng; Junyong Sun
2017
Conference Name14th International Symposium on Neural Networks (ISNN)
Conference DateJUN 21-26, 2017
Conference PlaceSappro
CountryJappan
AbstractThis paper studies the quasi-containment and asymptotic containment problems of networking uncertain agents with multiple leaders over a fixing communication graph. A kind of containment controller consisting of a linear feedback term, a neuro-adaptive approximation term as well as a non-smooth feedback term is designed to complete the goal of quasi-containment. Under the assumption that the subgraph depicting the underlying communication configuration among multiple followers is detail-balanced and each follower can be at least indirectly influenced by one leader, it is proven that quasi-containment can be realized if the containment controller are appropriately designed. The results are then extended to asymptotic containment of networking uncertain agents with multiple leaders.
Document Type会议论文
Identifierhttp://ir.ia.ac.cn/handle/173211/23127
Collection复杂系统管理与控制国家重点实验室_先进机器人
Recommended Citation
GB/T 7714
Guanghui Wen,Peijun Wang,Tingwen Huang,et al. Neuro-adaptive containment seeking of multiple networking agents with unknown dynamics[C],2017.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Guanghui Wen]'s Articles
[Peijun Wang]'s Articles
[Tingwen Huang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Guanghui Wen]'s Articles
[Peijun Wang]'s Articles
[Tingwen Huang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Guanghui Wen]'s Articles
[Peijun Wang]'s Articles
[Tingwen Huang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.