Q learning algorithm based UAV path learning and obstacle avoidence approach
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
As Unmanned Aerial Vehicle (UAV) having been applied in more complex and adverse environments, the requirements of automatic techniques for obstacle avoidance are becoming more and more important. Reinforcement learning (RL) is a well-known technique in the domain of Machine Learning (ML), which interacts with the environment and learning the knowledge without the requirement of massive priori training samples. Thus it is attractive to implement the idea of RL to support UAV tasks in unknown environments. This paper adopts an Adaptive and Random Exploration approach (ARE) to accomplish both the tasks of UAV navigation and obstacle avoidance. Search mechanisms will be conducted to guide the UAV escape to a proper path. Simulations on different scenarios show that our approach can effectively guide UAVs to reach their targets in quite rational paths.
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
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
A Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970 · cited 1×
“In addition, Monte Carlo Tree method[18], as a stochastic approach, is usually utilized to deal with local optimum, which is supposed to help UAV escape from traps.”
Method
Cited by
Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges
Aggarwal, S., & Kumar, N. (2020) · Computer Communications · doi:10.1016/j.comcom.2019.10.014 · Cited by 971
Applications of artificial intelligence for disaster management
Sun, W., Bocchini, P., & Davison, B. D. (2020) · Natural Hazards · doi:10.1007/s11069-020-04124-3 · Cited by 491
Solving the optimal path planning of a mobile robot using improved Q-learning
Low, E. S., Ong, P., & Cheah, K. C. (2019) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2019.02.013 · Cited by 326
Yan, C., Xiang, X., & Wang, C. (2020) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-019-01073-3 · Cited by 324
UAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
Metadata
- Authors
- Yijing, Z., Zheng, Z., Xiaoyi, Z., & Yang, L.
- Venue
- 2017 36th Chinese Control Conference (CCC)
- Publisher
- IEEE
- Published
- 2017-07
- Pages
- 3397-3402
- OpenAlex
- W2755553401
- Cited by
- 112
- References
- 2
- FWCI
- 3.81
- Type
- conference paper
- 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.