CN114169617A - Universal satellite load time sequence constraint checking method and system based on path - Google Patents

Universal satellite load time sequence constraint checking method and system based on path Download PDF

Info

Publication number
CN114169617A
CN114169617A CN202111510130.6A CN202111510130A CN114169617A CN 114169617 A CN114169617 A CN 114169617A CN 202111510130 A CN202111510130 A CN 202111510130A CN 114169617 A CN114169617 A CN 114169617A
Authority
CN
China
Prior art keywords
path
load
load action
time sequence
action
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111510130.6A
Other languages
Chinese (zh)
Inventor
杨斌
汤航
王鹏
胡丹
史潇骁
赵玉春
滕伟
钟春丽
毕研鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Remote Sensing Information
Original Assignee
Beijing Institute of Remote Sensing Information
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Remote Sensing Information filed Critical Beijing Institute of Remote Sensing Information
Priority to CN202111510130.6A priority Critical patent/CN114169617A/en
Publication of CN114169617A publication Critical patent/CN114169617A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention provides a general satellite load time sequence constraint checking method and system based on a path. The method comprises the following steps: carrying out time sequencing and initial energy setting on the load actions; acquiring the ith load action and the (i + 1) th load action; determining a current path by taking the starting time point of the ith load action as a first end point and taking the starting time point of the (i + 1) th load action as a second end point; determining path energy according to the parameter vector of the current path; and determining whether the time sequence conflict exists between the ith load action and the (i + 1) th load action according to whether the residual energy after passing through the path is attenuated to be below zero. The path-based universal satellite load time sequence constraint inspection method and system can finish inspection of time sequence conflicts by simple judgment logic.

Description

