JP5412895B2 - Path allocation program, path allocation apparatus, and path allocation method - Google Patents

Description

  The present invention relates to a path allocation program, a path allocation apparatus, and a path allocation method, and more particularly to a path allocation program, a path allocation apparatus, and a path allocation method for an artificial satellite tracking antenna.

  In the tracking control operation of an artificial satellite, information is exchanged between the artificial satellite (hereinafter simply referred to as a satellite) and the ground station using the ground station antenna facility. In tracking control operation of an artificial satellite, a relay satellite (stationary satellite) is arranged between the ground station and the satellite, and the relay satellite may be used in the same manner as the ground station antenna equipment.

  Usually, in one satellite operation, a plurality of satellite tracking antennas (hereinafter simply referred to as antennas) are often used. One antenna is not dedicated to a specific satellite but is used for tracking control operation of a plurality of satellites. In order to efficiently operate multiple satellites with a limited number of antennas, the visible time zone in which the satellites are visible from each antenna is calculated in advance, and which satellite is used when and which satellite is operated. Create an antenna operation plan.

  To create an antenna operation plan, it is necessary to assign a path based on the visible time zone, which is the source of the antenna operation plan, to a plurality of satellites and a plurality of antennas. Path allocation is to determine which antenna is to be used for which satellite.

  Conventionally, as a technology related to satellite operation planning, there is a technology that automates a trial and error process that improves the operation plan so as to minimize the competition for each satellite as much as possible, assuming that the previous operation plan exists. (For example, refer to Patent Document 1).

JP 2001-233300 A

  If the number of target satellites and the number of antennas are several, respectively, the creation of an antenna operation plan can be handled manually. However, when the number of target satellites and the number of antennas are 10 or more, it is difficult to manually create an antenna operation plan. Also, the antenna operation plan is not necessarily a problem that an absolute optimum solution exists. For this reason, the process of selecting the final plan from the plurality of antenna operation plans while the satellite operation side and the antenna operation side adjust is not negligible.

  In order for the satellite operation side and the antenna operation side to coordinate and select the final plan, it is necessary to create a plurality of antenna operation plans. However, as described above, there has been a problem that it becomes difficult to manually create an antenna operation plan as the number of target satellites and the number of antennas increase.

  In addition, the conventional technology related to the satellite operation plan does not mention how to create the previous operation plan from zero base.

  One embodiment of the present invention has been made in view of the above points, and a path allocation program capable of easily performing path allocation as a source of an antenna operation plan when tracking a plurality of satellites with a plurality of antennas, It is an object to provide a path allocation device and a path allocation method.

  In order to solve the above-mentioned problem, in one embodiment of the present invention, a computer that performs path allocation, which is a source of an antenna operation plan when tracking a plurality of satellites with a plurality of antennas, sets the priority of the satellite for each antenna. A process for creating a processing order table in which the order of combinations of antennas and satellites for performing path allocation processing is set for each case based on the antenna priority table for each antenna and the antenna priority case table in which a plurality of antenna priorities are set. Based on the order table creation unit, the file that sets the satellite visible time zone for each antenna, and the target satellite table that sets the orbit type and operation time for each satellite, the path time, visible time, and A path time table that sets the initial value of the allocation flag that indicates the path allocation result. Based on the order of the combination of antenna and satellite for performing the path allocation processing for each case set in the processing order table and the time table default creation unit, for the combination of antenna, satellite and path set in the path time table A path allocation unit that performs path allocation so as not to overlap using path time and visible time, and creates a path time table for each case by updating the initial value of the allocation flag of the path time table based on the path allocation result It is a path allocation program that functions as

  In addition, what applied the component, the expression, or arbitrary combinations of the component of one Embodiment of this invention to a method, an apparatus, a system, a computer program, a recording medium, a data structure, etc. is also effective as an aspect of this invention. .

  As described above, according to an embodiment of the present invention, it is possible to easily perform path allocation as a source of an antenna operation plan when tracking a plurality of satellites with a plurality of antennas.

It is a hardware block diagram of an example of the path allocation apparatus of a present Example. It is a block diagram of an example showing the process image of the path allocation apparatus. It is explanatory drawing of an example for demonstrating the rule of path allocation. It is explanatory drawing of another example for demonstrating the rule of path allocation. It is an image figure of an example of a path allocation result chart. It is a block diagram of an example of an object satellite table. It is a block diagram of an example of the satellite priority table classified by antenna. It is a block diagram of an example of an antenna priority case table. It is a block diagram of an example of a path | pass request table. It is explanatory drawing explaining an allocation step. It is an image figure showing the creation procedure of a processing order table. It is a block diagram of an example of a path | pass time table. It is a process block diagram of an example of the path allocation apparatus of a present Example. It is a flowchart showing the processing procedure of the path allocation engine. It is a flowchart showing the processing procedure of the pass time table default preparation part. It is the flowchart showing the process sequence of the path | route allocation part classified by antenna / satellite. It is a flowchart showing the procedure of the process according to path | pass. It is a flowchart showing the procedure of the path duplication judgment process which an duplication judgment part performs. It is an image figure of an example of the path allocation result chart which a path allocation display part displays on an output device.

  Next, modes for carrying out the present invention will be described based on the following embodiments with reference to the drawings. The path allocation device of this embodiment is used for tracking control operation of an artificial satellite. Specifically, the path allocation apparatus of the present embodiment can be applied to the creation of an antenna operation plan when tracking a plurality of satellites with a plurality of antennas. Further, the path allocation device of the present embodiment is applicable even if the antenna is replaced with a relay satellite.

  FIG. 1 is a hardware configuration diagram of an example of a path allocation device according to the present embodiment. 1 includes an input device 11, an output device 12, a drive device 13, an auxiliary storage device 14, a main storage device 15, an arithmetic processing device 16, and an interface device 17 that are mutually connected by a bus B. Have.

  The input device 11 is a keyboard or a mouse. The input device 11 is used for inputting various signals. The output device 12 is a display device or the like. The output device 12 is used for displaying various windows and data. The interface device 17 is a modem, a LAN card, or the like. The interface device 17 is used to connect to a network such as a LAN.

  The path allocation program of the present embodiment is at least a part of various programs that control the path allocation apparatus 1. The path allocation program is provided, for example, by distributing the recording medium 18 or downloading from the network. The recording medium 18 on which the path allocation program is recorded is information such as a CD-ROM, a flexible disk, a magneto-optical disk, etc., a recording medium for recording information optically, electrically or magnetically, a ROM, a flash memory, etc. Various types of recording media such as a semiconductor memory for electrical recording can be used.

  When the recording medium 18 on which the path allocation program is recorded is set in the drive device 13, the path allocation program is installed from the recording medium 18 to the auxiliary storage device 14 via the drive device 13. The path allocation program downloaded from the network is installed in the auxiliary storage device 14 via the interface device 17.

  The auxiliary storage device 14 stores the installed path allocation program and also stores necessary files, data, and the like. The main storage device 15 reads and stores the path allocation program from the auxiliary storage device 14 when the path allocation program is started. The arithmetic processing unit 16 implements various processes as will be described later in accordance with a path allocation program stored in the main storage unit 15.

  FIG. 2 is a configuration diagram of an example showing a processing image of the path allocation device. The path allocation device 1 can output a primary solution of path allocation as a result, and displays the result as a GUI on the output device 12, thereby realizing a function that allows the operator to correct the path allocation on the screen. The path allocation engine 21 and the path allocation display unit 22 of the path allocation device 1 are realized by the arithmetic processing device 16 executing a path allocation program.

  The path allocation engine 21 mechanically simulates a path allocation operation that has been performed manually by an operator. Therefore, the path allocation engine 21 is designated by inputting the plan period, prepass / postpath time, target satellite table, satellite priority table by antenna, antenna priority case table, path request table, and station event file 23. .

  The path allocation engine 21 receives the satellite priority for each antenna from the satellite priority table for each antenna. The satellite priority for each antenna is determined in advance according to the concept of the master station / slave station.

  The path allocation engine 21 receives the priority order of antennas when allocating paths from the antenna priority case table. It is assumed that a plurality of cases can be designated as the priority order of antennas when assigning paths. The number of cases that specify the priority order of antennas when assigning paths corresponds to the number of antenna operation plans to be created.

  The path allocation engine 21 receives the number of requested paths during the planning period from the path request table. The path allocation engine 21 receives the target satellite and the orbit type from the target satellite table. The path allocation engine 21 receives the satellite satellite visible time zone from the station event file 23 corresponding to the number of target satellites. In addition, the path allocation engine 21 receives a plan period and a prepass / postpass time.

  The path allocation engine 21 creates a processing order table 24 (to be described later) based on the input satellite priority for each antenna and the antenna priority when the path is allocated. The path allocation engine 21 uses the processing order table 24 and creates a path time table 25 for each antenna / satellite described later. The path time table 25 is created for the number of cases that specify the priority order of antennas when assigning paths.

  The path allocation display unit 22 reads the path time table 25 and displays a later-described path allocation result chart on the output device 12. Further, when the allocation is corrected by the operator on the path allocation result chart, the path allocation display unit 22 creates an improved path time table 26 reflecting the corrected result.

  Here, the definition of the pass time in the present embodiment will be described. In the case of a medium altitude substantially circular orbit (visible time around 10 minutes), the path is usually used synonymously with the visible time zone. In the ground station antenna equipment, there are a pre-pass operation before AOS (Acquisition of Signal) and a post-path operation after LOS (Loss of Signal). Therefore, in this embodiment, it is defined as a pass time including a prepass / postpass operation time. The pre-pass / post-pass operation time is assumed to be given as a facility condition for each antenna.

  In addition, what crosses 0:00 UTC (Coordinated Universal Time) in the pass time shall be carried over to the day of the pass start time. In the case of a geosynchronous orbit, it is always visible, so 30 minutes with UTC as a break is defined as one pass unit. A day is divided into 48 passes. In this embodiment, the same definition of 30 minutes as that of a geostationary satellite is applied to a satellite having a visible time of several hours such as an elliptical orbit, a GPS satellite orbit, and a quasi-zenith orbit.

  Next, the definition of handover in the present embodiment will be described. Handover refers to continuous path operation by switching the communication link from antenna A to antenna B when the visible time zones of two antennas A and B overlap in a substantially altitude orbit at medium altitude. Such a continuous path operation is an approximately circular orbit at medium altitude, and it is sufficient to consider a designated satellite and antenna.

  Next, a path allocation rule in this embodiment will be described. When assigning paths according to the satellite priority for each antenna, the rules shown in FIG. 3 are considered. FIG. 3 is an explanatory diagram of an example for explaining the rules for path allocation. In FIG. 3, when the second path (2) of the satellite (SAT) 1 is selected by the antenna (ANT) 1, the path of another satellite whose path time overlaps with the path (2) (marked with x in FIG. 3). Assignment is impossible.

  When assigning paths according to the priority order of antennas, the following two rules are considered as shown in FIG. FIG. 4 is an explanatory diagram of another example for explaining the rules for path allocation. In FIG. 4, when there is a path request for ANT1 to ANT1 and ANT2, a path with overlapping path time is assigned simultaneously, such as the second path (2) of ANT1 and the second path (4) of ANT2. I can't.

  Further, in FIG. 4, when the visible time (not the path time) overlaps for the antenna pair of SAT1 and ANT1 and ANT2 in which the handover condition is specified, the second path (2) of ANT1 and ANT2 The second pass (4) can be assigned at the same time.

  FIG. 5 is an image diagram of an example of a path allocation result chart. The path allocation result chart has a display by antenna and a display by satellite. The path allocation result chart of FIG. 5 represents an example of display by antenna. In the path allocation result chart of FIG. 5, the unselected path, the selected path, and the path allocated with handover are visually distinguished and displayed.

  Next, the image of each table data that is input / output of the path allocation engine 21 and the processes associated therewith will be described.

  FIG. 6 is a configuration diagram of an example of the target satellite table. The target satellite table in FIG. 6 is table data that is input to the path allocation engine 21. The target satellite table in FIG. 6 includes the names of satellites to be processed, orbit types, operation start times, and operation end times as data items. The operation start time and operation end time are given for geostationary satellites. Since the geostationary satellite is always visible from the ground station, the time zone in which the antenna is actually used (e.g., 8 hours in the day shift zone) is designated by the operation start time and operation end time in the target satellite table. Geostationary satellite path assignment is performed for the time zone specified by the operation start time and operation end time in the target satellite table.

  FIG. 7 is a configuration diagram of an example of a satellite priority table for each antenna. The antenna priority table for each antenna in FIG. 7 is table data that is input to the path allocation engine 21. The satellite priority table for each antenna shown in FIG. 7 includes, as data items, the name of the antenna to be processed and the name of the satellite that preferentially uses the antenna. In the satellite priority table for each antenna shown in FIG. 7, the priority of the satellite can be designated for each antenna by assigning the satellite names in the order of priority.

  The antenna that can be used by the satellite is almost determined by the communication performance specifications of the satellite and the antenna. Furthermore, there is a concept of master / slave station in satellite operation. Master / slave stations are negotiated in advance. Therefore, the satellite priority for each antenna may be a requirement for the antenna operation plan.

  FIG. 8 is a configuration diagram of an example of the antenna priority case table. The antenna priority case table in FIG. 8 is table data that is input to the path allocation engine 21. The antenna priority case table of FIG. 8 has a case number and an antenna name as data items. In the antenna priority case table of FIG. 8, by assigning antenna names in order of high processing priority, the order of antennas for performing path allocation processing can be specified for each case.

  The antenna priority case table is not a requirement for the antenna operation plan. The result of path allocation should be different by changing the order of antennas performing the path allocation process. In this embodiment, by using the fact that the result of path allocation differs by changing the order of antennas that perform path allocation processing, by specifying multiple antenna orders that perform path allocation processing as `` antenna priority cases '', Multiple antenna operation plans can be obtained.

  FIG. 9 is a configuration diagram of an example of the path request table. The path request table in FIG. 9 is table data that is input to the path allocation engine 21. The path request table has an antenna name, a satellite name, the number of requested paths, an allocation step, and a handover condition as data items. In the path request table of FIG. 9, the number of requests for which number of paths can be allocated with which antenna can be designated as the number of requested paths for each satellite. In other words, the path request table specifies the number of required paths to be allocated for each combination of satellite and antenna.

  The handover condition has a request flag, a request path number, a pair antenna number, and a pair antenna name as data items. The request flag specifies whether or not to consider handover. The number of requested paths specifies the number of paths to be handed over. The number of pair antennas is the number of pair antennas that perform handover. The pair antenna name is the name of the pair antenna that performs handover.

  The path allocation is tried until the required number of paths is satisfied while checking the visible competition with other satellites. Note that the number of requested paths may not be allocated depending on the visible contention with other satellites and the status of priorities. Therefore, in this embodiment, the number of paths allocated as a result is counted, and the path allocation result chart as a GUI is displayed. indicate. The operator can judge the effectiveness of the antenna operation plan from the path allocation result chart.

  Note that it is not always best to assign paths in order from the earliest time. For example, when there are two passes in the morning and two passes in the afternoon in a medium altitude circular orbit, there is a request to take one pass in the morning / afternoon as much as possible.

  9 introduces a data item (parameter) “assignment step: ISTEP”. In this embodiment, it is tried whether path allocation is possible at the allocation step interval of the path request table.

  FIG. 10 is an explanatory diagram for explaining the allocation step. The allocation step defines the order of allocation access to the path in the planning target period for each combination of the designated antenna and satellite. For example, in the case of the allocation step “1”, the order of allocation access to the paths in the planning target period is in time order. In FIG. 10, the order of allocation access to paths when the number of paths during the planning target period is “5” and the allocation step is “2” is represented by (1) to (5).

  FIG. 11 is an image diagram showing a procedure for creating a processing order table. The processing order table 24 is table data created by the path allocation engine 21 from the antenna priority case table and the antenna priority table for each antenna. The processing order table 24 represents the order of combinations of antennas and satellites for which path allocation processing is performed for each antenna priority case.

  The path allocation engine 21 creates the processing order table 24 from the antenna priority case table and the antenna priority table for each antenna as follows. The path allocation engine 21 is provided with, for example, an antenna priority case table and an antenna-specific satellite priority table as shown in FIG.

  The path allocation engine 21 arranges the antenna names in the column direction according to the priority order according to the priority order of the antenna of the case number “1” from the antenna priority case table. Subsequently, the path allocation engine 21 arranges the satellite names corresponding to the antenna names in the row direction according to the order of the antenna priority table for each antenna. Through the processing so far, the path allocation engine 21 can create the table 31. The path allocation engine 21 reads the antenna and satellite combinations given in the matrix of the table 31 in the direction of the arrow and arranges them in the column direction of the case number “1” in the processing result table 24. The path allocation engine 21 can create the processing order table 24 shown in FIG. 11 by performing the same processing for the case numbers “2” and “3” as for the case number “1”.

  FIG. 12 is a configuration diagram of an example of the path time table. The path time table 25 is table data created by the path allocation engine 21. The path time table 25 stores the result of path allocation. The path time table 25 is an interface file between the path allocation engine 21 and the path allocation display unit 22.

  First, the path allocation engine 21 reads the station event file for each satellite, reads the AOS / LOS time for each station, and stores the initial values of the path time table 25. The path time table 25 stores satellite names, antenna names, path numbers, path start times, path end times, path times, AOS times, LOS times, and visible times as initial values.

  When the satellite orbit type is a medium altitude substantially circular orbit, the path allocation engine 21 sets the path start / path end time and path time in consideration of the pre-pass / post-path operation time for the AOS time and LOS time. When the orbit type of the satellite is a stationary orbit, an ellipse, and a high altitude orbit, the path allocation engine 21 sets the path start / path end time (path time) in 30 minutes.

  The “assignment flag: IFGET” in the path time table 25 is a parameter indicating a path assignment status. The allocation flag has an initial value “0”. When the path allocation result is “allocated”, the path allocation engine 21 sets “1” in the allocation flag. When the path allocation result is “unusable due to duplication with paths allocated to other satellites”, the path allocation engine 21 sets “2” in the allocation flag. When the path allocation result is “allocated as a handover pair”, the path allocation engine 21 sets “3” in the allocation flag.

  The path allocation engine 21 creates the path time table 25 as follows. The path time tables 25 are created as many as the “antenna priority cases”. For each path time table 25 corresponding to the “antenna priority case”, the path allocation engine 21 performs the following for the combination of antennas and satellites according to the order of the combination of antennas and satellites that performs the path allocation process of the processing order table 24. Process.

  Processing for one antenna and satellite combination is performed as follows. The path allocation engine 21 reads the number of requested paths, allocation steps, and handover conditions corresponding to the designated antenna and satellite combination from the path request table as shown in FIG.

  The path allocation engine 21 reads the first path (for example, satellite name “AAA”, antenna name “aaa”, and path number “1”) from the path time table 25 as shown in FIG. Based on this, the access path is determined.

  If the access path allocation flag is other than “0”, the path cannot be allocated, and the path allocation engine 21 proceeds to the next path. Further, if the access path allocation flag is “0”, the path can be allocated, so the path allocation engine 21 sets “1” in the allocation flag.

  The path allocation engine 21 checks the overlap of the path time of the combination of the same antenna and different satellites, the path time of the combination of different antennas and the same satellite, and the path time of the accessed path. If there is an overlap, the path allocation engine 21 sets “2” in the allocation flag of the path of the combination of the same antenna and the different satellite and the path of the combination of the different antenna and the same satellite that overlaps the path time of the accessed path. To do.

  Further, the path allocation engine 21 checks for the overlap of path times of the combination of the pair antenna and the same satellite when there is a handover. If there is an overlap, the path allocation engine 21 sets “3” in the allocation flag of the accessed path (own path) and the path (partner path) of the combination of the pair antenna and the same satellite. The path allocation engine 21 repeats the above processing for all the paths in the path time table 25 or until the number of requested paths in the path request table is satisfied.

  The path allocation display unit 22 reads a path time table 25 as shown in FIG. 12, and displays a path allocation result chart as shown in FIG. 5 on the output device 12 as a GUI. When it is desired to change the path allocation result on the GUI, the operator can change the allocation flag 0/1/2/3 of the path time table 25 by clicking a location where the path is displayed (path display location).

  Due to the change of the allocation flag, the duplication status of the path whose allocation flag has been changed in the path time table 25 and other paths changes. Therefore, the path allocation display unit 22 performs the same duplication determination as the path allocation engine 21, and again The duplication is checked, and the allocation flag of the path time table 25 is rewritten as necessary. Thereafter, the path allocation display unit 22 reads the improved path time table 26 in which the allocation flag is rewritten as necessary, and redisplays the path allocation result chart on the output device 12.

  FIG. 13 is a processing block diagram of an example of the path allocation device of this embodiment. FIG. 13 shows an example in which the station event file 23, the target satellite table 51, the antenna priority case table 52, the satellite priority table 53 for each antenna, and the path request table 54 exist in the path allocation device 1. You may make it acquire from the exterior of the path allocation apparatus 1. FIG.

  The path allocation device 1 in FIG. 13 includes a path allocation engine 21 and a path allocation display unit 22. The path allocation engine 21 includes a path time table default creation unit 61, a processing order table creation unit 62, and an antenna / satellite path allocation unit 63. The antenna / satellite path allocation unit 63 includes an overlap determination unit 64. The path allocation display unit 22 includes a chart display unit 71, a path allocation change unit 72, a duplication determination unit 73, a file reread unit 74, and a file storage unit 75.

  Hereinafter, the processing procedure of the path allocation device 1 shown in FIG. 13 will be described with reference to a flowchart. FIG. 14 is a flowchart showing the processing procedure of the path allocation engine.

  In step S1, the path allocation engine 21 reads the station event file 23, the target satellite table 51, the antenna priority case table 52, the antenna priority table 53 for each antenna, and the path request table 54 as input data.

  In step S2, the processing order table creation unit 62 creates the processing order table 24 from the antenna priority case table 52 and the antenna-specific satellite priority table 53 as described above with reference to FIG.

  In step S3, the path time table default creation unit 61 creates a default path time table 25a in which initial values are stored from the station event file 23 and the target satellite table 51 as described later.

  In step S4, the antenna / satellite path allocation unit 63 reads the combination of the antenna “ANTj” and the satellite “SATj” in the processing order “j” of the case number “i” in the processing order table. In step S5, the antenna / satellite path allocation unit 63 performs antenna / satellite path allocation as described later. The processes in steps S4 and S5 are repeated for all combinations of the antenna “ANTj” and the satellite “SATj” of the case number “i” in the processing order table.

  In step S6, the antenna / satellite path allocation unit 63 stores the path time table 25 corresponding to the antenna priority case of the case number “i”. The path allocation unit 63 for each antenna / satellite proceeds to step S7, and counts the allocation paths for which “1” or “3” is set in the allocation flag of the path time table 25 for every combination of antenna and satellite. The processes in steps S4 to S7 are repeated for all antenna priority cases in the processing order table 24.

  FIG. 15 is a flowchart showing the processing procedure of the pass time table default creation unit. Here, it is assumed that the plan start time Ts, the plan end time Te, the prepass time Tpr, and the postpass time Tpo are input to the pass time table default creation unit 61.

  In step S 11, the path time table default creation unit 61 reads the target satellite table 51. In step S 12, the path time table default creation unit 61 determines the orbit type of the “i” -th satellite from the target satellite table 51.

  When the orbit type of the “i” -th satellite is “medium altitude approximately circular orbit”, the path time table default creation unit 61 proceeds to step S13 and reads the AOS time Taos and LOS time Tlos from the station event file 23. In step S14, the path time table default creation unit 61 selects data satisfying Ts ≦ Taos ≦ Te + Tpr.

  The path time table default creation unit 61 calculates a path start time Tps and a path end time Tpe by the following equations (1) and (2).

