Unmanned aerial vehicle dynamic path planning in an uncertain environment

Author:

Yao Min,Zhao Min

Abstract

SUMMARYAn unmanned aerial vehicle (UAV) dynamic path planning method is proposed to avoid not only static threats but also mobile threats. The path of a UAV is planned or modified by the potential trajectory of the mobile threat, which is predicted by its current position, velocity, and direction angle, because the positions of the UAV and mobile threat are dynamically changing. In each UAV planning path, the UAV incurs some costs, including control costs to change the direction angle, route costs to bypass the threats, and threat costs to acquire some probability to be destroyed by threats. The model predictive control (MPC) algorithm is used to determine the optimal or sub-optimal path with minimum overall costs. The MPC algorithm is a rolling-optimization feedback algorithm. It is used to plan the UAV path in several steps online instead of one-time offline to avoid sudden and mobile threats dynamically. Lastly, solution implementation is described along with several simulation results that demonstrate the effectiveness of the proposed method.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,General Mathematics,Software,Control and Systems Engineering

Reference25 articles.

1. Genetic Algorithms + Data Structures = Evolution Programs

2. UAV route planning using Multiobjective Ant Colony System

3. A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees

4. S. T. Shannon , Optimal Path Planning for Single and Multiple Aircraft Using a Reduced Order Formulation Ph.D. Thesis (Atlanta, GA: Georgia Institute of Technology, 2007).

Cited by 25 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3