Decentralized minimal‐time planar formation control of multi‐agent system. (7th April 2017)
- Record Type:
- Journal Article
- Title:
- Decentralized minimal‐time planar formation control of multi‐agent system. (7th April 2017)
- Main Title:
- Decentralized minimal‐time planar formation control of multi‐agent system
- Authors:
- Ou, Linlin
Zou, Chao
Yu, Xinyi - Other Names:
- He Jianping guestEditor.
La Hung (Jim) guestEditor.
Chen Zhiyong guestEditor.
Ge Shuzhi Sam guestEditor. - Abstract:
- Summary: In this paper, the problems of decentralized minimal‐time planar formation control are investigated for both static and dynamic cases. For the static one, the discrete‐time dynamics of multi‐agent system in which each agent exchanges information according to a complex weighted network is studied. On the basis of a minimal polynomial, a decentralized minimal‐time static formation method is proposed to compute the final formation positions of the agents in the minimal number of steps without global coordinates. The proposed method allows an arbitrarily chosen agent in the network to compute its final formation position. For the dynamic one in a leader–follower framework, the path information of the agents satisfies linear regression equations that are determined by interaction topology and input signals. In order to obtain the coefficients of such linear regression equations, a Kronecker‐theorem‐based algorithm is presented. Similar to the results for the static case, any agent is allowed to use the minimum number of successive history state values to compute the future dynamic formation track. The minimal number of steps can be computed by checking the rank condition of the Hankel matrix constructed in terms of the path information. Meanwhile, the simulation examples are given to demonstrate the validity of the proposed minimal‐time planar formation control methods. The results in the paper combine the matrix polynomial analysis into the framework of formationSummary: In this paper, the problems of decentralized minimal‐time planar formation control are investigated for both static and dynamic cases. For the static one, the discrete‐time dynamics of multi‐agent system in which each agent exchanges information according to a complex weighted network is studied. On the basis of a minimal polynomial, a decentralized minimal‐time static formation method is proposed to compute the final formation positions of the agents in the minimal number of steps without global coordinates. The proposed method allows an arbitrarily chosen agent in the network to compute its final formation position. For the dynamic one in a leader–follower framework, the path information of the agents satisfies linear regression equations that are determined by interaction topology and input signals. In order to obtain the coefficients of such linear regression equations, a Kronecker‐theorem‐based algorithm is presented. Similar to the results for the static case, any agent is allowed to use the minimum number of successive history state values to compute the future dynamic formation track. The minimal number of steps can be computed by checking the rank condition of the Hankel matrix constructed in terms of the path information. Meanwhile, the simulation examples are given to demonstrate the validity of the proposed minimal‐time planar formation control methods. The results in the paper combine the matrix polynomial analysis into the framework of formation control design and show how to predict the motion of the agents in a decentralized manner. Copyright © 2017 John Wiley & Sons, Ltd. … (more)
- Is Part Of:
- International journal of robust and nonlinear control. Volume 27:Number 9(2017)
- Journal:
- International journal of robust and nonlinear control
- Issue:
- Volume 27:Number 9(2017)
- Issue Display:
- Volume 27, Issue 9 (2017)
- Year:
- 2017
- Volume:
- 27
- Issue:
- 9
- Issue Sort Value:
- 2017-0027-0009-0000
- Page Start:
- 1480
- Page End:
- 1498
- Publication Date:
- 2017-04-07
- Subjects:
- planar formation control -- minimal‐time algorithm -- complex weighted network
Automatic control -- Periodicals
Control theory -- Periodicals
Nonlinear systems -- Periodicals
629.836 - Journal URLs:
- http://onlinelibrary.wiley.com/ ↗
- DOI:
- 10.1002/rnc.3800 ↗
- Languages:
- English
- ISSNs:
- 1049-8923
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4542.538900
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 1653.xml