Universal satellite load time sequence constraint checking method and system based on path
Technical Field
The invention relates to the technical field of remote sensing satellite planning, in particular to a general satellite load time sequence constraint inspection method and system based on paths.
Background
The remote sensing satellite load action refers to that the remote sensing satellite executes a complete imaging task or a data transmission task. The load actions should contain the following key attributes: the motion name and code, satellite code, motion start time, motion end time, working duration, working mode, yaw angle, solar altitude angle, etc. In the running process of the ground management and control system, for an imaging task, the starting time and the ending time of the load action refer to the starting time and the ending time of imaging; for data transfer tasks, load action start and end times are indexed to data transfer start and end times; for the task of simultaneous imaging and data transmission, the starting and ending time of the loading action refers to the maximum time interval of imaging and data transmission.
Before imaging reconnaissance or data transmission of the remote sensing satellite is started, a series of starting preparation work is required, and the time required by the starting preparation work is generally called as load action preparation time; after the satellite imaging is finished or the data transmission is finished, shutdown and attitude recovery are required to be carried out on some equipment, and the time required by shutdown and attitude recovery is generally called load action recovery time; the time after the previous load operation recovery time until the next load operation preparation time is referred to as a load operation interval time. Therefore, the total interval time between the two load operations is equal to the sum of the recovery time of the previous load operation, the preparation time of the next load operation, and the interval time between the load operations, as shown in fig. 1.
The load constraint inspection of the remote sensing satellite aims to ensure that a ground control system efficiently and safely uses the remote sensing satellite to carry out tasks, the requirements of safe use of the remote sensing satellite and the ground tasks are met to the maximum extent, the core lies in that the use constraint definition and description of different remote sensing satellite loads are not uniform, so that the complexity and difficulty of the construction of the ground control system are high, and no related research result can support the work at present.
Disclosure of Invention
The invention aims to provide a path-based universal satellite load time sequence constraint checking method and a path-based universal satellite load time sequence constraint checking system, which can finish checking of time sequence conflicts by simple judgment logic.
In order to solve the technical problem, the invention provides a universal satellite load time sequence constraint checking method based on a path, which comprises the following steps: carrying out time sequencing and initial energy setting on the load actions; acquiring the ith load action and the (i + 1) th load action; determining a current path by taking the starting time point of the ith load action as a first end point and taking the starting time point of the (i + 1) th load action as a second end point; determining path energy according to the parameter vector of the current path; and determining whether the time sequence conflict exists between the ith load action and the (i + 1) th load action according to whether the residual energy after passing through the path is attenuated to be below zero.
In some embodiments, further comprising: and after determining the current path, judging the path type of the current path before determining the path energy according to the parameter vector of the current path by taking the starting time point of the ith load action as a first end point and the starting time point of the (i + 1) th load action as a second end point.
In some embodiments, the path types of the current path include: connected path, non-connected path and special path.
In some embodiments, for the connected path, the parameter vector of the current path is: x is the number ofi＝[xi0,xi1,…,xij]TThe path energy of the current path is: t is ti＝f(xi,xi+1)。
In some embodiments, for a particular path, the parameter vector for the current path is: x is the number ofi＝[xi0,xi1,…,xij]TThe path energy of the current path is: t is ti＝f(xi-j,…,xi-1,xi,xi+1)。
In some embodiments, further comprising: after judging that the path type of the current path is a non-connected path, determining whether a time sequence conflict exists between the ith load action and the (i + 1) th load action.
In some embodiments, further comprising: and after determining whether the time sequence conflict exists between the ith load action and the (i + 1) th load action according to whether the residual energy after passing through the path is attenuated to be less than zero, repeatedly executing the operation of acquiring the time sequence conflict judgment by the load actions until the time sequence constraint check of all the load actions is completed.
In some embodiments, further comprising: and after the timing constraint check of all the load actions is completed, outputting a check result of the timing constraint check.
In some embodiments, determining whether there is a timing conflict between the i-th load action and the i + 1-th load action based on whether the remaining energy after the pass-through path decays below zero comprises: and if the residual energy after the path is passed is attenuated to be below zero, determining that the ith load action and the (i + 1) th load action have time sequence conflict.
In addition, the invention also provides a path-based universal satellite load timing constraint checking system, which comprises: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method for path-based universal satellite load timing constraint verification according to the foregoing.
After adopting such design, the invention has at least the following advantages:
and (3) passing through the technical means of the paths, endowing corresponding energy to each path, and finishing the check on whether the time sequence conflict exists between the corresponding load actions according to whether the energy value consumed after passing through the paths is reduced to be less than 0.
Drawings
The foregoing is only an overview of the technical solutions of the present invention, and in order to make the technical solutions of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and the detailed description.
FIG. 1 is a schematic timing diagram of satellite payload actions;
fig. 2 is a flow chart diagram of a path-based universal satellite load timing constraint verification method.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
The technical problem to be solved by the invention is realized by the following technical scheme:
a method for checking a path-based universal satellite payload timing constraint, see fig. 2, comprising the steps of:
(1) sorting the actions;
(2) setting initial energy and path;
(3) calculating a path relation;
(4) determining a path attribute and a current path;
(5) updating the passed path and the consumed energy;
(6) the next action is acquired.
And (5) circulating the steps (3), (4), (5) and (6) until all the load actions are judged to be finished, and returning the result.
Each loading action is considered as an end point on the time axis, and the time connection between each loading action of the satellite is represented by a path. It can be seen that each path has a start point and an end point, and the path can represent the timing constraint relationship between two load actions by taking the load action with the earlier start time as the start point and the load action with the later start time as the end point.
According to the action time sequence relation, the paths are divided into three types, namely non-communication paths, communication paths and special paths. The non-connected path indicates that a starting point and an end point on the path do not meet the action time sequence constraint; the communication path indicates the starting point on the pathAnd the end point satisfies the action timing constraint; the special path indicates that the starting point and the end point on the path meet the action timing constraint, but the influence of the previous path and the following path on the current path needs to be comprehensively considered. Two attributes are simultaneously assigned to the path: path consumption and path switching energy. Path consumption represents the energy that must be consumed from one endpoint to another endpoint through the path; the path switching energy represents the amount of energy Δ t that can be obtained when switching from one type of path to another, different type of path. Uniformly setting the attribute of the ith path as follows: ri＝[ri0 ri1]T。
The preparation time and recovery time of the satellite loading action, the interval time between two loading actions, the working mode of the loading action and the side sway angle form a complex correlation relationship. Let the parameter vector of the ith load action be xi＝[xi0 xi1 … xij]T(the parameter meaning represents different physical meanings according to different satellites, and usually represents action start time, action end time, working mode, yaw angle, pitch angle and the like in sequence), the energy consumed by the ith path is defined as: t is ti＝f(xi,xi+1)。
Meanwhile, there are some special relations between the load motions, for example, some remote sensing satellites can combine multiple imaging motions, the interval time of the combined imaging motions is much shorter than that of a single imaging motion, but the special motions have times limitation. Therefore, when there is a group of load actions, it is not only possible to determine the parameter relationship between two adjacent load actions alone, but also to consider the previous load actions comprehensively, and the energy consumed by the special path is: t is ti＝f(xi-j,…,xi-1,xi,xi+1) Wherein i-j is more than or equal to 0.
When the timing constraint judgment is carried out by using the paths, connectable paths between a first end point and a second end point are judged one by one from the first end point on a time axis, the attenuation of the current energy is calculated, if the current energy is attenuated to be below 0, the time sequence conflict between the first end point and the second end point is shown, and the subsequent judgment is similar to the above.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the present invention in any way, and it will be apparent to those skilled in the art that the above description of the present invention can be applied to various modifications, equivalent variations or modifications without departing from the spirit and scope of the present invention.

Claims (10)

