Aerospace observation task balanced arrangement method for multiple discrete task regions
The invention discloses a space observation task balanced arrangement method for multiple discrete task regions, and belongs to the field of satellite task planning. The method comprises the following steps: firstly, performing access calculation on to-be-observed targets belonging to a plurality of...
Gespeichert in:
Hauptverfasser: | , , , , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses a space observation task balanced arrangement method for multiple discrete task regions, and belongs to the field of satellite task planning. The method comprises the following steps: firstly, performing access calculation on to-be-observed targets belonging to a plurality of discrete task regions to obtain to-be-arranged observation tasks; then random binary coding is carried out on observation tasks to be arranged, and a particle swarm algorithm is adopted to calculate fitness function values considering the task priority sum, the task arrangement rate and the task arrangement balance condition; and finally, updating the speed and position of the particles according to the adaptive variation, and carrying out loop iteration to obtain a final observation scheme solution. The method has the characteristics of balanced arrangement for a plurality of discrete regions, fast convergence, high task arrangement rate and the like, and is suitable for large-range multi-region mass target satel |
---|