Tps = Taos−Tpr (1)
Tpe = Tlos + Tpo (2)
The path time table default creation unit 61 writes the calculated path start time Tps and path end time Tpe in the path time table.

  When the orbit type of the “i” th satellite is “ellipse or high altitude orbit”, the path time table default creating unit 61 proceeds to step S15 and reads the AOS time Taos and LOS time Tlos from the station event file 23. In step S16, the path time table default creation unit 61 determines whether (Ts, Te) (Taos, Tlos) is large or small.

  In the case of Ts ≦ Taos ≦ Te & Te <Tlos, the path time table default creation unit 61 sets the path start time Tps and the path in increments of 30 minutes from (any time of hh: 00, hh: 30 close to Taos-Tpr) to Te. The end time Tpe is written in the pass time table.

  In the case of Taos <Ts & Ts ≦ Tlos ≦ Te, the path time table default creation unit 61 performs the path start time Tps and the path end time in steps of 30 minutes from Ts to (any time of hh: 00, hh: 30 close to Tlos + Tpo). Write Tpe to the path time table.

  In the case of Ts ≦ Taos & Tlos ≦ Te, the path time table default creation unit 61 sets (from hh: 00, hh: 30 close to Taos-Tpr) to (hh: 00 close to Tlos + Tpo, hh: 30). The path start time Tps and the path end time Tpe are written in the path time table in increments of 30 minutes (any time).

  When the orbit type of the “i” -th satellite is “stationary orbit”, the path time table default creating unit 61 proceeds to step S17 and reads the operation start time Tops and the operation end time Tope from the target satellite table 51. In step S18, the path time table default creating unit 61 writes the path start time Tps and the path end time Tpe in the path time table in steps of 30 minutes from Tops to Tope.

  The path time table default creation unit 61 repeats the processes of steps S12 to S18 for all the satellites in the target satellite table 51.

  FIG. 16 is a flowchart showing the processing procedure of the antenna / satellite path allocation unit. Proceeding to step S21, the antenna / satellite path allocation unit 63 determines the requested path number Rpass, the allocation step ISTEP and the handover condition (request flag IFHO, requested path number Rho, pair antenna) corresponding to the combination of the antenna and satellite read in step S4. Name ANTho1, pair antenna name ANTho2,...) Are read from the path request table 54.

  In step S22, the antenna / satellite path allocation unit 63 substitutes 0 for Gpass and Gho as the initial setting of the number of allocated paths. In step S23, the antenna / satellite path allocation unit 63 reads the number of paths corresponding to the combination of the antenna and the satellite read in step S4 from the path time table 25a, and substitutes it for Npass. The antenna / satellite path allocation unit 63 repeatedly performs the processing of subsequent steps S24 to S28 from i = 0 to i = Npass.

  Proceeding to step S24, the antenna / satellite path allocation unit 63 calculates the path number to be accessed from the paths corresponding to the combination of the antenna and the satellite read in step S4 by the following equation (3). Equation (3) calculates the ISTEP and pass number. The antenna / satellite path allocation unit 63 repeatedly performs the following expression (4) until IDPASS ≦ Npass.

