Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Coding method for planning three-dimensional flight paths by aid of genetic algorithms

A technology of trajectory planning and coding method, applied in the field of genetic algorithm, can solve the problems of limiting the search space of genetic algorithm, the result is not the global optimal solution, etc., to achieve the effect of good effect and high efficiency

Inactive Publication Date: 2015-09-23
NORTHWESTERN POLYTECHNICAL UNIV
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The above-mentioned documents must be at a certain altitude to determine the flight track by coding, which greatly limits the search space of the genetic algorithm, and the result obtained is not the global optimal solution
[0009] Therefore, in the field of 3D trajectory planning, there is no set of coding theory that can complete the conversion from coding to trajectory, and then from trajectory to coding.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Coding method for planning three-dimensional flight paths by aid of genetic algorithms
  • Coding method for planning three-dimensional flight paths by aid of genetic algorithms
  • Coding method for planning three-dimensional flight paths by aid of genetic algorithms

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0070] In a three-dimensional simulation space of 300×300 (km), the aircraft flies from the starting point S to the target point T, and 20 threat points with different positions and different strengths are distributed in the space.

[0071] Starting point S position (60, 130, 10)

[0072] Target point T position (230, -45, 10)

[0073] The 20 threat points are in order

[0074] (30, 0, 5) (60, 0, 8) (70, 80, 15) (120, -50, 2)

[0075] (160, 80, 15) (190, -50, 13) (130, 100, 7) (140, -100, 3)

[0076] (200, 40, 2) (50, -60, 3) (110, 30, 5) (80, 45, 13)

[0077] (150, -30, 14) (160, 25, 8) (80, 30, 11) (110, 60, 6)

[0078] (105, -25, 10) (180, 5, 13) (155, -60, 15) (40, 60, 7)

[0079] The threat point intensity is (2,1,3,4,5,9,3,5,7,3,10,2,4,1,6,3,7,1,8,9)×100

[0080] First, according to the Delaunay three-dimensional division rule, the three-dimensional space is divided according to the position of the threat point. In the simulation environment of this example, the entire space is divided...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a coding method for planning three-dimensional flight paths by the aid of genetic algorithms. The coding method includes dividing three-dimensional spaces into sets of different tetrahedrons; determining codes by right-hand rules by the aid of known flight paths; restoring flight paths by the aid of known codes. The coding method has the advantages that each flight path in each three-dimensional space is expressed by a row of codes, each flight path can be restored in the corresponding three-dimensional space by the aid of the corresponding row of codes, a platform for effectively using the genetic algorithms in the three-dimensional spaces can be built, and the genetic algorithms which are optimization algorithms with high efficiency and excellent effects can be successfully applied to the field of three-dimensional flight path planning.

Description

Technical field [0001] The invention relates to the field of three-dimensional space track planning, especially genetic algorithm. Background technique [0002] At present, the application of genetic algorithm in trajectory planning is mainly in the two-dimensional field. A line of digital code is used to represent the track, and then the genetic algorithm search operation is performed. The technology is quite mature and comprehensive: [0003] "An Application of Improved Genetic Algorithm in UCAV Fast Track Planning"——Gu Chaoqi, Firepower and Command Control, 2015, Vol.40No.2. This paper uses an improved genetic algorithm to conduct trajectory planning research in a two-dimensional environment, and enhances the algorithm's ability to respond to emergent threats. [0004] "Research on real-time trajectory planning based on genetic algorithm"-Tang Xiaodong, Journal of Projectiles, Rockets and Guidance, 2015, Vol.34No.1. This paper uses genetic algorithms to study multi-UAV cooperati...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/20
CPCG01C21/20
Inventor 屈耀红张寅韬
Owner NORTHWESTERN POLYTECHNICAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com