Distributed Formation and Reconfiguration Control of VTOL UAVs
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
In this brief, a novel distributed cascade robust feedback control approach is proposed for formation and reconfiguration control of a team of vertical takeoff and landing (VTOL) unmanned air vehicles (UAVs). This approach is based on dynamic communication network. It guarantees intervehicle collision avoidance and considers dynamic constraints of UAVs. In the outer loop of the cascade formation control, a potential field approach is used to generate a desired velocity for each UAV, which ensures that the team of UAVs can perform formation flying, formation rotating and reconfiguration, avoid intervehicle collision, as well as track a specified virtual leader. In the inner loop of the cascade formation control, the velocity of each UAV is designed to track its desired velocity generated by the outer loop, subject to dynamic constraints. The proposed approach is demonstrated via both simulation and flight test.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 2×
“It is emphasized that the desired formation configuration p f = [p f 1 p f 2 · · · p f n]T will be maintained if the potential function V f (t) = 0 and the dynamic communication network G is connected [23].”
BackgroundCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Behavior-based formation control for multirobot teams
Balch, T., & Arkin, R. C. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736776 · Cited by 3,112
Distributed multi‐vehicle coordinated control via local information exchange
Ren, W., & Atkins, E. (2007) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1147 · Cited by 1,484 · cited 4×
“2547952 tralized method, where a single controller is used to control the whole team based on the information from the whole team [13] and the distributed/decentralized method, where each team member generates its own control based on local information from its neighbors [1], [14], [18], [24], [25], [30].”
BackgroundMethodInfluentialOgren, P., Fiorelli, E., & Leonard, N. E. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.832203 · Cited by 1,234 · cited 1×
“The adaptive gradient climbing strategy [22], linear algebra and graph theory [7], [12], [15], [17], [25], passivity and dissipativity theory [2], Lyapunov methods [11], [28]–[30], and nonlinear small-gain theorem [8] have been introduced to solve the distributed/decentralized formation control problems [18].”
MethodPassivity as a Design Tool for Group Coordination
Arcak, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.902733 · Cited by 781
Decentralized Scheme for Spacecraft Formation Flying via the Virtual Structure Approach
Ren, W., & Beard, R. W. (2004) · Journal of Guidance Control and Dynamics · doi:10.2514/1.9287 · Cited by 744 · cited 2×
“2547952 tralized method, where a single controller is used to control the whole team based on the information from the whole team [13] and the distributed/decentralized method, where each team member generates its own control based on local information from its neighbors [1], [14], [18], [24], [25], [30].”
BackgroundMethodLeader–follower formation control of nonholonomic mobile robots with input constraints
Consolini, L., Morbidi, F., Prattichizzo, D., & Tosques, M. (2008) · Automatica · doi:10.1016/j.automatica.2007.09.019 · Cited by 681
Decentralized control of vehicle formations
Lafferriere, G., Williams, A., Caughman, J., & Veerman, J. J. P. (2005) · Systems & Control Letters · doi:10.1016/j.sysconle.2005.02.004 · Cited by 627 · cited 2×
“From the control mechanism perspective, formation control approaches can be classified into consensusbased approaches [7], [12], [15], [17], [25], artificial potential function-based approaches [6], [14], leader–follower approaches [4], [9], [10], [18], [19], virtual structure approaches [24], [26], and behavior-based…”
BackgroundMethodA survey of spacecraft formation flying guidance and control. Part II: control
Scharf, D. P., Hadaegh, F. Y., & Ploen, S. R. (2004) · Proceedings of the 2004 American Control Conference · doi:10.23919/acc.2004.1384365 · Cited by 536
Cited by
A Survey on Intelligent Control for Multiagent Systems
Shi, P., & Yan, B. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3042823 · Cited by 275
Metadata
- Authors
- Liao, F., Teo, R., Wang, J. L., Dong, X., Lin, F., & Peng, K.
- Venue
- IEEE Transactions on Control Systems Technology
- Published
- 2017-01
- Volume
- 25
- Issue
- 1
- Pages
- 270-277
- ISSN
- 1063-6536 (ISSN-L)
- 1558-0865
- OpenAlex
- W2341521787
- Cited by
- 202
- References
- 25
- FWCI
- 20.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.