IDPASS = 1 + ISTEP × (i−1) (3)
IDPASS = IDPASS-Npass (4)
In step S25, the antenna / satellite path allocation unit 63 performs path-specific processing of the path number IDPASS. Details of the processing for each path in step S25 will be described later. In the path-specific processing, when the path allocation is successful, Gpass is counted up and output.

  Proceeding to step S26, the antenna / satellite path allocation unit 63 determines whether or not Gho = Rho. That is, in step S26, the antenna / satellite path allocation unit 63 determines whether or not the path (handover path) Gho for which the handover allocation has been performed has reached the required path number Rho for the handover condition.

  If the handover path Gho has reached the request path number Rho for the handover condition, the antenna / satellite path allocation unit 63 proceeds to step S27, sets the handover condition request flag IFHO to 0, and then proceeds to step S28. On the other hand, if the handover path Gho has not reached the requested path number Rho of the handover condition, the antenna / satellite path allocation unit 63 proceeds to step S28 without performing the process of step S27.

  In step S28, the antenna / satellite path allocation unit 63 determines whether Gpass = Rpass. That is, in step S28, the antenna / satellite path allocation unit 63 determines whether or not the number of allocated paths (number of allocated paths) has reached the required path number Rpass.

  If the allocated path number Gpass reaches the required path number Rpass, the antenna / satellite path allocation unit 63 ends the process of antenna / satellite path allocation shown in FIG. If the allocated path number Gpass does not reach the requested path number Rpass, the antenna / satellite path allocation unit 63 increments i by 1, and returns to the process of step S24.

  FIG. 17 is a flowchart showing the procedure of the path-specific process. The path-specific processing is performed for the path (specified path) of the specified path number IDPASS. In step S31, the antenna / satellite path allocation unit 63 reads the allocation flag IFGET of the designated path from the path time table 25a.

  In step S32, the antenna / satellite path allocation unit 63 determines whether the allocation flag IFGET = 0. If the allocation flag IFGET = 0 is not satisfied, the path is an already allocated path or an unusable path, so the antenna / satellite path allocation section 63 does nothing and ends the path-specific process shown in FIG.

  If the allocation flag IFGET = 0, the antenna / satellite path allocation unit 63 proceeds to step S33, rewrites the allocation flag IFGET of the designated path in the path time table 25a to 1, and increments the allocation path number Gpass by 1.

  The antenna / satellite path allocation unit 63 repeats the processing of subsequent steps S34 to S43 from i = 1 to i = Nrec (the number of records in the path time table 25a).

  Proceeding to step S34, the antenna / satellite path allocation unit 63 determines the satellite name SATi, antenna name ANTi, allocation flag IFGETi, path start time Tpsi, path end time Tpei, AOS time Taosi, from the i-th record of the path time table 25a. Read LOS time Tlosi.

  Proceeding to step S35, the antenna / satellite path allocation unit 63 has the same combination of the antenna and satellite (target antenna and target satellite) read in step S4 as the combination of the satellite name SATi and antenna name ANTi read in step S34. If so, i is incremented by 1, and the process returns to step S34.

  If the combination of the antenna and satellite (target antenna and target satellite) read in step S4 is not the same as the combination of the satellite name SATi and antenna name ANTi read in step S34, the antenna / satellite path allocation unit 63 performs step Proceed to S36.

  In step S36, the antenna / satellite path allocation unit 63 determines whether the allocation flag IFGETi read in step S34 is zero. If the allocation flag IFGETi read in step S34 is not 0, the antenna / satellite path allocation unit 63 increments i by 1 and returns to step S34.

  If the allocation flag IFGETi read in step S34 is not 0, the antenna / satellite path allocation unit 63 proceeds to step S37 and causes the duplication determination unit 64 to perform path duplication determination described later. If it is determined that there is an overlap in the path duplication determination, IFOV = 1 is output. If it is determined that there is no duplication in the path duplication determination, IFOV = 0 is output.

  After the path duplication determination, the antenna / satellite path allocation unit 63 proceeds to step S38, and determines whether IFOV = 1. If IFOV = 1 is not satisfied, the antenna / satellite path allocation unit 63 determines that there is no duplication. Therefore, i is incremented by 1, and the process returns to step S34. If IFOV = 1, the antenna / satellite path allocation unit 63 determines that there is duplication, and thus the process proceeds to step S39, where the allocation flag IFGETi of the path time table 25a is rewritten to 2.

  In step S40, the antenna / satellite path allocation unit 63 reads out the handover condition request flag IFHO and the pair antenna name of the combination of the target antenna and the target satellite from the path request table 54, IFHO = 1, and the target satellite. If the satellite name SATi read in step S34 is the same and if any of the read pair antenna names is not the same as the antenna name ANTi read in step S34, i is incremented by 1 and the process returns to step S34. .

  If IFHO = 1, the target satellite and the satellite name SATi read in step S34 are the same, and if any of the read pair antenna names is the same as the antenna name ANTi read in step S34, the antenna / Satellite-specific path allocation unit 63 proceeds to step S41, and causes duplication determination unit 64 to perform path duplication determination described later. If it is determined that there is visible overlap in the path overlap determination, IFOV = 1 is output. If it is determined that there is no visible overlap in the path overlap determination, IFOV = 0 is output.

  After the path duplication determination, the antenna / satellite path allocation unit 63 proceeds to step S42 to determine whether IFOV = 1. If IFOV = 1, the antenna / satellite path allocation unit 63 determines that the handover is not possible because there is no visible overlap, increments i by 1, and returns to step S34. If IFOV = 1, the antenna / satellite path allocation unit 63 determines that the handover is possible because there is visible overlap, and proceeds to Step S43, rewrites the allocation flag IFGETi in the path time table 25a to 3, and at the same time the handover path Gho 1 is counted up, i is incremented by 1, and the process returns to step S34.

  FIG. 18 is a flowchart showing a path duplication determination process performed by the duplication determination unit. The flowchart in FIG. 18 corresponds to the path duplication determination performed in step S37 in FIG.

  The path duplication determination performed in step S37 is performed using the path start time Tpsi, the path end time Tpei, the path start time Tps corresponding to the combination of the target antenna and the target satellite, and the path end time Tpe read in step S34. In the flowchart of FIG. 18, the path start time Tps, the path end time Tpe, the path start time Tpsi, and the path end time Tpei are replaced with Tps1, Tpe1, Tps2, and Tpe2.

  In step S51, the duplication determination unit 64 determines whether Tps1 <Tps2 <Tpe1 is satisfied. If Tps1 <Tps2 <Tpe1, the duplication determination unit 64 determines that there is duplication, outputs IFVO = 1, and then ends the path duplication determination process of FIG. If Tps1 <Tps2 <Tpe1, the duplication determination unit 64 proceeds to step S2 and determines whether Tps1 <Tpe2 <Tpe1 is satisfied.

  If Tps1 <Tpe2 <Tpe1, the duplication determination unit 64 determines that there is duplication, outputs IFVO = 1, and then ends the path duplication determination process of FIG. If Tps1 <Tpe2 <Tpe1 is not satisfied, the overlap determination unit 64 determines that there is no overlap and outputs IFVO = 0, and then ends the path overlap determination process of FIG.

  Note that the path overlap determination performed in step S41 in FIG. 17 is performed using the AOS time Taosi and LOS time Tlosi read in step S34, the AOS time Taos and LOS time Tlos corresponding to the combination of the target antenna and the target satellite.

  For example, the path duplication determination performed in step S41 can be performed by replacing Tps1, Tpe1, Tps2, and Tpe2 in the flowchart of FIG. 18 with AOS time Taos, LOS time Tlos, AOS time Taosi, and LOS time Tlosi.

  The path allocation engine 21 can create a path time table 25 according to the flowchart of FIG. Returning to FIG. 13, the processing of the path allocation display unit 22 will be described. The chart display unit 71 of the path allocation display unit 22 displays a path allocation result chart 100 as shown in FIG.

  FIG. 19 is an image diagram of an example of a path allocation result chart displayed on the output device by the path allocation display unit. The path allocation result chart 100 in FIG. 19 is a GUI. The input field 101 is for selecting the path time table 25 to be displayed. When the operator presses a selection button, for example, the path allocation display unit 22 displays a file list of the path time table 25 and causes one path time table 25 to be selected. When one path time table 25 is selected, the path allocation display unit 22 creates a local path time table 27 and a storage path time table 28 in which the path time table is copied.

  The input field 102 is for inputting a display period. The operator can cut out and display a part of the entire path data period stored in the path time table 25 by inputting the display period in the input field 102.

  The display button 103 is for causing the operator to select the chart type (display pattern) from either antenna or satellite and displaying the path allocation result chart 100 of the selected display pattern. The path allocation result chart 100 of FIG. 19 is an example in which antenna-specific is selected as the display pattern.

  When a display pattern is selected by the display button 103, the chart display unit 71 can display the path allocation result chart 100 on the output device 12 based on the local path time table 27.

  When the path 104 on the path allocation result chart 100 is double-clicked with the mouse as an example of the input device 11, the chart display unit 71 displays a pull-down menu of “assignment / handover assignment / no assignment” to the operator. By selecting any one of “/ handover assignment / no assignment”, the path assignment state can be changed.

  For example, when the state of the path allocation of the path 104 is changed by the operator, the path allocation changing unit 72 rewrites the allocation flag of the local path time table 27 to the changed path allocation state. In addition, the chart display unit 71 changes the color of the path 104 whose path allocation state has been changed.

  When path duplication determination is selected by the duplication check button 105, the duplication judgment unit 73 of the path allocation display unit 22 searches the local path time table 27 from the beginning to the end, and checks the paths that overlap with the allocation path. . Here, it is assumed that the paths 106 on the path allocation result chart 100 overlap. When a new overlap occurs, the overlap determination unit 73 rewrites the allocation flag in the local path time table 27 for the overlapping path 106 to 4.

  Based on the local path time table 27, the chart display unit 71 alerts the operator by displaying a path allocation result chart 100 in which the overlapping paths 106 are expressed in different colors on the output device 12.

  As a result of repeating the correction, when it is desired to restore the path allocation result chart 100, the operator may click on the restore button 107 with the mouse. When the undo button 107 is clicked, the file reread unit 74 overwrites the local path time table 27 with the contents of the save path time table 28. The chart display unit 71 can display the original path allocation result chart 100 based on the local path time table 27.

  If the operator wants to confirm the path assignment result chart 100, the operator may click on the confirm button 108 with the mouse. When the confirm button 108 is clicked, the file storage unit 75 may overwrite the storage path time table 28 with the contents of the local path time table 27, or the contents of the local path time table 27 may be changed to another file name. You may save it with.

