The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Multi-Agent Reinforcement Learning Aided Intelligent UAV Swarm for Target Tracking
Abstract
Past few years have witnessed the widespread adoption of unmanned aerial vehicles (UAVs) in target tracking for regional monitor and strike. Most existing target tracking approaches rely on the target motion frames obtained by the camera equipped, or on ideally assuming a pre-set target trajectory. However, in practice, the real trajectory of the target cannot be perfectly known to the UAVs in advance, and also the target may intelligently adjust its flying strategy according to the environment. Besides, the limited flight performance, as well as information capture and processing capability, of a single UAV can hardly fulfill high tracking success rate requirements. To address aforementioned issues, this paper proposes an end-to-end cooperative multi-agent reinforcement learning (MARL) scheme, where UAVs are enabled to make intelligent flight decisions for cooperative target tracking, on the basis of the past and current states of the target. In order to reduce power consumption and prolong the lifetime of the UAV tracking system, the propulsion power consumption model and energy saving strategy are introduced. Moreover, to further increase the detection coverage, spatial information entropy is introduced in the tracking algorithm. Simulation results show that our proposed algorithm outperfoms the deep reinforcement learning baselines in terms of the mean episode rewards, while also yields high performances with respect to tracking success rates, power saving efficiency and detection coverage.
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
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Soft actor-critic Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Haarnoja, T., Zhou, A., Abbeel, P., & Levine, S. (2018) · arXiv · doi:10.48550/arxiv.1801.01290 · Cited by 5,594 · cited 1×
“Then a soft actor-critic [33] based TT algorithm called multi-UAV soft actor-critic (MUSAC) is proposed to maximize the tradeoff between the long-term expected reward”
MethodAddressing Function Approximation Error in Actor-Critic Methods
Fujimoto, S., van Hoof, H., & Meger, D. (2018) · arXiv · doi:10.48550/arxiv.1802.09477 · Cited by 3,650
Cited by
Communication and Control in Collaborative UAVs: Recent Advances and Future Trends
Javaid, S., Saeed, N., Qadir, Z., Fahim, H., He, B., Song, H., & Bilal, M. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3248841 · Cited by 345
Toward Autonomous Multi-UAV Wireless Network: A Survey of Reinforcement Learning-Based Approaches
Bai, Y., Zhao, H., Zhang, X., Chang, Z., Jäntti, R., & Yang, K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3323344 · Cited by 295
A survey on collaborative hunting with robotic swarm: Key technologies and application scenarios
Cai, W., Chen, H., & Zhang, M. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.128008 · Cited by 20
Metadata
- Authors
- Xia, Z., Du, J., Wang, J., Jiang, C., Ren, Y., Li, G., & Han, Z.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2022-01
- Volume
- 71
- Issue
- 1
- Pages
- 931-945
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W3214814008
- Cited by
- 248
- References
- 4
- FWCI
- 11.29
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-Agent Reinforcement Learning Aided Intelligent UAV Swarm for Target Tracking. https://app.cochat.ai/papers/10.1109/tvt.2021.3129504
- The paper
- Xia, Z., Du, J., Wang, J., Jiang, C., Ren, Y., Li, G., & Han, Z. (2022). Multi-Agent Reinforcement Learning Aided Intelligent UAV Swarm for Target Tracking. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2021.3129504
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.