Prof. Weiran Yao Profile

Prof. Weiran Yao

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 17 August 2024 Paper

Path planning for cluster unmanned aerial vehicles based on airborne launch

Shuanli Jia, Naiming Qi, Long He, Desong Du, Rui Zhou, Weiran Yao, Yanfang Liu

Proceedings Volume 13218, 132180I (2024) https://doi.org/10.1117/12.3032462

KEYWORDS: Unmanned aerial vehicles, Genetic algorithms, Computer simulations, Genetics, Binary data, Matrices, Mathematical optimization, Mathematical modeling, Integrated modeling

Read Abstract +

The potential applications of airborne launch cluster unmanned aerial vehicles (UAVs)are enormous. However, planning the trajectory of the carrier aircraft to maximize efficiency while ensuring its safety presents a challenging task. This paper addresses a complex combinatorial optimization problem of a single carrier aircraft conducting multiple UAV release tasks. A comprehensive UAV path planning model has been developed to accurately depict the impact of the carrier aircraft's flight path on task effectiveness. Additionally, we propose an improved non-dominated sorting genetic algorithm-II (INSGA-II) algorithm aimed at finding the optimal release points and sequences. By introducing selection operators, hybrid crossover operators, and an enhanced elite retention strategy, we have made various improvements to the NSGA-II algorithm, enhancing its global search capability and performance. Simulation results conducted in two different scenarios thoroughly validate the effectiveness of the proposed algorithm. A comparison with the original NSGA-II algorithm reveals that the INSGA-II algorithm can find better solutions within an acceptable number of iterations.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years