(Summary)
The path allocation apparatus 1 according to the present embodiment automatically creates a path allocation based on a visible time zone, which is a source of an antenna operation plan, from a zero base for a plurality of satellites and a plurality of antennas. The path allocation device 1 according to the present embodiment implements path allocation as diverse as possible by designating allocation steps. Further, the path allocation device 1 according to the present embodiment realizes path allocation corresponding to handover by designating a pair of a satellite and an antenna that perform handover in advance.

  The path allocation apparatus 1 according to the present embodiment mechanically performs path allocation by giving a required condition to an antenna operation plan for a plurality of antennas and a plurality of satellites. The path allocation device 1 according to the present embodiment does not calculate an antenna operation plan that completely eliminates contention for all required conditions. The path allocation device 1 according to the present embodiment first generates a primary solution (may or may not satisfy all the required conditions), and then allows correction by an operator's operation. The path allocation device 1 of the present embodiment can easily create a plurality of antenna operation plans by giving a plurality of path allocation operation conditions (antenna priority cases).

  As described above, according to the path allocation device 1 of the present embodiment, for an antenna operation plan for a plurality of antennas and a plurality of satellites, even if the number of antennas / the number of satellites is increased, the path allocation can be easily obtained Can be created.

  In addition, according to the path allocation device 1 of the present embodiment, a plurality of cases of antenna operation plans are created by changing the priority of the path allocation operation. It is effective when you want to see sex.

The present invention may have the following configurations as described below.
(Appendix 1)
A computer that performs path assignment, which is the source of the antenna operation plan when tracking multiple satellites with multiple antennas,
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation unit for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation section for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation program that functions as a path allocation unit that creates a path time table for each case by performing path allocation so as not to overlap and updating an initial value of an allocation flag of the path time table based on a path allocation result.
(Appendix 2)
The path allocation program further performs path allocation so as not to exceed the required number of paths based on a path request table in which a required number of paths, which is the required number of paths to be allocated, is set for each combination of antenna and satellite. The described path assignment program.
(Appendix 3)
The path allocation program according to appendix 2, wherein the path allocation unit further performs path allocation at intervals of the allocated paths based on a path request table in which intervals of allocated paths are set for each combination of antenna and satellite.
(Appendix 4)
The path allocation unit further supports continuous path operation based on a path request table in which the presence / absence of continuous path operation performed by switching communication links and the conditions for continuous path operation are set for each combination of antenna and satellite. The path allocation program according to appendix 3, which performs path allocation.
(Appendix 5)
A path allocation device that performs path allocation as a source of an antenna operation plan when tracking multiple satellites with multiple antennas,
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation unit for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation section for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation apparatus comprising: a path allocation unit that generates a path time table for each case, wherein path allocation is performed so as to avoid duplication and update an initial value of an allocation flag of the path time table based on a path allocation result.
(Appendix 6)
A path allocation method for performing path allocation as a source of an antenna operation plan when tracking a plurality of satellites executed by a computer with a plurality of antennas,
The computer is
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation step for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation step for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation method for performing path allocation so as not to overlap each other by using the path allocation table, and generating a path time table in which an initial value of an allocation flag of the path time table is updated based on a path allocation result for each case. .

  The present invention is not limited to the specifically disclosed embodiments, and various modifications and changes can be made without departing from the scope of the claims.

DESCRIPTION OF SYMBOLS 1 Path allocation device 11 Input device 12 Output device 13 Drive device 14 Auxiliary storage device 15 Main storage device 16 Arithmetic processing device 17 Interface device 21 Path allocation engine 22 Path allocation display part 23 Station event file 24 Processing order table 25, 25a Path time Table 26 Improved path time table 27 Local path time table 28 Storage path time table 31-33 Table 51 Target satellite table 52 Antenna priority case table 53 Antenna-specific satellite priority table 54 Path request table 61 Path time table default creation unit 62 Processing order table creation unit 63 Path allocation unit for each antenna / satellite 64 Duplicate determination unit 71 Chart display unit 72 Path allocation change unit 73 Duplicate determination unit 74 File reread unit 75 File storage unit 00 Path allocation result back to the chart 101, 102 the input field 103 display button 104 path 105 overlap check button 106 duplicate path 107 yuan button 108 enter button

Claims (6)

A computer that performs path assignment, which is the source of the antenna operation plan when tracking multiple satellites with multiple antennas,
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation unit for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation section for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation program that functions as a path allocation unit that creates a path time table for each case by performing path allocation so as not to overlap and updating an initial value of an allocation flag of the path time table based on a path allocation result.   The path allocation program further performs path allocation so as not to exceed the requested path number based on a path request table in which a requested path number that is the requested number of paths to be allocated is set for each combination of antenna and satellite. 1. The path allocation program according to 1.   The path allocation program according to claim 2, wherein the path allocation unit further performs path allocation at the allocated path interval based on a path request table in which an allocated path interval is set for each combination of antenna and satellite.   The path allocation unit further supports continuous path operation based on a path request table in which the presence / absence of continuous path operation performed by switching communication links and the conditions for continuous path operation are set for each combination of antenna and satellite. The path allocation program according to claim 3, which performs path allocation. A path allocation device that performs path allocation as a source of an antenna operation plan when tracking multiple satellites with multiple antennas,
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation unit for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation section for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation apparatus comprising: a path allocation unit that generates a path time table for each case, wherein path allocation is performed so as to avoid duplication and update an initial value of an allocation flag of the path time table based on a path allocation result. A path allocation method for performing path allocation as a source of an antenna operation plan when tracking a plurality of satellites executed by a computer with a plurality of antennas,
The computer is
Based on the antenna priority table for each antenna in which the priority of each satellite is set and the antenna priority case table in which a plurality of antenna priorities are set, the order of combinations of antennas and satellites for which path allocation processing is performed for each case is described. A processing order table creation step for creating the set processing order table;
Allocation indicating path time, visible time, and path allocation result for each combination of antenna, satellite, and path based on a file that sets the visible time zone of the satellite for each antenna and the target satellite table that sets the orbit type and operation time for each satellite. A path time table default creation step for creating a path time table in which initial values of flags are set;
Based on the combination order of antennas and satellites for performing the path allocation processing for each case set in the processing order table, the path time and the visible time are set for the antenna, satellite and path combinations set in the path time table. A path allocation method for performing path allocation so as not to overlap each other by using the path allocation table, and generating a path time table in which an initial value of an allocation flag of the path time table is updated based on a path allocation result for each case. .

Images