1. A universal satellite load time sequence constraint checking method based on paths is characterized by comprising the following steps:
carrying out time sequencing and initial energy setting on the load actions;
acquiring the ith load action and the (i + 1) th load action;
determining a current path by taking the starting time point of the ith load action as a first end point and taking the starting time point of the (i + 1) th load action as a second end point;
determining path energy according to the parameter vector of the current path;
and determining whether the time sequence conflict exists between the ith load action and the (i + 1) th load action according to whether the residual energy after passing through the path is attenuated to be below zero.
2. The method of claim 1, further comprising:
and after determining the current path, judging the path type of the current path before determining the path energy according to the parameter vector of the current path by taking the starting time point of the ith load action as a first end point and the starting time point of the (i + 1) th load action as a second end point.
3. A method for path-based universal satellite load timing constraint verification according to claim 2, characterized in that the path type of the current path comprises: connected path, non-connected path and special path.
4. Path based generic satellite payload as recited in claim 3The time sequence constraint checking method is characterized in that for a link path, the parameter vector of the current path is as follows: x is the number ofi＝[xi0,xi1,…,xij]TThe path energy of the current path is: t is ti＝f(xi,xi+1)。
5. A method for path-based universal satellite load timing constraint verification according to claim 3, characterized in that for a particular path, the parameter vector of the current path is: x is the number ofi＝[xi0,xi1,…,xij]TThe path energy of the current path is: t is ti＝f(xi-j,…,xi-1,xi,xi+1)。
6. The method of claim 2, further comprising:
after judging that the path type of the current path is a non-connected path, determining whether a time sequence conflict exists between the ith load action and the (i + 1) th load action.
7. The method of claim 1, further comprising:
and after determining whether the time sequence conflict exists between the ith load action and the (i + 1) th load action according to whether the residual energy after passing through the path is attenuated to be less than zero, repeatedly executing the operation of acquiring the time sequence conflict judgment by the load actions until the time sequence constraint check of all the load actions is completed.
8. The method of claim 7, further comprising:
and after the timing constraint check of all the load actions is completed, outputting a check result of the timing constraint check.
9. The method of claim 1, wherein determining whether there is a timing conflict between the i-th loading action and the i + 1-th loading action according to whether the residual energy after passing through the path decays below zero comprises:
and if the residual energy after the path is passed is attenuated to be below zero, determining that the ith load action and the (i + 1) th load action have time sequence conflict.
10. A path-based universal satellite payload timing constraint verification system, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement a method of path-based universal satellite load timing constraint verification according to any one of claims 1 to 9.
CN202111510130.6A 2021-12-10 2021-12-10 Universal satellite load time sequence constraint checking method and system based on path Pending CN114169617A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111510130.6A CN114169617A (en) 2021-12-10 2021-12-10 Universal satellite load time sequence constraint checking method and system based on path

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111510130.6A CN114169617A (en) 2021-12-10 2021-12-10 Universal satellite load time sequence constraint checking method and system based on path

Publications (1)

Publication Number Publication Date
CN114169617A true CN114169617A (en) 2022-03-11

Family

ID=80485544

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111510130.6A Pending CN114169617A (en) 2021-12-10 2021-12-10 Universal satellite load time sequence constraint checking method and system based on path

Country Status (1)

Country Link
CN (1) CN114169617A (en)

Similar Documents

Publication Publication Date Title
CN107562066B (en) Multi-target heuristic sequencing task planning method for spacecraft
Zhao et al. Joint optimization of mission abort and component switching policies for multistate warm standby systems
CN108932162A (en) Multitask total management system and processing method based on integrated spaceborne computer
US20210357816A1 (en) System with hybrid communication strategy for large-scale distributed deep learning
CN109919484A (en) A kind of autonomous mission planning method on star
CN109634672A (en) A kind of multi-core processor loading method based on intercore communication
CN110502023B (en) Spacecraft attitude determination implementation method based on distributed intelligent sensor
CN109919378B (en) Satellite-borne autonomous planning system
CN114169617A (en) Universal satellite load time sequence constraint checking method and system based on path
CN109447525B (en) Multi-satellite deployment top level heuristic task planning method
CN108388943B (en) Pooling device and method suitable for neural network
Tangirala et al. Hybrid-model based hierarchical mission control architecture for autonomous underwater vehicles
Benowitz The Curiosity Mars Rover's Fault Protection Engine
CN114548670A (en) Satellite general task scheduling method and system based on process engine
CN113343367A (en) EDA algorithm-based ship aviation ammunition transfer scheduling optimization method and device
CN116339957B (en) Task scheduling method and system for heterogeneous distributed platform hybrid key system
CN114462255B (en) Task planning method for airborne radar networking
Liu et al. An Integrated Task and Path Planning Approach for Mobile Robots in Smart Factory
CN116991374B (en) Control method, device, electronic equipment and medium for constructing continuous integration task
CN107480375B (en) Method for satisfying task planning by deep space exploration constraint based on space action
Fukushima et al. A new approach to autonomous onboard mission replanning using orthogonal array design
Mura Stochastic Modeling and Analysis of Phased-Mission Systems Dependability
CN115688650A (en) MBSE-based spacecraft software time sequence design method
CN107688889B (en) Satellite-ground time synchronization task planning method for navigation system
US20140309973A1 (en) Method and control for calculating a data-based function model

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination