CN112910782B - Method for realizing minimum time delay of space teleoperation system based on relay communication - Google Patents
Method for realizing minimum time delay of space teleoperation system based on relay communication Download PDFInfo
- Publication number
- CN112910782B CN112910782B CN202110008674.6A CN202110008674A CN112910782B CN 112910782 B CN112910782 B CN 112910782B CN 202110008674 A CN202110008674 A CN 202110008674A CN 112910782 B CN112910782 B CN 112910782B
- Authority
- CN
- China
- Prior art keywords
- relay
- circular orbit
- base station
- orbit
- star
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18515—Transmission equipment in satellites or space-based relays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention relates to a method for realizing minimum time delay of a space teleoperation system based on relay communication, which is characterized in that an orbit equation of a spherical surface of the earth, each base station and each relay star is defined based on a relay communication topological structure of 3 equator circular orbit relay stars and 3 polar region circular orbit relay stars; and configuring subscript values corresponding to the initial coordinates, and judging the shortest and connected links and solving corresponding time delay values. On the premise of ensuring the space teleoperation target of 'full earth coverage, full time and full orbit', the invention designs a 'shortest and connected communication link search algorithm', dynamically realizes the selection of the optimal (shortest and connected) communication link, further ensures the dynamic minimization of time delay at each moment, and provides basis and possibility for the control algorithm to ensure the control performance of the system.
Description
Technical Field
The invention belongs to the technical field of robot control, relates to a method for realizing minimum time delay of a space teleoperation system based on relay communication, and particularly relates to a method for realizing optimal communication link selection and minimum time delay of a global full-coverage, full-time-period and full-orbit space teleoperation system based on relay communication.
Background
The space robot teleoperation system is used as a man-machine hybrid intelligent control system and has wide application prospect. Among them, having "global full coverage (global), full time (continuous), full orbit (high, middle, low orbit)" teleoperation capability is the ultimate goal of future space teleoperation system. The achievement of the target requires that the world communication must be continuous, stable and reliable. Therefore, the delicate relay communication topology design is very important. However, the introduction of complex relay communication causes larger and more complex communication delay of the space teleoperation system. It is well known that many control algorithms can overcome the effects of constant or small time varying delays to achieve a desired performance level. However, when there is a large and complex time-varying delay, the telepresence of the teleoperation system is rapidly reduced, and even the stability of the teleoperation system cannot be guaranteed.
Thus, on the premise that latency is allowed or admitted to exist: how to determine a dynamically optimal (shortest and connected) communication link on the basis of the existing relay communication topological structure to realize the optimal (minimum) time delay at each moment, so that the control algorithm can ensure the stability and the optimal performance of the system, and the method is a work with great theoretical and practical significance.
Disclosure of Invention
Technical problem to be solved
In order to avoid the defects of the prior art, the invention provides a method for realizing the minimum time delay of a space teleoperation system based on relay communication.
Technical scheme
A method for realizing minimum time delay of a space teleoperation system based on relay communication is characterized by comprising the following steps:
step 1: establishing a base coordinate system with an origin at the "earth" center of sphere O (0,0,0), given orbital parameters, including the "earth" radius R E Equator/polar earth circular orbit relay star orbit radius R RS Focus F of long semi-axis of inclined elliptic orbit of' space base station 1 Short semi-axis focus F 2 Orbit radius R of ground base station GB And vertical coordinate
Giving the number N of the relay stars and the storage space of the time delay value: d STS Positive integer n, positive integer nn, time variable t, sampling period t Sample And test ofEnd time T end ;
Step 2: collection point set
Set of points on the "earth" sphere: xi E ={(x E ,y E ,z E )},
Set of points on the "ground base station" motion trajectory: xi GB ={(x GB ,y GB ,z GB ) Xi, and xi GB ∈Ξ E
set of points on the "spatial base station" motion trajectory: xi SB ={(x SB ,y SB ,z SB )}
And 3, step 3: calculating a Point set xi GB 、Ξ SB The number of midpoints, and assigning the number to a variable
Wherein size () is a function of the number of points in the set of solved points;
configuring subscript values corresponding to initial coordinates of the ground base station, the space base station, 3 equatorial circular orbit relay stars and 3 polar circular orbit relay stars:
wherein: i.e. i GB And i SB Respectively representing subscript values, i, corresponding to initial coordinates of ' ground base station ' and ' space base station RS1 、i RS2 And i RS3 Respectively represent subscript values, i, corresponding to the initial coordinates of 3 "relay stars" in the polar circular orbit RS4 、i RS5 And i RS6 Subscript values corresponding to initial coordinates of 3 relay stars in the equatorial orbit are respectively represented;
and 4, step 4:
1. making respective corresponding motion tracks according to the following equations
wherein: a. b, c, d and f are parameters of an elliptic orbit equation;
2. the positions of the ground base station, the space base station and the relay stars at the current time t in the basic coordinate system are given and drawn at the corresponding positions:
<1>if it is notThen at position xi SB (i SB ) Draw "spatial basestation" and xi SB (i SB )=(x SB (i SB ),y SB (i SB ),z SB (i SB ) ); if it isThen let i SB =1, and at position xi SB (i SB ) Drawing a space base station;
<2>if it is notThen at position xi GB (i GB ) Here, a "ground BS" is drawn, and xi GB (i GB )=(x GB (i GB ),y GB (i GB ),z GB (i GB ) ); if it isThen let i GB =1, and at position xi GB (i GB ) Drawing a ground base station;
<3>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 1, andif it isThen let i RS1 =1, and at a positionA polar region circular orbit relay star 1 is drawn;
<4>if it is usedThen at the positionThe place is drawn as a polar region circular orbit relay star 2, andif it isThen let i RS2 =1, and at a positionA polar region circular orbit relay star 2 is drawn;
<5>if it is usedThen at the positionThe place is drawn as a polar region circular orbit relay star 3', andif it isThen let i RS3 =1, and at a positionA polar region circular orbit relay star 3 is drawn;
<6>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 4If it isThen let i RS4 =1, and at a positionA polar region circular orbit relay star 4 is drawn;
<7>if it is notIs in positionThe place is drawn as a polar region circular orbit relay star 5If it isThen let i RS5 =1, and at a positionA polar region circular orbit relay star 5 is drawn;
<8>if it is usedThen at the positionThe place is drawn as a polar region circular orbit relay star 6If it isThen let i RS6 =1, and at a positionA polar region circular orbit relay star 6 is drawn;
and 5: the "connection points" involved in the communication link include: a ground base station, a space base station, a polar region circular orbit relay star 1, a polar region circular orbit relay star 2, a polar region circular orbit relay star 3, an equatorial circular orbit relay star 4, an equatorial circular orbit relay star 5 and an equatorial circular orbit relay star 6;
1) Each "connection point" is defined and assigned as follows:
the ground base station is a connection point A, and has A = xi GB (i GB ) (ii) a The polar region circular orbit relay star 1 is a connecting point B and is provided withThe polar region circular orbit relay star 2 is a connecting point C and is provided withThe polar region circular orbit relay star 3 is a connecting point D and is provided with"relay star 4 on equatorial orbit" is a connection point E and hasThe 'equator orbit relay star 5' is a connecting point F and is provided with"equatorial orbit relay star 6" is the connection point G and has"spatial base station" is a connection point H, and has H = xi SB (i SB );
2) Calling a shortest and connected communication Link searching algorithm to search the shortest and connected communication Link corresponding to the current time t min And outputting the corresponding time delay value D STS (nn);
3) And (3) calculating:
And N is a positive integer.
Advantageous effects
The invention provides a method for realizing minimum time delay of a space teleoperation system based on relay communication, which is based on a relay communication topological structure of 3 equator circular orbit relay stars and 3 polar region circular orbit relay stars, and designs a shortest and connected communication link search algorithm on the premise of ensuring the space teleoperation target of earth full coverage, full time and full orbit, thereby dynamically realizing optimal (shortest and connected) communication link selection, further ensuring the dynamic minimization of time delay at each moment, and providing a basis and possibility for a control algorithm to ensure the control performance of the system.
The invention has the innovation points that: 1) The method is characterized by comprising the following steps of firstly researching the dynamic optimal (shortest, connected) problem of a communication link and the corresponding dynamic optimal (minimum) problem of time delay under the space teleoperation target of earth full coverage, full time and full orbit; 2) A ' shortest and connected communication link search algorithm ' is designed, the principle of ' stepwise traversal ' shortest path solving and ' stage judgment ' connectivity ' is ingeniously adopted, and the improvement of the algorithm operation efficiency is realized on the premise of ensuring the optimal (shortest and connected) communication link and the optimal (minimum) time delay at each moment. The idea of adopting this principle is: under the mode of gradually traversing and solving the shortest path, the link length of the next stage is definitely larger than the link 'shortest communication path' length of the previous stage; 3) In a shortest and connected communication link search algorithm, a point-vector-ball geometric structure method is innovatively provided for solving the connection rate and judging the connection. The algorithm is based on three geometric figures, namely points, vectors and balls, and judges the connectivity of a communication link through the mutual relation among the points, the vectors and the balls. Therefore, the algorithm is named as "point-vector-sphere" geometry method. The algorithm has strong practicability due to the fact that the algorithm is based on geometry.
Drawings
FIG. 1: relay communication topology structure diagram of' 3 equator circular orbit relay stars +3 polar earth circular orbit relay stars
FIG. 2: shortest and connected communication link searching algorithm
FIG. 3: point-vector-sphere geometric construction method
Detailed Description
The invention will now be further described with reference to the following examples and drawings:
the optimal communication link selection and the minimum time delay realization of the earth full-coverage, full-time and full-orbit space teleoperation system based on relay communication are realized by the following steps:
the method comprises the following steps: initializing;
step two: defining an orbit equation of a terrestrial sphere and each base station and relay satellite;
step three: configuring subscript values corresponding to the initial coordinates;
step four: judging whether the test is terminated;
step five: dynamic mapping;
step six: and judging the shortest and connected link and solving the corresponding time delay value.
The method comprises the following specific steps:
the method comprises the following steps:
1) Establishing a basic coordinate system with the 'earth' sphere center O (0,0,0) as an origin;
2) Given the orbit parameters: radius of the earth R E =6370000m, equatorial/polar circular orbit "relay star" orbit radius R RS =35786000m, "space base station" inclined ellipse orbit long (short) half axis focus F 1 =11370004m(F 2 =25370000 m), "ground base station" orbit radius R GB 6370000m and vertical coordinate
3) Given the number of "relay stars" N =6 (positive integer), the time delay value storage space: d STS =0, positive integer n =1, positiveInteger nn =1, time variable t =0, sampling period t Sample =0.01s and test termination time T end =50s;
Step two:
1) Given the "earth" spherical equation:
xi (xi) E ={(x E ,y E ,z E ) Represents a set of points on the "earth" sphere;
2) Given the "ground base station" orbit equation:
xi (xi) GB ={(x GB ,y GB ,z GB ) Means a set of points on the "ground basestation" motion trajectory, and xi GB ∈Ξ E ;
3) Given the equation of the orbit of the "relay star on the equator orbit":
4) Given the equation of the orbit of the 'polar region circular orbit relay star':
5) Given the "spatial base station" orbit equation:
wherein a, b, c, d and f are parameters of an elliptic orbit equation, and xi SB ={(x SB ,y SB ,z SB ) Denotes the set of points on the "spatial base station" motion trajectory;
step three:
1) Calculating xi in step two GB 、Ξ SB The number of midpoints, and assigning the number to a variable
Wherein size (·) is a function of the number of points in the point set;
2) Allocating subscript values corresponding to initial coordinates of a ground base station, a space base station, 3 equator circular orbit relay stars and 3 polar circular orbit relay stars:
wherein i GB And i SB Respectively representing subscript values, i, corresponding to initial coordinates of ' ground base station ' and ' space base station RS1 、i RS2 And i RS3 Respectively represent the beginnings of 3 'relay stars' in the circular orbit of the polar regionSubscript value i corresponding to the start coordinate RS4 、i RS5 And i RS6 Subscript values corresponding to initial coordinates of 3 relay stars in the equatorial orbit are respectively represented;
step four:
1) Drawing an earth spherical surface according to a formula (1.1) and drawing motion orbits corresponding to a ground base station, an equator circular orbit relay star, a polar circular orbit relay star and a space base station respectively according to formulas (1.2) to (1.5);
2) The positions of the ground base station, the space base station and the relay stars at the current time t in the basic coordinate system are given and drawn at the corresponding positions as follows:
<1>if it is notThen at position xi SB (i SB ) Draw "spatial basestation" and xi SB (i SB )=(x SB (i SB ),y SB (i SB ),z SB (i SB )). If it isThen let i SB =1, and at position xi SB (i SB ) Drawing a space base station;
<2>if it is notThen at position xi GB (i GB ) Here, a "ground BS" is drawn, and xi GB (i GB )=(x GB (i GB ),y GB (i GB ),z GB (i GB )). If it isThen let i GB =1, and at position xi GB (i GB ) Drawing a ground base station;
<3>if it is notThen at the positionThe place shows a polar region circular orbit relay star 1, andif it isThen let i RS1 =1, and at a positionA polar region circular orbit relay star 1 is drawn;
<4>if it is notThen at the positionDraw a polar region circular orbit relay star 2' andif it isThen let i RS2 =1, and at a positionA polar region circular orbit relay star 2 is drawn;
<5>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 3', andif it isThen let i RS3 =1, and at a positionA polar region circular orbit relay star 3 is drawn;
<6>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 4If it isThen let i RS4 =1, and at a positionA polar region circular orbit relay star 4 is drawn;
<7>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 5If it isThen let i RS5 =1, and at a positionA polar region circular orbit relay star 5 is drawn;
<8>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 6If it isThen let i RS6 =1, and at a positionA polar region circular orbit relay star 6 is drawn;
step six:
the "connection points" involved in the communication link mainly include: a ground base station, a space base station, a polar circular orbit relay star 1, a polar circular orbit relay star 2, a polar circular orbit relay star 3, an equatorial circular orbit relay star 4, an equatorial circular orbit relay star 5 and an equatorial circular orbit relay star 6.
4) Each "connection point" is defined and assigned as follows:
the ground base station is a connection point A, and has A = xi GB (i GB ) (ii) a The polar region circular orbit relay star 1 is a connecting point B and is provided withThe polar region circular orbit relay star 2 is a connecting point C and is provided withThe polar region circular orbit relay star 3 is a connecting point D and is provided with"equator orbit relay star 4" is the connection pointE, and hasThe equator orbit relay star 5 is a connecting point F and is provided with"relay star 6 on equatorial orbit" is a connection point G and has"spatial base station" is a connection point H, and has H = xi SB (i SB );
5) Calling a 'shortest and connected communication Link searching algorithm (figures 2 and 3)', and searching the 'shortest and connected' communication Link corresponding to the current time t min And outputting the corresponding time delay value D STS (nn)。
6) Order to
Step five:
1) If T > T end And outputting a time delay value set D after the test is finished STS ;
2) Otherwise, step four is executed.
Claims (2)
1. A method for realizing minimum time delay of a space teleoperation system based on relay communication is characterized by comprising the following steps:
step 1: establishing a base coordinate system with an origin at the "earth" center of sphere O (0,0,0), given orbital parameters, including the "earth" radius R E Equator/polar earth circular orbit relay star orbit radius R RS Focus F of long semi-axis of inclined elliptic orbit of' space base station 1 Short semi-axis focus F 2 Orbit radius R of' ground base station GB And vertical coordinate
Giving the number N of the relay stars and the storage space of the time delay value: d STS Positive integer n, positive integer nn, time variable t, sampling period t Sample And test termination time T end ;
Step 2: collection point set
Set of points on the "earth" sphere: xi E ={(x E ,y E ,z E )},
Set of points on the "ground base station" motion trajectory: xi GB ={(x GB ,y GB ,z GB ) Xi and xi GB ∈Ξ E
set of points on the "spatial base station" motion trajectory: xi SB ={(x SB ,y SB ,z SB )}
And step 3: calculating xi Dian set GB 、Ξ SB The number of midpoints, and assigning the number to a variable
Wherein size (·) is a function of the number of points in the point set;
configuring subscript values corresponding to initial coordinates of the ground base station, the space base station, 3 equatorial circular orbit relay stars and 3 polar circular orbit relay stars:
wherein: i all right angle GB And i SB Respectively represents subscript values i corresponding to initial coordinates of a ground base station and a space base station RS1 、i RS2 And i RS3 Index values i corresponding to the initial coordinates of 3 "relay stars" in the polar circular orbit RS4 、i RS5 And i RS6 Subscript values corresponding to initial coordinates of 3 relay stars in the equatorial orbit are respectively represented;
and 4, step 4:
1. making respective corresponding motion tracks according to the following equations
wherein: a. b, c, d and f are parameters of an elliptic orbit equation;
2. giving the positions of the current time t, namely the ground base station, the space base station and each relay satellite in a basic coordinate system, and drawing the positions at corresponding positions:
<1>if it is notThen at position xi SB (i SB ) Draw "spatial basestation" and xi SB (i SB )=(x SB (i SB ),y SB (i SB ),z SB (i SB ) ); if it isThen let i SB =1, and at position xi SB (i SB ) Drawing a space base station;
<2>if it is notThen at position xi GB (i GB ) Here, a "ground BS" is drawn, and xi GB (i GB )=(x GB (i GB ),y GB (i GB ),z GB (i GB ) ); if it isThen let i GB =1, and at position xi GB (i GB ) Drawing a ground base station;
<3>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 1, andif it isThen let i RS1 =1, and in positionA polar region circular orbit relay star 1 is drawn;
<4>if it is notIs in positionThe place is drawn as a polar region circular orbit relay star 2, andif it isThen let i RS2 =1, and in positionA polar region circular orbit relay star 2 is drawn;
<5>if it is notThen at the positionThe place is drawn as a polar region circular orbit relay star 3', andif it isThen let i RS3 =1, and at a positionA polar region circular orbit relay star 3 is drawn;
<6>if it is usedThen at the positionThe place is drawn as a polar region circular orbit relay star 4If it isThen let i RS4 =1, and in positionA polar region circular orbit relay star 4 is drawn;
<7>if it is notThen at the positionThe 'polar region circular orbit relay star 5' is drawn atIf it isThen let i RS5 =1, and at a positionA polar region circular orbit relay star 5 is drawn;
<8>if it is usedThen at the positionThe place is drawn as a polar region circular orbit relay star 6If it isThen let i RS6 =1, and at a positionA polar region circular orbit relay star 6 is drawn;
and 5: the "connection points" involved in the communication link include: a ground base station, a space base station, a polar region circular orbit relay star 1, a polar region circular orbit relay star 2, a polar region circular orbit relay star 3, an equatorial circular orbit relay star 4, an equatorial circular orbit relay star 5 and an equatorial circular orbit relay star 6;
1) Each "connection point" is defined and assigned as follows:
the ground base station is a connection point A, and has A = xi GB (i GB ) (ii) a The polar region circular orbit relay star 1 is a connecting point B and is provided withThe polar region circular orbit relay star 2 is a connecting point C and is provided withThe polar region circular orbit relay star 3 is a connecting point D and is provided with"relay star 4 on equatorial orbit" is a connection point E and hasThe 'equator orbit relay star 5' is a connecting point F and is provided with"relay star 6 on equatorial orbit" is a connection point G and has"spatial base station" is a connection point H, and has H = xi SB (i SB );
2) Calling a shortest and connected communication Link searching algorithm to search the shortest and connected communication Link corresponding to the current time t min And outputting the corresponding time delay value D STS (nn);
3) And (3) calculating:
step 6, judging: if T > T end Ending and outputting the time delay value set D STS Otherwise, step 4 is executed.
2. The method for implementing minimum delay of a spatial teleoperation system based on relay communication according to claim 1, wherein: and N is a positive integer.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110008674.6A CN112910782B (en) | 2021-01-05 | 2021-01-05 | Method for realizing minimum time delay of space teleoperation system based on relay communication |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110008674.6A CN112910782B (en) | 2021-01-05 | 2021-01-05 | Method for realizing minimum time delay of space teleoperation system based on relay communication |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112910782A CN112910782A (en) | 2021-06-04 |
CN112910782B true CN112910782B (en) | 2022-11-22 |
Family
ID=76112157
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110008674.6A Active CN112910782B (en) | 2021-01-05 | 2021-01-05 | Method for realizing minimum time delay of space teleoperation system based on relay communication |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112910782B (en) |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101552933A (en) * | 2009-05-04 | 2009-10-07 | 中国人民解放军空军工程大学 | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route |
CN102457910A (en) * | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Common search space mapping method of relay node (RN) and apparatus thereof |
CN104333408A (en) * | 2014-09-26 | 2015-02-04 | 航天东方红卫星有限公司 | Inter-satellite communication system used for realizing high-dynamic and low-delay space teleoperation |
CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
CN107154819A (en) * | 2017-03-31 | 2017-09-12 | 南京邮电大学 | A kind of satellite relay selection optimization method based on geographical location information |
CN110881198A (en) * | 2019-12-06 | 2020-03-13 | 上海交通大学 | Link allocation method based on competition decision idea in deep space network |
CN111025995A (en) * | 2019-12-26 | 2020-04-17 | 北京空间技术研制试验中心 | Space manipulator teleoperation communication system based on space-based relay communication |
CN111464224A (en) * | 2020-02-22 | 2020-07-28 | 华中科技大学 | Relay communication method and system |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FI106676B (en) * | 1998-09-08 | 2001-03-15 | Nokia Networks Oy | Method and system for detecting network elements that act as rail stations in telecommunications and a network element for a telecommunications network with cell radio construction |
US20110069637A1 (en) * | 2009-09-18 | 2011-03-24 | Futurewei Technologies, Inc. | System and Method for Control Channel Search Space Location Indication for a Relay Backhaul Link |
US10924180B2 (en) * | 2017-05-05 | 2021-02-16 | Via Space Networks Inc. | Low latency satellite communication relay network |
CN107749773B (en) * | 2017-09-25 | 2022-09-02 | 全球能源互联网研究院 | Satellite communication system and communication method thereof |
CN111953399B (en) * | 2020-07-10 | 2022-06-17 | 东南大学 | Inter-satellite routing method in low-earth-orbit satellite communication network |
-
2021
- 2021-01-05 CN CN202110008674.6A patent/CN112910782B/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101552933A (en) * | 2009-05-04 | 2009-10-07 | 中国人民解放军空军工程大学 | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route |
CN102457910A (en) * | 2010-10-18 | 2012-05-16 | 中兴通讯股份有限公司 | Common search space mapping method of relay node (RN) and apparatus thereof |
CN104333408A (en) * | 2014-09-26 | 2015-02-04 | 航天东方红卫星有限公司 | Inter-satellite communication system used for realizing high-dynamic and low-delay space teleoperation |
CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
CN107154819A (en) * | 2017-03-31 | 2017-09-12 | 南京邮电大学 | A kind of satellite relay selection optimization method based on geographical location information |
CN110881198A (en) * | 2019-12-06 | 2020-03-13 | 上海交通大学 | Link allocation method based on competition decision idea in deep space network |
CN111025995A (en) * | 2019-12-26 | 2020-04-17 | 北京空间技术研制试验中心 | Space manipulator teleoperation communication system based on space-based relay communication |
CN111464224A (en) * | 2020-02-22 | 2020-07-28 | 华中科技大学 | Relay communication method and system |
Non-Patent Citations (2)
Title |
---|
Tatsuya Mukai ; Shinichi Inagawa ; Kiyohisa Suzuki.A study of free space laser communication experiment on the ISS Japanese experiment module for space explorations.《2015 IEEE International Conference on Space Optical Systems and Applications (ICSOS)》.2015, * |
临近空间高速飞行器低轨卫星;魏金鑫;《中国优秀硕士学位论文全文数据库》;20180615;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN112910782A (en) | 2021-06-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109474326B (en) | Beam switching method and device | |
CN109495160B (en) | Low-earth-orbit communication satellite constellation and gateway station communication planning method | |
Wei et al. | Application of edge intelligent computing in satellite Internet of Things | |
Hu et al. | A vision of an XR-aided teleoperation system toward 5G/B5G | |
WO2021203575A1 (en) | Satellite-terrestrial information network unified routing method based on hyperbolic geometry | |
CN113315569B (en) | Satellite reliability routing method and system with weighted link survival time | |
CN110336751B (en) | Low-orbit satellite network routing strategy based on membership function | |
CN113141622B (en) | Distributed route management method for ultra-large-scale low-orbit satellite constellation | |
CN111225353B (en) | Indoor positioning system and method based on cooperation of virtual cell and macro cell | |
Breitenmoser et al. | Distributed coverage control on surfaces in 3d space | |
CN114779827B (en) | Virtual potential field collaborative obstacle avoidance topological control method based on heterogeneous unmanned aerial vehicle formation | |
CN113098583B (en) | Air-space-ground integrated networking method for tracking air moving target | |
CN112327899B (en) | Variable-configuration quadruped robot motion control method and system | |
CN112083727B (en) | Multi-autonomous system distributed collision avoidance formation control method based on speed obstacle | |
CN112902971B (en) | Robot motion trajectory calculation method based on Gaussian sampling and target deviation guidance and based on fast-expansion random tree algorithm, electronic equipment and storage medium | |
CN112910782B (en) | Method for realizing minimum time delay of space teleoperation system based on relay communication | |
CN114221691A (en) | Software-defined air-space-ground integrated network route optimization method based on deep reinforcement learning | |
CN113799141A (en) | Six-degree-of-freedom mechanical arm obstacle avoidance path planning method | |
Zha et al. | Satellite lifetime predicted greedy perimeter stateless routing protocol for LEO satellite network | |
CN112532296B (en) | Large-scale satellite network construction method based on elliptical satellite coverage | |
CN110932771A (en) | Constellation design method suitable for orthogonal circular orbit constellation configuration | |
CN113395706B (en) | Particle swarm algorithm-based heterogeneous unmanned aerial vehicle three-dimensional space deployment method and device | |
Pereira et al. | Multi-robot planning using robot-dependent reachability maps | |
Shu et al. | Mobility prediciton clustering routing in UAVs | |
CN114640621B (en) | Routing method based on uncertain link parameters in low-orbit satellite network |
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 | ||
GR01 | Patent grant | ||
GR01 | Patent grant |