Online scheduling of distributed Earth observation satellite system under rigid communication constraints

This paper focused on online scheduling of distributed Earth observation satellite system in a dynamic environment. The objective was to maximize the total profit of the overall system by efficiently coordinating the different satellites with stochastic arrival of urgent tasks, subject to rigid communication and observation time window constraints. We formulated this problem as a single-task, single-robot, time-extended assignment problem with intra-schedule dependency using the multi-robot task assignment taxonomy and formulated the sub-problem after releasing urgent tasks in a mixed-integer linear programming model. We first described the online scheduling algorithm for a single satellite, then we proposed the modified consensus-based bundle algorithm (m-CBBA) and modified asynchronous consensus-based bundle algorithm (m-ACBBA) with synchronous and asynchronous communication, respectively. Compared with initial versions of CBBA and ACBBA, the modified versions added the communication loop prediction phases to efficiently utilize scarce communication opportunities and reduce the communication requirements. Additionally, we introduce two contract net protocol (CNP)-based algorithms for comparison, respectively SingleItem-CNP-based (SI-CNP) algorithm and Batch-CNP-based (BA-CNP) algorithm. Computational experiments indicated that both the total profit and percentage of scheduled urgent tasks achieved by the m-ACBBA and m-CBBA algorithms were much higher than those achieved by both SI-CNP and BA-CNP. Additionally, the number of communications needed by either m-ACBBA or m-CBBA algorithm was lower than that by SI-CNP. When the communication cost in the system is high, the m-CBBA algorithm is preferred because it balances the profit and the required number of communications. When the communication cost is low, the m-ACBBA algorithm is preferred because it achieves high total profit and high percentage of scheduled urgent tasks.     

Adaptive suppression of passive intermodulation in digital satellite transceivers

For the performance issues of satellite transceivers suffering passive intermodulation interference,a novel and effective digital suppression algorithm is presented in this paper.In con trast to analog approaches,digital passive intermodulation (PIM) suppression approaches can be easily reconfigured and therefore are highly attractive for future satellite communication systems.A simplified model of nonlinear distortion from passive microwave devices is established in consid eration of the memory effect.The multiple high-order PIM products falling into the receiving band can be described as a bilinear predictor function.A suppression algorithm based on a bilinear poly nomial decorrelated adaptive filter is proposed for baseband digital signal processing.In consideration of the time-varying characteristics of passive intermodulation,this algorithm can achieve the rapidness of online interference estimation and low complexity with less consumption of resources.Numerical simulation results show that the algorithm can effectively compensate the passive intermodulation interference,and achieve a high signal-to-interference ratio gain.     

Simultaneous state and actuator fault estimation for satellite attitude control systems

In this paper, a new nonlinear augmented observer is proposed and applied to satellite attitude control systems. The observer can estimate system state and actuator fault simultaneously. It can enhance the performances of rapidly-varying faults estimation. Only original system matrices are adopted in the parameter design. The considered faults can be unbounded, and the proposed augmented observer can estimate a large class of faults. Systems without disturbances and the fault whose finite times derivatives are zero piecewise are initially considered, followed by a discussion of a general situation where the system is subject to disturbances and the finite times derivatives of the faults are not null but bounded. For the considered nonlinear system, convergence conditions of the observer are provided and the stability analysis is performed using Lyapunov direct method. Then a feasible algorithm is explored to compute the observer parameters using linear matrix inequalities (LMIs). Finally, the effectiveness of the proposed approach is illustrated by considering an example of a closed-loop satellite attitude control system. The simulation results show satisfactory perfor-mance in estimating states and actuator faults. It also shows that multiple faults can be estimated successfully.     

基于姿态偏置的卫星天线方向图在轨测试实现

针对静止轨道通信卫星在轨测试期间天线方向图测试的需求,分析了天线方向图测试的方法。针对利用姿态机动进行天线方向图测试问题,给出了地面操作及操作计划制订方法,并通过工程实际验证了该方法的有效性。     

卫星导航定位方程的病态条件

定位精度因子(PDOP)上限取值是导航星座设计及其性能评价的基本依据。本文系统地论述卫星导航定位方程及其精度评定算法以及线性方程病态条件,通过实测和仿真数值试验结果对比分析,详细论证PDOP与卫星导航定位方程病态条件的关系,进而确定PDOP上限取值,以满足实际工程应用需求。     

基于区块链+北斗的铁路装备可信数字身份服务方法

智能铁路装备是一个典型的分布式物联系统,具有大量复杂的数据交互共享的需求与场景,装备及其产生的数据信令在系统中的数字身份标识是其重要安全基础。应用基于区块链去中心化的分布式数字身份标识技术,结合北斗时空信息,设计了铁路装备身份标识(railway decentralized identifier, RDID)可信数字身份服务,包括服务架构、生成流程、流转流程和验证流程,并进行了应用模型实现与效能分析。服务可以有效提升装备及其产生的数据信令的规范安全性,保证标识身份全局唯一,可追溯认证,从而提高智能装备系统通信过程数据的完整性与可靠性。     

基于时频二维估计的卫星导航失锁快速重定位技术

卫星导航接收机在天线受到遮挡或者弱信号环境中易出现信号失锁现象,信号恢复后的重定位时间成为接收机的一项重要性能指标。提出一种基于时频二维估计、适用于中低动态应用场景的失锁快速重定位技术,利用信号失锁前测量的载波多普勒频率和码相位等信息对失锁后的多普勒频率及码相位进行估计,信号恢复后直接启用信号跟踪,无需进行位同步和帧同步,即可实现快速重定位。对该技术进行工程实现及试验验证,结果表明信号输入功率高于–145dBm(积分时间为10ms)、失锁时间小于60s时,接收机重定位时间在1s以内。     

一种新的卫星通信系统中的载波频率同步技术

针对卫星通信中传统载波频偏估计算法精度低的问题,提出一种新的频偏估计方法。该方法首先利用传统方法在解调前端进行初始频偏估计,然后充分利用译码信息对残留频偏进行进一步估计和补偿。仿真结果表明,该方法可有效抑制传统频偏估计方法带来的残留频偏的波动,减少残留频偏对系统性能的影响,提高了系统译码性能,降低了解调门限,在不占用系统频带的同时,提高了系统功率利用率。     

Optimization of communication network topology for navigation sharing among distributed satellites

Navigation sharing among distributed satellites is quite important for coordinated motion and collision avoidance. This paper proposes optimization methods of the communication network topology to achieve navigation sharing. The whole communication network constructing by inter-satellite links are considered as a topology graph. The aim of this paper is to find the communication network topology with minimum communication connections’ number (MCCN) in different conditions. It has found that the communication capacity and the number of channels are two key parameters affecting the results. The model of MCCN topology for navigation sharing is established and corresponding method is designed. Two main scenarios, viz., homogeneous case and heterogeneous case, are considered. For the homogeneous case where each member has the same communication capacity, it designs a construction method (Algorithm 1) to find the MCCN topology. For the heterogeneous case, it introduces a modified genetic algorithm (Algorithm 2) to find the MCCN topology. When considering the fact that the number of channels is limited, the Algorithm 2 is further modified by adding a penalized term in the fitness function. The effectiveness of these algorithms is all proved in theoretical. Three examples are further tested to illustrate the methods developed in this paper.