Satellite task planning method based on greedy adaptive annealing contract net algorithm
A task planning and self-adaptive technology, applied in the field of satellite scheduling, which can solve problems such as incompleteness, failure to consider main goals and sub-goals, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0089] First, as figure 1 As shown, an embodiment of the present invention provides a satellite mission planning method based on a greedy adaptive annealing contract network algorithm, including several slave satellites and a master satellite for decision-making, and the method specifically includes:
[0090] S1, the main satellite obtains the task sequence to be observed, and enters the cyclic bidding process, set q=1, and set the cycle termination times;
[0091] S2, the main satellite starts the qth bidding, and obtains the task sequence that has not been arranged at present, if the task sequence that is not currently arranged is empty, go to S5; otherwise, go to S3;
[0092] S3. The master satellite broadcasts the currently unscheduled task sequence to each of the slave satellites; according to a preset slave satellite mathematical model, each of the slave satellites adopts a greedy-based task sequence for the currently unscheduled task sequence. The adaptive annealing co...
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