Space-Based ADS-B Multi-Beamforming Optimization via Adaptive Grouping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing optimization methods for space-based ADS-B multi-beamforming, such as genetic algorithms and particle swarm optimization, face challenges with slow convergence and large parameter scales, leading to local optima and inefficient full-coverage achievement.
Innovation Solution
A distributed cooperative coevolution method with an improved adaptive grouping strategy is proposed, which divides optimization parameters into subcomponents, optimizes them in parallel, and periodically performs cooperation schemas based on adaptive grouping strategies that consider relative orientations and aircraft densities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized bio-inspired approaches (GA, PSO) are used for multi-beamforming optimization, then the system can handle large parameter scales, but convergence speed is slow and local optima are easily reached
Solution Approach 1:
The patent divides the parameter optimization problem into multiple subcomponents through adaptive grouping strategies. Parameters are segmented into different groups based on their correlations and importance, allowing parallel optimization of each group while maintaining overall system performance. This segmentation resolves the contradiction by enabling faster convergence through parallel processing while maintaining reliability through coordinated optimization of all parameter groups.
Solution Approach 2:
The patent implements dynamic grouping strategies that adaptively adjust parameter groupings during the optimization process. The grouping structure changes dynamically based on the optimization progress and parameter interdependencies, allowing the system to escape local optima and achieve better convergence. This dynamic approach resolves the contradiction by maintaining optimization reliability while reducing convergence time through adaptive reconfiguration.
2Productivity
If parameter grouping is used in coevolution framework, then optimization efficiency is improved, but interdependence among parameters may increase
Solution Approach 1:
The patent performs preliminary analysis of parameter interdependencies before grouping, using correlation analysis and importance assessment to pre-determine optimal grouping structures. This preliminary action identifies which parameters should be grouped together and which should remain separate, resolving the contradiction by establishing efficient groupings that minimize interdependence while maintaining optimization productivity.
Solution Approach 2:
The patent implements feedback mechanisms that monitor parameter interdependence during the optimization process and dynamically adjust groupings accordingly. When interdependence exceeds thresholds, the system reconfigures groupings to reduce complexity. This feedback approach resolves the contradiction by maintaining high optimization productivity while preventing excessive parameter interdependence through continuous monitoring and adjustment.
3Device complexity
If 2-decomposition grouping is used, then n-dimensional problem is decomposed into n/2 dimensions, but subcomponent parameter scale remains large when original parameter scale is large
Solution Approach 1:
The patent applies local quality principles by creating non-uniform parameter groupings where different groups have different sizes and compositions based on their specific characteristics and interdependencies. Rather than uniform 2-decomposition, the system creates groups with optimized parameter counts that reduce subcomponent complexity where needed while maintaining necessary detail in critical groups. This resolves the contradiction by locally optimizing group structures to reduce both dimensionality and subcomponent parameter scales.
Solution Approach 2:
The patent introduces additional grouping dimensions beyond simple 2-decomposition, creating multi-level hierarchical groupings that further reduce parameter scales. By organizing parameters into multiple levels of grouping (e.g., primary groups, secondary subgroups), the system achieves more aggressive dimensionality reduction while maintaining manageable subcomponent sizes. This resolves the contradiction by adding grouping dimensions that simultaneously reduce overall parameter dimension and subcomponent parameter scales.
Data Source
AI summary
The present invention discloses a coevolution-based multi-beamforming optimizing method for space-based ADS-B, which belongs to the field of aviation technologies. According to this method, after initializing population and acquiring an initial optimal solution, optimization parameters are firstly grouped randomly so that all beams form several significant uncovered regions. Then, grouping is performed by an adaptive grouping strategy based on the relative orientation between the mean center of the largest uncovered region and the direction of each beam, so that the parameters quickly converge to a full-coverage state within the half angle of the satellite. Finally, grouping is performed by a grouping strategy based on the aircraft density covered by each beam to obtain optimally the minimal update time interval under a full-coverage constraint. The method of the present invention adopts an adaptive dynamic grouping strategy based on the beam pointing, the orientation of uncovered region and the aircraft density covered by each beam, such that the algorithm performance and optimization efficiency can both be improved.