Formation of heterogeneous multi-agent systems under min-weighted persistent graph
by Yanlong Sun; Ziqiang Xu; Xiaoning Zhang; Jing Yan; Cailian Chen; Xinping Guan
International Journal of System Control and Information Processing (IJSCIP), Vol. 2, No. 1, 2017

Abstract: In this paper, we develop a simple and efficient formation control framework for heterogeneous multi-agent systems under min-weighted persistent graph. As the ability of each agent may be different, the architecture of agents is considered to be heterogeneous. To reduce the communication complexity of keeping connectivity for agents, a topology optimisation scheme is proposed, which is based on min-weighted persistent graph. According to the topology of agents, a directed acyclic graph (DAG) is constructed to reflect the signal flow relation of agents, and then the corresponding formation control protocol is designed by using the transfer function model. Apply the proposed method, it is shown that the communication complexity of multi-agent systems is decreased, and the connection safety is improved. Based on signal flow graph analysis and Mason's rule, the convergence conditions are provided to show the agents can keep a formation. Finally, several simulations are worked out to illustrate the effectiveness of our theoretical results.

Online publication date: Mon, 22-May-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of System Control and Information Processing (IJSCIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com