Satellite selection method based on simulated annealing and gradient descent
A simulated annealing algorithm and gradient descent technology, applied in the field of visible navigation satellite selection, which can solve the problems of limited performance and short time consumption of embedded processors.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0040] The present invention will be further described below in conjunction with accompanying drawing.
[0041] A star selection method based on simulated annealing and gradient descent, comprising the following steps:
[0042] Step 1. Build a simulated annealing algorithm model:
[0043] 1) Initialization: Take a random number for the precision factor and set it as the initial temperature T (between 3-10, too many or too small will affect the algorithm effect); randomly select k visible satellites for the first time, and these k satellites are used as the initial solution State S, as the starting point of algorithm iteration; each precision factor iterates L times;
[0044] 2) Repeat steps 3 to 6 for each iteration;
[0045] 3) Randomly select k visible satellites again, thus generating a new solution S′ (newly extracted k visible satellites);
[0046] 4) Calculate increment ΔT=C(S')-C(S), wherein C(S) is the volume of a cube formed by k satellites;
[0047] 5) When ΔT<0,...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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