UAV Path Planning with Tangent-plus-Lyapunov Vector Field Guidance and Obstacle Avoidance
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
A dynamic path-planning algorithm is proposed for routing unmanned air vehicles (UAVs) in order to track ground targets under path constraints, wind effects, and obstacle avoidance requirements. We first present the tangent vector field guidance (TVFG) and the Lyapunov vector field guidance (LVFG) algorithms. We demonstrate that the TVFG outperforms the LVFG as long as a tangent line is available between the UAV's turning circle and an objective circle, which is a desired orbit pattern over a target. Based on a hybrid version of the TVFG and LVFG, we then derive a theoretically shortest path algorithm with UAV operational constraints given a target position and the current UAV dynamic state. This algorithm has the efficiency of the TVFG when UAV is outside the standoff circle and the ability to follow the path via the LVFG when inside the standoff circle. In addition we adopt point-mass approximation of the target state probability density function (pdf) for target motion prediction by exploiting road network information and target dynamics as well as obstacle avoidance strategies. Overall, the proposed technical approach is practical and competitive, supported by solid theoretical analysis on several aspects of the algorithm performance. With extensive simulations we show that the tangent-plus-Lyapunov vector field guidance (T+LVFG) algorithm provides effective and robust tracking performance in various scenarios, including a target moving according to waypoints or a random kinematics model in an environment that may include obstacles and/or winds.
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
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Cited by
Vector field-based support vector regression for building energy consumption prediction
Zhong, H., Wang, J., Jia, H., Mu, Y., & Lv, S. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.03.078 · Cited by 386
Sense and avoid technologies with applications to unmanned aircraft systems: Review and prospects
Yu, X., & Zhang, Y. (2015) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2015.01.001 · Cited by 301
Metadata
- Authors
- Chen, H., Chang, K., & Agate, C. S.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2013-04
- Volume
- 49
- Issue
- 2
- Pages
- 840-856
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2165024080
- Cited by
- 215
- References
- 1
- FWCI
- 14.87
- 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: UAV Path Planning with Tangent-plus-Lyapunov Vector Field Guidance and Obstacle Avoidance. https://app.cochat.ai/papers/10.1109/taes.2013.6494384
- The paper
- Chen, H., Chang, K., & Agate, C. S. (2013). UAV Path Planning with Tangent-plus-Lyapunov Vector Field Guidance and Obstacle Avoidance. IEEE Transactions on Aerospace and Electronic Systems. https://doi.org/10.1109/taes.2013.6494384
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.