Skip to main navigation Skip to search Skip to main content

Hybrid RRT/DE algorithm for high performance UCAV path planning

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Path planning is an optimization problem that is crucial for robot or UCAV. Among the optimization approaches, we focus in this paper on a new hybrid modified Rapidly Exploring Random Tree algorithm (RRTs) and Differential Evolution (DE), for solving the optimization path planning problem to generate a fast and optimal 3D collision-free path under complex environment. We demonstrate the proposed algorithm performance through comparative analysis with Improved Bat algorithm (IBA). The results demonstrated the robustness and effectiveness of the proposed algorithm for generating an optimal free collision path in a short time, which is suitable for the UCAV applications.

Original languageEnglish
Title of host publicationProceedings of the 2017 6th International Conference on Network, Communication and Computing, ICNCC 2017
PublisherAssociation for Computing Machinery
Pages235-242
Number of pages8
ISBN (Electronic)9781450353663
DOIs
StatePublished - 8 Dec 2017
Event6th International Conference on Network, Communication and Computing, ICNCC 2017 - Kunming, China
Duration: 8 Dec 201710 Dec 2017

Publication series

NameACM International Conference Proceeding Series

Conference

Conference6th International Conference on Network, Communication and Computing, ICNCC 2017
Country/TerritoryChina
CityKunming
Period8/12/1710/12/17

Keywords

  • Differential evolution
  • Fillet path geometry
  • Path planning
  • RRT algorithm

Fingerprint

Dive into the research topics of 'Hybrid RRT/DE algorithm for high performance UCAV path planning'. Together they form a unique fingerprint.

Cite this