Processing math: 31%
Research article

The Cowles–Jones test with unspecified upward market probability

  • The Cowles-Jones test for sign dependence is one of the earliest tests of the random walk hypothesis, which stands at the beginning of modern empirical finance. The test is still discussed in popular textbooks and used in research articles. However, the Cowles-Jones test statistic considered in the literature requires that the upward probability of the market or asset under consideration be specified under the null hypothesis, which is only very rarely possible. If the upward probability is estimated in advance, the resulting test is undersized (even asymptotically). This note considers a corrected Cowles-Jones test statistic which does not require the upward probability to be specified under the null. It turns out that the asymptotic variance is greatly simplified as compared to the uncorrected test. The corrected test is illustrated with an application to daily returns of the Dow Jones Industrial Average index and monthly returns of the MSCI Emerging Markets index. It is shown that the corrected and uncorrected tests can lead to opposite conclusions.

    Citation: Markus Haas. The Cowles–Jones test with unspecified upward market probability[J]. Data Science in Finance and Economics, 2023, 3(4): 324-336. doi: 10.3934/DSFE.2023019

    Related Papers:

    [1] Cuicui Cai, Maosheng Fu, Xianmeng Meng, Chaochuan Jia, Mingjing Pei . Indoor high-precision visible light positioning system using Jaya algorithm. Mathematical Biosciences and Engineering, 2023, 20(6): 10358-10375. doi: 10.3934/mbe.2023454
    [2] Cheng Zhu, Yong Zhang, Xuhua Pan, Qi Chen, Qingyu Fu . Improved Harris Hawks Optimization algorithm based on quantum correction and Nelder-Mead simplex method. Mathematical Biosciences and Engineering, 2022, 19(8): 7606-7648. doi: 10.3934/mbe.2022358
    [3] Shuang Wang, Heming Jia, Qingxin Liu, Rong Zheng . An improved hybrid Aquila Optimizer and Harris Hawks Optimization for global optimization. Mathematical Biosciences and Engineering, 2021, 18(6): 7076-7109. doi: 10.3934/mbe.2021352
    [4] Yuheng Wang, Yongquan Zhou, Qifang Luo . Parameter optimization of shared electric vehicle dispatching model using discrete Harris hawks optimization. Mathematical Biosciences and Engineering, 2022, 19(7): 7284-7313. doi: 10.3934/mbe.2022344
    [5] Shenghan Li, Linlin Ye . Multi-level thresholding image segmentation for rubber tree secant using improved Otsu's method and snake optimizer. Mathematical Biosciences and Engineering, 2023, 20(6): 9645-9669. doi: 10.3934/mbe.2023423
    [6] Wang Cai, Jianzhuang Wang, Longchao Cao, Gaoyang Mi, Leshi Shu, Qi Zhou, Ping Jiang . Predicting the weld width from high-speed successive images of the weld zone using different machine learning algorithms during laser welding. Mathematical Biosciences and Engineering, 2019, 16(5): 5595-5612. doi: 10.3934/mbe.2019278
    [7] Hong Gao, Cuiyun Wu, Dunnian Huang, Dahui Zha, Cuiping Zhou . Prediction of fetal weight based on back propagation neural network optimized by genetic algorithm. Mathematical Biosciences and Engineering, 2021, 18(4): 4402-4410. doi: 10.3934/mbe.2021222
    [8] Feng Li, Zhongao Bi, Hongzeng Xu, Yunqi Shi, Na Duan, Zhaoyu Li . Design and implementation of a smart Internet of Things chest pain center based on deep learning. Mathematical Biosciences and Engineering, 2023, 20(10): 18987-19011. doi: 10.3934/mbe.2023840
    [9] Chun-Chao Yeh, Ke-Jia Jhang, Chin-Chun Chang . An intelligent indoor positioning system based on pedestrian directional signage object detection: a case study of Taipei Main Station. Mathematical Biosciences and Engineering, 2020, 17(1): 266-285. doi: 10.3934/mbe.2020015
    [10] Xinli Hu . Threshold dynamics for a Tuberculosis model with seasonality. Mathematical Biosciences and Engineering, 2012, 9(1): 111-122. doi: 10.3934/mbe.2012.9.111
  • The Cowles-Jones test for sign dependence is one of the earliest tests of the random walk hypothesis, which stands at the beginning of modern empirical finance. The test is still discussed in popular textbooks and used in research articles. However, the Cowles-Jones test statistic considered in the literature requires that the upward probability of the market or asset under consideration be specified under the null hypothesis, which is only very rarely possible. If the upward probability is estimated in advance, the resulting test is undersized (even asymptotically). This note considers a corrected Cowles-Jones test statistic which does not require the upward probability to be specified under the null. It turns out that the asymptotic variance is greatly simplified as compared to the uncorrected test. The corrected test is illustrated with an application to daily returns of the Dow Jones Industrial Average index and monthly returns of the MSCI Emerging Markets index. It is shown that the corrected and uncorrected tests can lead to opposite conclusions.



    Abbreviation: SFF: spacecraft formation flying; ETS: event triggered strategy; DETS: dynamic event triggered transmission strategy; ESO: extended state observer; FTSM: fast terminal sliding mode

    In advanced space technologies, spacecraft formation flying (SFF) technology has attracted considerable attention due to its evident advantages over traditional single spacecraft technology, such as low cost, high reliability, and greater flexibility. The applications of SFF technology have covered a wide range of space missions, including Earth observation, deep space exploration, on-orbit servicing and gravitational-wave detection [1,2,3]. For the SFF system, one of the main characteristics is that the spacecraft in the system should coordinate with each other to perform the specified mission, and thus it is crucial to design an efficient coordinated control strategy [4,5]. In general, the existing coordinated control strategies can be classified into centralized control strategies and decentralized control strategies, in which decentralized strategies have high reliability and strong robustness [6,7,8,9]. Therefore, for SFF system, the development of decentralized coordinated control strategies with distinguished potential in practical applications have received a great deal of research attention [10,11,12,13,14].

    In traditional decentralized coordinated control methods, each spacecraft is required to continuously broadcast its own real-time state and receive the real-time global state through the wireless communication network, which consumes significant communication resources and contains a large amount of redundant communication. However, restricted by current launch capability and wireless communication technology, the on-board communication modules are generally small in size and narrow in bandwidth, and a flood of unnecessary communication may cause congestion and packet loss. It is therefore essential to investigate coordinated control strategies with less communication bandwidth occupancy. In light of this, some recent investigations on SFF systems adopt an intermittent communication transmission strategy, called event triggered strategy (ETS), to schedule inter-spacecraft data transmission [15,16,17,18,19]. In ETS, the communication is only carried out when a pre-defined triggering condition is met, which significantly avoids the unnecessary communication waste caused by continuous communication transmission or periodic communication transmission [20,21]. More recently, a dynamic event triggered transmission strategy (DETS) that can further reduce the communication frequency has gained growing research interest [22]. By introducing an auxiliary dynamic variable, the average inter-event interval of DETS can be larger than that of the traditional static ETS, thereby reducing the communication consumption. However, there has been little work on DETS-based distributed coordinated control strategies for SFF systems.

    It should be pointed out that, a majority of the existing studies on SFF systems have been concerned with the asymptotical stability of the coordinated control strategy. However, the corresponding investigations on finite-time control strategy have attracted little research attention, not to mention the case where unmeasured velocity and event triggered transmission are taken into account. In fact, finite-time convergence performance is a very concerned indicator in engineering [23,24]. When performing real-time and emergency space missions, it is more desirable to achieve finite-time coordination of the SFF systems. It is, therefore, of essential practical significance to design an event-based velocity-free coordinated control strategy that can provide finite-time relative position coordination for SFF, which motivates this current study.

    In this paper, a finite-time velocity-free relative position coordinated control strategy based on DETS is proposed for SFF systems under an undirected communication graph. The entire design process of this control strategy is divided into the following four steps: First, considering the situation where the velocities of the spacecraft cannot be accurately measured, a finite-time extended state observer (ESO) is constructed to estimate the velocity information and the effects of non-linearity and disturbance of each spacecraft. Second, a DETS among spacecraft is designed to reduce communication burden. Further, on the basis of the proposed observer and ETS, a fast terminal sliding mode (FTSM) coordinated control law is developed to achieve finite-time coordination of the overall spacecraft formation. Finally, a numerical simulation is performed to demonstrate the effectiveness of the control law.

    The main contributions of this paper lie in the following folds:

    1) In this paper, a finite-time ESO is constructed to estimate the velocity information and the effects of non-linearity and disturbance of each spacecraft, which lays the foundation for the subsequent design of the finite-time controller.

    2) Different from the traditional static ETS employed in coordinated control for SFF, in this design, a DETS is introduced into the SFF system, which can reduce the communication burden among spacecraft more effectively than the static ETS.

    3) In this paper, we have make the first attempt to investigate the coordinated control law design problem for SFF systems where finite-time coordination, unmeasured velocity and the limited communication bandwidth among spacecraft are considered simultaneously.

    The arrangement of this paper is as follows. Preliminaries along with the problem formulation are exhibited in Section 2. The main results of the ESO based FTSM coordinated control law under DETS are presented in Section 3. The numerical simulation result is given in Section 4, to demonstrate the performance of the proposed control strategies. Conclusions are provided in Section 5.

    In fact, an SFF system is a typical kind of distributed network system in the aerospace area, and it realizes coordinated flight on the basis of information exchange between spacecraft. On the other hand, graph theory is a useful tool both in the description of information topology and in coordinated control design [25]. Therefore, similar to most existing spacecraft formation coordinated control strategies [15,16,17,18,19], in this paper, we employ the graph tool to describe the information transmission among spacecraft and to cope with the problem of coordinated control law design. In this subsection, we will introduce some basic definitions of graph.

    A graph Λ=(υ,ς,G) consists of a node set (limited and non-empty) υ={υ1,,υn}, an edge set (composed by ordered pairs of nodes) ςυ×υ and a weight adjacency matrix G=[gij]Rn×n. If all edges in a graph have no direction, the graph is classified as an undirected graph; otherwise, the graph is classified as a directed graph. For the weight adjacency matrix, the default value of gii is 0. If node υj can transmit information to node υi, namely (υi,υj)ς, the corresponding weighted adjacency coefficient gij>0. Obviously, when it comes to undirected graphs, there is gij=gji>0, once υi and υj are connected.

    The nonlinear dynamic model of SFF based on the relative position vector and relative velocity vector is established in this paper. The schematic diagram of the relative motion of SFF is shown in Figure 1, where S0 denotes the leading spacecraft while Si(i=1,2,n) denotes the ith follower. Two coordinate frames are introduced to describe the absolute motion and relative motion: the geocentric inertial coordinate frame COXYZ and the orbit coordinate frame of the leading spacecraft Coxyz. It should be noted that S0 does not have to be a real spacecraft, and it could be a virtual leader for a distributed SFF system, flying on an ideal Kepler orbit with its motion state known to all followers. Since we are not going to discuss issues related to spacecraft attitude, to simplify the analysis below, a spacecraft is considered as a particle. Then, the nonlinear relative position dynamic model of the ith spacecraft represented in the orbital coordinate frame of the virtual leader can be written as follows [1]:

    ˙ρi(t)=vi(t)˙vi(t)=Ci(˙θ(t))vi(t)+Di(˙θ(t),¨θ(t),ri(t))ρi(t)+Ni(ri(t),r0)+fdi(t)mi+fai(t)mi (1)
    Ci(˙θ(t))=2˙θ(t)[010100000]
    Di(˙θ(t),¨θ(t),ri(t))=μr3i(t)I3+[˙θ2(t)¨θ(t)0¨θ(t)˙θ2(t)0000]
    Ni(ri(t),r0)=μ[r0ri(t)+1r2000]T
    Figure 1.  Schematic representation of the SFF system.

    where ri(t)(i=0,1,2,n) denotes the position vector in the geocentric inertial coordinate frame, ρi(t)=ri(t)r0(i=1,2,n) denotes the relative position vector in the orbit coordinate frame, μ represents the gravitational coefficient of the earth, the angular velocity of the virtual leading spacecraft is denoted by θ(t), fdi(t) represents the external disturbance force, the control force of the ith spacecraft is denoted by fai(t), and the mass of each spacecraft is denoted by mi.

    For an SFF mission, there will be a predesigned configuration, which provides the expected position ρdi(t) and the expected velocity vdi(t)=˙ρdi(t) of each spacecraft. Subtracting the expected value from the real value, we obtain the position tracking error eρi(t)=ρi(t)ρdi(t) and velocity tracking error evi(t)=vi(t)vdi(t) of the ith spacecraft. Furthermore, the relative error dynamic model can be derived.

    ˙eρi(t)=evi(t)˙evi(t)=Ci(˙θ(t))vi(t)+Di(˙θ(t),¨θ(t),ri(t))ρi(t)+Ni(riv,r0)˙vdi(t)+fdi(t)mi+fai(t)mi (2)

    Considering the relative position keeping problem for distributed SFF without velocity information over limited communication bandwidth, this paper attempts to propose a finite-time coordinated control law based on a state observer and ETS. That means that by applying the control law we would like to make sure |eρi(t)eρj(t)|Δρ, |evi(t)evj(t)|Δv, and eρi(t)0p, evi(t)0p in finite time, where Δρ and Δv are small constants.

    Assumption 1. In the following derivation, we assumed that the communication topology among spacecraft is undirected and connected.

    Assumption 2. The external disturbance considered in this paper is assumed to be bounded, meaning that fdi(t)di holds, and the constant di0.

    Lemma 1[26] : For positive constants xi(i=1,2,,n) and q(0,1), there are the following relations

    ni=1|xi|1+q(ni=1|xi|2)1+q2
    (|x1|+|xn|)q|x1|q+|xn|q.

    Lemma 2[26] : Suppose the dynamic model of the system is ˙s=f(s), sURp, where U is an open neighbor of the origin. If the Lyapunov function V(s)=12sTs satisfies the inequality

    ˙V(s)v1V(s)v2Vγ(s),

    s will converge to s=0p in finite time, where constants v1,v2>0, 0<γ<1. The settling time can be given by

    T1v1(1γ)lnv1V1γ(s0)+v2v2.

    Lemma 3[26] : For a system with dynamic ˙s=f(s), sURp, where U is an open neighbor of the origin, if the Lyapunov function V(s)=12sTs satisfies the inequality

    ˙V(s)v1Vγ(s),

    s will converge to s=0p in finite time, where v1>0, 0<γ<1. The settling time can be given by

    TV1γ(s0)v1(1γ).

    In this section, the ESO-based finite-time relative position coordinated control law for distributed SFF system under DETS will be investigated. A finite-time ESO method is developed first to obtain the estimates of system states, based on which an FTSM control approach is proposed based on the DETS to achieve the coordinated control objective.

    In practical engineering, due to cost and technology limitations, the velocity of a spacecraft may be unavailable for precise measurement. An ESO has been recognized as an effective approach to simultaneously compensate the system states and disturbances/uncertainty. Therefore, in this paper, a modified ESO is proposed to generate finite-time observations of both the velocity information and the effects of non-linearity and disturbance of each spacecraft. Transform the dynamic (1) into the following form:

    ˙ρi(t)=vi(t)˙vi(t)=f(ρi(t),vi(t))+uai(t)+Gi(t) (3)

    where, f(ρi(t),vi(t))=Civi(t)+Diρi(t), Gi(t)=(udi(t)+Ni(t)), uai(t)=faimi and udi(t)=fdimi. Let the observed position and the observed velocity be ˆρi(t), ˆvi(t). Then, define position observation error and velocity observation error as ˜ρi(t)=ˆρi(t)ρi(t) and ˜vi(t)=ˆvi(t)vi(t), respectively.

    Then, the finite-time ESO is designed as follows:

    ˙^ρρi(t)=ˆvi(t)Li1˜ρi(t)zi1(t)˙ˆvi(t)=ˆGi(t)+f(ˆρi(t),ˆvi(t))+uai(t)zi2(t)˙ˆGi(t)=zi3(t) (4)

    where {{\mathit{\boldsymbol{z}}}_{i1}(t)} = \alpha_1 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{\tilde \rho}}}_{{i}}(t)}) , {{\mathit{\boldsymbol{z}}}_{i2}(t)} = \alpha_2 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{z}}}_{i1}(t)}) + \alpha_3 {{\mathit{\boldsymbol{z}}}_{i1}}^{q}(t)+ \alpha_4 {{\mathit{\boldsymbol{z}}}_{i1}(t)} , {{\mathit{\boldsymbol{z}}}_{i3}(t)} = \alpha_5 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{z}}}_{i2}(t)}) + \alpha_6 {{\mathit{\boldsymbol{z}}}_{i2}(t)} , \alpha_1, \alpha_2, \alpha_3, \alpha_4, \alpha_5, \alpha_6 are parameters to be designed, and matrix {{\mathit{\boldsymbol{L}}}_{i1}} = {\mathop{\rm diag}\nolimits} \left\{ {{l_{ij}}} \right\} , {l_{ij}} (j = 1, 2, 3) is a constant, and q is a fraction that satisfies q < 1 where the numerator and denominator are odd numbers. By subtracting Eq (3) from Eq (4), the following error system is constructed:

    \begin{eqnarray} \begin{array}{c} {{{\mathit{\boldsymbol{\dot {\tilde {\rho }}}}}}_i(t)}{\bf{ = }}{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)} - {{\mathit{\boldsymbol{L}}}_{i1}}{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)} - {{\mathit{\boldsymbol{z}}}_{i1}(t)}\\ {{{\mathit{\boldsymbol{\dot {\tilde {v}}}}}}_i(t)}{\bf{ = }}{{\mathit{\boldsymbol{\tilde G}}}_i(t)}+ {\mathit{\boldsymbol{f}}}({{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}{\bf{,}}{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}{\mathit{\boldsymbol{)}}-}{{\mathit{\boldsymbol{z}}}_{i2}(t)} \\ {{{\mathit{\boldsymbol{\dot {\tilde {G}}}}}}_i(t)}{\bf{ = }} {\bf - }{{\mathit{\boldsymbol{z}}}_{i3}(t)} - {{\mathit{\boldsymbol{G}}}_i(t)}. \end{array} \end{eqnarray} (5)

    The convergence of the observer will be stated in Theorem 1.

    Before giving Theorem 1, we make some assumptions from a practical point of view. The position, velocity, non-linearity term and disturbance of a spacecraft cannot be infinite in actual systems; thus, it is reasonable to assume that there exists an upper bound for the observation state. In other words, we can always find positive constants M_0 and G_0 that make \left\| {{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}} \right\| \le M_0 and \left\| {{{{\mathit{\boldsymbol{\tilde G}}}}_i}(t)} \right\| \le {G_{0}} hold. Also, there exists a positive constant C_0 , such that \left\| {{{{\mathit{\boldsymbol{C}}}}_i(t)}} \right\| \le C_0 holds. Moreover, external disturbances are also bounded according to Assumption 2. It follows that there exists a positive constant {G_{1}} > 0 such that \left\| {{{{\mathit{\boldsymbol{G}}}}_i}(t)} \right\| \le {G_{1}} holds.

    Theorem 1. For system (3), if the observer (4) is applied, and the design parameters satisfy:

    \alpha_1 > M_0, \alpha_2 > G_{0}, \alpha_3 > 0, \alpha_4 > {{C}}_0, \alpha_5 > G_{1}, \alpha_6 > 0,

    then {\boldsymbol{ \rho} }_i(t) , {{\mathit{\boldsymbol{v}}} }_i(t) and {{\mathit{\boldsymbol{G}}} }_i(t) can be accurately estimated by the designed observer in a finite time.

    Proof. First, we analyze the convergence of {\mathit{\boldsymbol{\tilde {\rho }}}_i(t)} . Propose such a Lyapunov candidate:

    {V}_0 (t) = \frac{1}{2}{{\mathit{\boldsymbol{\tilde \rho}}}_i}^T(t){{\mathit{\boldsymbol{\tilde \rho}}}_i(t)}.

    Taking the derivative of {V}_0(t) , we have

    \begin{align} {{ \dot{V}}_0(t)} = & {{\mathit{\boldsymbol{\tilde \rho}}}_i}^T(t){{\mathit{\boldsymbol{\dot{\tilde\rho}}}}_i(t)} \\ = & {{\mathit{\boldsymbol{\tilde \rho}}}_i}^T(t)({{{\mathit{\boldsymbol{\tilde v}}}}_i(t)} - {{\mathit{\boldsymbol{L}}}_{i1}}{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)} + {{\mathit{\boldsymbol{z}}}_{i1}(t)})\\ = &{{\mathit{\boldsymbol{\tilde \rho}}}_i}^T(t){{{\mathit{\boldsymbol{\tilde v}}}}_i(t)} - {{\mathit{\boldsymbol{L}}}_{i1}}\left\|{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}\right\|^2-\alpha_1\left\|{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}\right\|\\ \le&-(\alpha_1-M_0)\left\|{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}\right\|\\ \le&-\sqrt{2}(\alpha_1-M_0){V}_0^{\frac{1}{2}}(t). \end{align} (6)

    Note that \alpha_1 > M_0 , and the finite-time convergence of \left\| {{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}} \right\| can be proved according to Lemma 3, where

    T_0 \le {\frac{{{V_0}^\frac{1}{2}}\left( {{0}} \right)} {\frac{1}{\sqrt{2}}(\alpha_1-M_0)}}.

    Next, we perform the convergence analysis on \mathit{\boldsymbol{\tilde v}}_i(t) . Suppose that \left\| {{{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}} \right\| = {0}, t \ge T_0 also represents \left\| {{\mathit{\boldsymbol{\dot{\tilde\rho}}}}_i(t)} \right\| = {{{\mathit{\boldsymbol{\tilde v}}}}_i(t)} - {{\mathit{\boldsymbol{z}}}_{i1}(t)} = {0}, t \ge T_0 . In other words, there is {{{\mathit{\boldsymbol{\tilde v}}}}_i(t)} = {{\mathit{\boldsymbol{z}}}_{i1}(t)}, and t \ge T_0 . Propose a new Lyapunov candidate

    {V}_1(t) = \frac{1}{2}{{\mathit{\boldsymbol{\tilde v}}}_i}^T(t){{\mathit{\boldsymbol{\tilde v}}}_i(t)}.

    Taking the time derivative of {V}_1(t) yields

    \begin{align} {{ \dot{V}}_1(t)} = & {{\mathit{\boldsymbol{\tilde v}}}_i}^T(t){{\mathit{\boldsymbol{\dot{\tilde v}}}}_i(t)} \\ = & {{\mathit{\boldsymbol{\tilde v}}}_i}^T(t)({{\mathit{\boldsymbol{\tilde G}}}_i(t)}+{\mathit{\boldsymbol{f}}}({{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}{\bf{,}}{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}{\bf{) - }}{{\mathit{\boldsymbol{z}}}_{i2}(t)} )\\ = & {{\mathit{\boldsymbol{\tilde v}}}_i}^T(t)({{\mathit{\boldsymbol{\tilde G}}}_i(t)}+{\mathit{\boldsymbol{f}}}({{{\mathit{\boldsymbol{\tilde \rho}}}}_i(t)}{\bf{,}}{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}{\bf{) - }}\alpha_2 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{v}}}_{i}(t)}) - \alpha_3 {{\mathit{\boldsymbol{v}}}_{i}}^{q}(t)- \alpha_4 {{\mathit{\boldsymbol{v}}}_{i}(t)} )\\ = &{\mathit{\boldsymbol{\tilde v}}}_{i}^T(t){{\mathit{\boldsymbol{\tilde G}}}_i(t)}+{{\mathit{\boldsymbol{\tilde v}}}_i}^T(t){\mathit{\boldsymbol{C}}}_i{{{\bf{\tilde v}}}_i(t)} -\alpha_2\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|-\alpha_3\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|^{{1+q}}-\alpha_4\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|^2\\ \le&-(\alpha_2-G_{0})\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|-\alpha_3\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|^{{1+q}}-(\alpha_4-{{C}}_0)\left\|{{{\mathit{\boldsymbol{\tilde v}}}}_i(t)}\right\|^2\\ \le&-\sqrt{2}(\alpha_2-G_{0}){V}_1^{\frac{1}{2}}(t)-\sqrt{2} \alpha_3{V}_1^\frac{(1+q)}{2}(t)-(\alpha_4-{{C}}_0){V}_1(t). \end{align} (7)

    Note that \alpha_2 > G_{0} , \alpha_3 > 0 , and \alpha_4 > {{C}}_0 , and thus the finite-time convergence of \left\| {{{{\mathit{\boldsymbol{\tilde v}}}}_i}(t)} \right\| is proved according to Lemma 2. That means there exists a time instant T_1 > T_0 , such that \left\| {{{{\mathit{\boldsymbol{\tilde \rho}}}}_i}(t)} \right\| = 0 and \left\| {{{{\mathit{\boldsymbol{\tilde v}}}}_i}(t)} \right\| = {{\mathit{\boldsymbol{\tilde G}}}_i(t)}- {{\mathit{\boldsymbol{z}}}_{i2}(t)} = 0 hold, when t > T_1 , where

    T_1\le \frac{1}{{(\alpha_4-{{C}}_0)}}\ln \frac{{2(\alpha_4-{{C}}_0)}V_1^{\frac{1}{2}}({{{T}}_{0}})+{\sqrt{2}(\alpha_2-G_{0})}}{{\sqrt{2}(\alpha_2-G_{0})}}+T_0.

    Finally, the finite-time convergence analysis of \left\| {{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}} \right\| is given as follows. Another new Lyapunov candidate is proposed:

    {V}_2(t) = \frac{1}{2}{{\mathit{\boldsymbol{\tilde G}}}_i}^T(t){{\mathit{\boldsymbol{\tilde G}}}_i(t)}.

    Taking the derivative of {V}_2(t) yields

    \begin{align} {{ \dot{V}}_2(t)} = & {{\mathit{\boldsymbol{\tilde G}}}_i}^T(t){{\mathit{\boldsymbol{\dot{\tilde G}}}}_i(t)} \\ = & {{\mathit{\boldsymbol{\tilde G}}}_i}^T(t)(- \alpha_5 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{z}}}_{i2}(t)})-\alpha_6 {{\mathit{\boldsymbol{z}}}_{i2}(t)} - {{\mathit{\boldsymbol{G}}}_{i}(t)})\\ = & {{\mathit{\boldsymbol{\tilde G}}}_i}^T(t)(- \alpha_5 {\mathop{\rm sgn}} ({{\mathit{\boldsymbol{\tilde G}}}_i(t)})-\alpha_6 {{\mathit{\boldsymbol{\tilde G}}}_i(t)} - {{\mathit{\boldsymbol{G}}}_{i}(t)})\\ = &-{{\mathit{\boldsymbol{\tilde G}}}_i}^T(t){{{{\mathit{\boldsymbol{G}}}}}_i(t)}-\alpha_5\left\|{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}\right\|- \alpha_6\left\|{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}\right\|^2\\ \le&-(\alpha_5-G_1)\left\|{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}\right\|\\ \le&-\sqrt{2}(\alpha_5-G_1){V}_2^{\frac{1}{2}}(t). \end{align} (8)

    Similarly, by substituting \alpha_5 > G_{1} , \alpha_6 > 0 , \left\| {{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}} \right\| will converge to the origin in a finite time according to Lemma 3. That means that there exists a time instant T_2 > T_1 , such that \left\| {{{{\mathit{\boldsymbol{\tilde G}}}}_i(t)}} \right\| = 0 holds, when t > T_2 , where

    T_2 \le {\frac{{{V_2}^{\frac{1}{2}}}\left( {{{T}_1}} \right)} {\frac{1}{\sqrt{2}}(\alpha_5-G_1)}}+T_1.

    We thus complete the proof.

    In this subsection, based on the estimates {{\mathit{\boldsymbol{\hat v}}}_i(t)} and {{\mathit{\boldsymbol{{\hat G}}}}_i(t)}, we will propose an event-based FTSM control law for SFF systems (1). First, a fast terminal sliding surface is given as follows:

    \begin{eqnarray} \begin{array}{c} {\mathit{\boldsymbol{\hat s}}(t)} = \gamma {{\mathit{\boldsymbol{e}}}_{\rho_i}(t)} + {{\mathit{\boldsymbol{e}}}_{\hat v_i}(t)} + \kappa {\mathop{\rm sig}\nolimits} ^\beta(\gamma {{\mathit{\boldsymbol{e}}}_{\rho_i}(t)}) \end{array} \end{eqnarray} (9)

    where \mathop{\rm sig^\beta}({\mathit{\boldsymbol{x}}}) = \rm {diag} (|x_i|^\beta)\mathop{\rm sgn}({\mathit{\boldsymbol{x}}}) = \left[|x_1|^\beta\mathop{\rm sgn}(x_1)\; \; |x_2|^\beta\mathop{\rm sgn}(x_2)\; \; \cdots\; \; |x_n|^\beta\mathop{\rm sgn}(x_n)\right ]^T , {{\mathit{\boldsymbol{e}}}_{\hat v_i}(t)}{\rm{ = }}{{\mathit{\boldsymbol{\hat v}}}_i(t)} - {\mathit{\boldsymbol{v}}}_i^d(t) = {{\mathit{\boldsymbol{\hat v}}}_i(t)} - {{\mathit{\boldsymbol{v}}}_i(t)} + {{\mathit{\boldsymbol{v}}}_i(t)} - {\mathit{\boldsymbol{v}}}_i^d(t) = {{\mathit{\boldsymbol{\tilde v}}}_i(t)} + {{\mathit{\boldsymbol{e}}}_{v_i}(t)} , and \gamma, \kappa\in {\bf R^+} are parameters to be designed.

    For the convenience of later derivation, we define

    {{\mathit{\boldsymbol{\hat e}}}_{is}(t)} = {{\mathit{\boldsymbol{\hat s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{\hat s}}}_i}(t), \; \; \; \; {{\mathit{\boldsymbol{\hat \eta}}}_i(t)} = {{\mathit{\boldsymbol{\hat s}}}_i}(t) - \frac{{\sum\limits_{i = 1}^n {{{{\mathit{\boldsymbol{\hat s}}}}_i}} (t)}}{n}.

    In order to reduce communication frequency, an improved DETS is introduced in this paper. To better understand DETS, we first define a traditional static triggering condition as follows

    \begin{eqnarray} \begin{array}{c} {\mathcal L }\left\| {{{{\mathit{\boldsymbol{\hat e}}}}_{is}(t)}} \right\| -{\zeta \sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\| }\ge0 \end{array} \end{eqnarray} (10)

    where \zeta, {\mathcal L }\in {\bf R^+} are parameters to be designed. Next, a dynamic variable H_i(t) is introduced:

    \begin{eqnarray} \begin{array}{c} \dot H_i(t) = -\lambda H_i(t)+\zeta\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\bf{\hat s}}}_i}(t_{k_i}^i) - {{{\bf{\hat s}}}_j}(t_{k_j}^j)} \right\|^{\beta+1}-{\mathcal L }\left\| {{{{\bf{\hat e}}}_{is}(t)}} \right\|\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\bf{\hat s}}}_i}(t_{k_i}^i) - {{{\bf{\hat s}}}_j}(t_{k_j}^j)} \right\|^{\beta}\\ H_i(0) > \mathit{\boldsymbol{0}} \end{array} \end{eqnarray} (11)

    where constant \beta \in (0, 1) and \lambda \in {\bf R^+} . It will be proved later that the dynamic variable {{H}_i(t)} remains positive throughout the process. Then, the dynamic triggering condition can be defined as

    \begin{eqnarray} \begin{array}{c} h_i(t) = \theta ({\mathcal L }\left\| {{{{\mathit{\boldsymbol{\hat e}}}}_{is}(t)}} \right\|\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|^{\beta}-\zeta\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1})- H_i(t) \ge 0 \end{array} \end{eqnarray} (12)

    where \theta\in{\bf R^+} . From the triggering condition, during each interval \left[ {t_{k_i}^i, t_{k_i + 1}^i} \right) , we have

    \begin{eqnarray} \begin{array}{c} (\zeta\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1}-{\mathcal L }\left\| {{{{\mathit{\boldsymbol{\hat e}}}}_{is}(t)}} \right\|\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|^{\beta}) > -\frac{1}{\theta} H_i(t). \end{array} \end{eqnarray} (13)

    Substituting (13) into (11) yields

    \begin{eqnarray} \begin{array}{c} \dot H_i(t)\ge-\lambda H_i(t)-\frac{1}{\theta} H_i(t). \end{array} \end{eqnarray} (14)

    By applying the differential equation theorem and the comparison lemma, it follows that

    \begin{eqnarray} \begin{array}{c} H_i(t) > 0. \end{array} \end{eqnarray} (15)

    This completes the construction of the DETS. From the above DETS, the trigger state will only be updated and broadcasted when the trigger condition (12) is met.

    Further, a DETS based finite-time coordinate control law is proposed as

    \begin{align} {{\mathit{\boldsymbol{u}}}_i(t)} = & {{\mathit{\boldsymbol{u}}}_{1i}(t)} {\rm{ + }}{{\mathit{\boldsymbol{u}}}_{2i}(t)} \\ {{\mathit{\boldsymbol{u}}}_{1i}(t)} = & - {w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta}} {({{\mathit{\boldsymbol{\hat s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{\hat s}}}_j}(t_{k_j}^j))} - ({{\mathit{\boldsymbol{C}}}_i}{{\mathit{\boldsymbol{\hat v}}}_i(t)}+ {{\mathit{\boldsymbol{D}}}_i}{{\mathit{\boldsymbol{\rho}}}_i(t)} \\ + & {{\mathit{\boldsymbol{\hat G}}}_i(t)} - {\mathit{\boldsymbol{\dot v}}}_i^d(t) + \gamma {{\mathit{\boldsymbol{\hat e}}}_{v_i}(t)} + \kappa p{\left| {\gamma {{\mathit{\boldsymbol{e}}}_{\rho_i}(t)}} \right|^{p - 1}}(\gamma {{\mathit{\boldsymbol{\hat e}}}_{v_i}(t)})) \\{{\mathit{\boldsymbol{u}}}_{2i}(t)} = & - {k_i}{{\mathit{\boldsymbol{\hat s}}}_i(t)} - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{\hat s}}}_i(t)}) \end{align} (16)

    where \zeta, {w}, {\varsigma }, k_i \in {\bf R^+} are control parameters to be designed. The performance of the proposed control law (16) is stated in Theorem 2.

    Theorem 2. For distributed SFF systems (1) with the DETS based control law (16), suppose Assumptions 1 and 2 hold, and the following inequalities hold

    \zeta{w}\le \frac{1}{2}, {\mathcal L \ge {w}}, {\varsigma }\ge {{\rm{\tilde\Delta}}_{max}}, k_i > 0

    where {{\rm{\tilde\Delta}}_{max}} will be defined later in Eq (33). Then, the relative position coordination problem that states in Section 2 can be achieved in a finite time.

    Proof. The proof of Theorem 2 is divided into the following two parts.

    (i) First, we should prove that spacecraft in a formation system can achieve consensus in a finite time. Since it has been proved that the observation velocity can converge to a real velocity in finite time {T_2} , we set the initial moment when we start to exert control actions to {t_0} \ge {T_2} . Then, it is available to use real velocity to replace the observed one in the following proof. By substituting the control law (16) into the error dynamic model (2), we have

    {{\mathit{\boldsymbol{\dot e}}}_{vi}(t)} = - \gamma {{\mathit{\boldsymbol{e}}}_{vi}(t)} - \kappa p{\left| {\gamma {{\mathit{\boldsymbol{e}}}_{\rho i}(t)}} \right|^{p - 1}}(\gamma {{\mathit{\boldsymbol{\dot e}}}_{\rho i}(t)}) - {w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}- {k_i}{{\mathit{\boldsymbol{s}}}_i(t)} - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i(t)}).

    It follows from (9) that

    \begin{align} {\mathit{\boldsymbol{\dot s}}_i(t)} = & \gamma {{{\mathit{\boldsymbol{\dot e}}}}_{\rho i}(t)} + {{{\mathit{\boldsymbol{\dot e}}}}_{vi}(t)} + \kappa p{\left| {\gamma {{\mathit{\boldsymbol{e}}}_{\rho i}(t)}} \right|^{p - 1}}(\gamma {{{\mathit{\boldsymbol{\dot e}}}}_{\rho i}(t)})\\ = & - {k_i}{{\mathit{\boldsymbol{s}}}_i(t)} - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i(t)})- {w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta}} {({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}. \end{align} (17)

    Since the communication topology is undirected and connected, we have {g_{ij}} = {g_{ji}} , and obviously

    \begin{align} {\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta}} ({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}} = {\mathit{\boldsymbol{0}}} \end{align} (18)

    can be obtained. It follows that

    \begin{align} {\frac{\sum\limits_{i = 1}^n {{{{\mathit{\boldsymbol{\dot s}}}}_i}} (t)} {n}} = & -\frac{1}{n}{{\sum\limits_{i = 1}^n{k_i}{{\mathit{\boldsymbol{s}}}_i(t)}}} - \frac{1}{n}{{\sum\limits_{i = 1}^n{\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)}}}- \frac{w}{n}{{\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta}} ({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))} } }\\ = & -\frac{1}{n}{{\sum\limits_{i = 1}^n{k_i}{{\mathit{\boldsymbol{s}}}_i(t)}}} - \frac{1}{n}{{\sum\limits_{i = 1}^n{\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)}}}. \end{align} (19)

    Considering the following Lyapunov candidate:

    {V_3(t)} = {V_{31}(t)}+{V_{32}(t)}

    where {V_{31}(t)} = {\frac{1}{2}{\mathit{\boldsymbol{\eta}}}^T(t)}{\mathit{\boldsymbol{\eta (t)}}} , and {V_{32}(t)} = \sum\limits_{i = 1}^n{{\mathit{\boldsymbol{H}}}_i(t)} . Taking the time derivative of V_{31}(t) , it is shown that

    \begin{align} {\dot{V}_{31}(t)} = & \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t){{{\mathit{\boldsymbol{\dot \eta}}}}_i(t)}} \\ = &\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)({{{\mathit{\boldsymbol{\dot s}}}}_i}(t) - \frac{1}{n}{{\sum\limits_{j = 1}^n{{{{\mathit{\boldsymbol{\dot s}}}}_j}} (t)}})} \\ = & \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)( - {k_i}{{\mathit{\boldsymbol{s}}}_i(t)} - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i(t)})-{w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ +& \frac{1}{n}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)( {{\sum\limits_{j = 1}^n{k_j}{{\mathit{\boldsymbol{s}}}_j}(t)}} + {{\sum\limits_{j = 1}^n{\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}} } )}\\ = &\underbrace{\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)(- {w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} }_{ term\; 1}-\underbrace{\frac{1}{n}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)\sum\limits_{j = 1}^n({k_i}{{\mathit{\boldsymbol{s}}}_i(t)}-{k_j}{{\mathit{\boldsymbol{s}}}_j(t)})}}_{ term\; 2} \\ +& \underbrace{\frac{1}{n}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)( {{\sum\limits_{j = 1}^n{\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j}(t)} }- {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i}(t)) )}}_{ term\; 3}. \end{align} (20)

    For the first term in {\dot{V}}_{31}(t) , we have

    \begin{align} & \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)( - {w}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ = & - \frac{1}{2}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}(} {{\mathit{\boldsymbol{\eta}}}_i}^T(t)({\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} - {{\mathit{\boldsymbol{\eta}}}_j}^T(t)({\mathop{\rm sig}\nolimits}^{{\beta}} {({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}))\\ = & - \frac{1}{2}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} ({{\mathit{\boldsymbol{\eta}}}_i(t)} - {{\mathit{\boldsymbol{\eta}}}_j(t)})({\mathop{\rm sig}\nolimits}^{{\beta}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ = & - \frac{1}{2}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} ({{\mathit{\boldsymbol{s}}}_i(t)} - {{\mathit{\boldsymbol{s}}}_j(t)})({\mathop{\rm sig}\nolimits}^{{\beta}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ = & - \frac{1}{2}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} ({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j) - {{\mathit{\boldsymbol{e}}}_{is}(t)} + {{\mathit{\boldsymbol{e}}}_{js}(t)})({\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ = & - \frac{1}{2}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} ({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))({\mathop{\rm sig}\nolimits}^{{\beta}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ &+ \sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{e}}}_{is}(t)}{w}{{g_{ij}}} ({\mathop{\rm sig}\nolimits}^{{\beta}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})}. \end{align}

    For the second term in {\dot{V}_{31}(t)} , it is derived that

    \begin{align} -&\frac{1}{n}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)\sum\limits_{j = 1}^n({k_i}{{\mathit{\boldsymbol{s}}}_i(t)}-{k_j}{{\mathit{\boldsymbol{s}}}_j}(t))} \\ \le & -{k_{min}}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)\sum\limits_{j = 1}^n\frac{1}{n}({{\mathit{\boldsymbol{s}}}_i(t)}-{{\mathit{\boldsymbol{s}}}_j(t)})} \\ = &-{k_{min}}\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t){{\mathit{\boldsymbol{\eta}}}_i}(t)}. \end{align} (21)

    When it comes to the last term in {\dot{V}_{31}(t)} , we can obtain

    \begin{align} & \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{\eta}}}_i}^T(t)( \frac{{\sum\limits_{j = 1}^n{\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}}}{n}- {\varsigma }{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)} )} \\ = & - \frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n ({{\mathit{\boldsymbol{s}}}_i(t)} - {{\mathit{\boldsymbol{\overline s}}(t)}})( {{{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)}-{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}}})} \\ = & - \frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{s}}}_i(t)}( {{{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)}-{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}}})}\\ - &\frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{\overline s}}(t)}}{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i(t)}} +\frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{\overline s}}(t)}}{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}} \\ \le & - \frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n \left\|{{\mathit{\boldsymbol{s}}}_i(t)}\right\| (1-|{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_j(t)}|)}\\ - &\frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{\overline s}}(t)}}{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i}(t)} +\frac{\varsigma}{n}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\mathit{\boldsymbol{\overline s}}(t)}}{\mathop{\rm sgn}} {{\mathit{\boldsymbol{s}}}_i}(t)} = 0. \end{align} (22)

    By using the Cauchy-Schwarz inequality and Lemma 1, from \dot{V}_{31}(t) it can be further derived that

    \begin{align} {\dot{V}_{31}(t)} \le & - \frac{1}{2}{\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} \left\| {\left( {{{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j)} \right)} \right\|} ^{\beta + 1}} \\ + & \sum\limits_{i = 1}^n( {{{w}^2\mathit{\boldsymbol{e}}}_{is}}^2(t))^{\frac{1}{2}} ( {\sum\limits_{j = 1}^n { {{g_{ij}}}^2{\mathop{\rm sig}\nolimits}^{2{{\beta}}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}} }}) ^{\frac{1}{2}} \\ \le & - \frac{1}{2}{\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w}{{g_{ij}}} \left\| {\left( {{{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j)} \right)} \right\|} ^{\beta + 1}}\\ + & \sum\limits_{i = 1}^n { \left\|{{\mathit{\boldsymbol{e}}}_{is}(t)} \right\|}{w} { {\sum\limits_{j = 1}^n {\left\|{{g_{ij}}}\right\| \left\|{{{{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j)}}\right\| ^{{{\beta}}} }}}. \end{align} (23)

    According to the dynamic function (11), during each interval \left[ {t_{k_i}^i, t_{k_i + 1}^i} \right) , we rewrite the second term of {\dot{V}}_{3}(t) into the following version:

    {\dot{V}_{32}(t)} = \sum\limits_{i = 1}^n{\boldsymbol{\dot{H }}}_i(t) (24)
    \begin{align} = &-\lambda\sum\limits_{i = 1}^n H_i(t)+\zeta\sum\limits_{i = 1}^n\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1}-{\mathcal L } \sum\limits_{i = 1}^n\left\| {{{{\mathit{\boldsymbol{e}}}}_{is}}(t)} \right\|\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta}. \end{align} (25)

    Since \zeta\le \frac{1}{2}{w} and {\mathcal L \ge {w}} , it follows that

    \begin{align} {\dot{V}}_{3}(t)\le & -\lambda\sum\limits_{i = 1}^n H_i(t)-(\frac{1}{2}{w}-\zeta)\sum\limits_{i = 1}^n\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1}. \end{align} (26)

    Obviously, based on Lyapunov stability analysis theory, the asymptotical consensus of system (2) can be achieved under the control law (16). Next, the finite-time consensus will be further proved.

    For the dynamic variable H_i(t) , it can be easily calculated that \sum\limits_{i = 1}^nH_i(t)\ge \sum\limits_{i = 1}^nH_i^ \frac{1+\beta}{2}(t)-n . One can thus obtain

    \begin{align} {\dot{V}}_{3}(t) \le & -\lambda\sum\limits_{i = 1}^nH_i^ \frac{1+\beta}{2}(t)+\Delta _0 -(\frac{1}{2}-\zeta{w})\sum\limits_{i = 1}^n\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1} \end{align} (27)

    where \Delta _0 = \lambda n . On the one hand, it can be obtained that

    \begin{align} {{{{V}_{({31},i)}^{\frac{{1 + \beta }}{2}}(t)}}}& = {{{{\left\| \sum\limits_{j = 1}^n{{{\mathit{\boldsymbol{\eta}}_j}^T(t)}{\mathit{\boldsymbol{\eta}}_j}(t)} \right\|}^{\frac{{1 +\beta }}{2}}}}} = {{{{\left\| \frac{1}{n^2}{{{\left( {\sum\limits_{j = 1}^n \left( {{{\mathit{\boldsymbol{s}}}_i}(t) - {{\mathit{\boldsymbol{s}}}_j}}(t) \right)} \right)}^T}\left( {\sum\limits_{j = 1}^n {} \left( {{{\mathit{\boldsymbol{s}}}_i}(t) - {{\mathit{\boldsymbol{s}}}_j}(t)} \right)} \right)} \right\|}^{\frac{{1 + \beta }}{2}}}}} \\ & = \frac{1}{n^{1+\beta}}{{{{\left\|\sum\limits_{j = 1}^n {{ \left( {{{\mathit{\boldsymbol{s}}}_i}(t) - {{\mathit{\boldsymbol{s}}}_j}(t)} \right)} } \right\|}^{1 + \beta }}}}. \end{align} (28)

    On the other hand, it can be deduced that

    \begin{align} \sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1}\ge \left\| \sum\limits_{j = 1}^n {{g_{ij}}}({{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)}) \right\|^{\beta+1}. \end{align} (29)

    Furthermore, in view of practical engineering and ETS, the following inequality holds during each trigger interval \left[ {t_{k_i}^i, t_{k_i + 1}^i} \right) :

    \left\| \sum\limits_{j = 1}^n {{g_{ij}}}({{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)}) \right\|^{\beta+1} \ge \kappa_i \left\| \sum\limits_{j = 1}^n({{{\mathit{\boldsymbol{s}}}_i}(t) - {{\mathit{\boldsymbol{s}}}_j}(t)}) \right\|^{\beta+1}-\Delta_i

    where \kappa_i and \Delta_i are positive constants. That leads to

    \begin{align} -&(\frac{1}{2}-\zeta{w})\sum\limits_{i = 1}^n\sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{s}}}}_j}(t_{k_j}^j)} \right\|^{\beta+1} \\ \le& -\phi_1\sum\limits_{i = 1}^n \left\|\sum\limits_{j = 1}^n {{{{\mathit{\boldsymbol{s}}}}_i}(t) - {{{\mathit{\boldsymbol{s}}}}_j}(t)} \right\|^{\beta+1}+\Delta\\ \le& - \phi_1n^{1+\beta}{{{V}_{31}^{\frac{{1 + \beta }}{2}}}(t)}+\Delta \end{align} (30)

    where \phi_i = \kappa_{min}(\frac{1}{2}-\zeta{w}) and \Delta = \sum\limits_{i = 1}^n\Delta_i . Moreover, we have

    \begin{align} {\rm{ - }}\lambda\sum\limits_{i = 1}^nH_i^ \frac{1+\beta}{2}(t)\le {\rm{ - }}\lambda(\sum\limits_{i = 1}^nH_i(t))^ \frac{1+\beta}{2} = {\rm{ - }}\lambda{V_{32}}^ \frac{1+\beta}{2}(t). \end{align} (31)

    In combination of Eqs (26), (30) and (31), it can be concluded that

    \begin{align} {\dot{V}_3}(t) \le & -\phi_1 n^{1+\beta}{{V_{31}}^{\frac{{1 + \beta }}{2}}(t)}{\rm{ - }}\lambda{V_{32}}^ \frac{1+\beta}{2}(t)+{\tilde \Delta}\\ \le & -{\phi _2}{{V_3}^{\frac{{1 + \beta }}{2}}(t)}+{\tilde\Delta} \end{align} (32)

    where \tilde\Delta = \Delta+\Delta_0 , {\phi _2} = min\{\phi_1 n^{1+\beta}, \lambda\} . According to Lemma 3 and bounded theory, it can be proved that the consensus error will converge to a small bound in a finite time T_3 , where

    T_3 \le {\frac{{{V_3}^{\frac{1-\beta}{2} }}\left( {{T_2}} \right)} {\phi_2({\frac{1-\beta}{2} } )}}+T_2.

    (ii) Second, we should prove that the states of each spacecraft can converge to the expected values in a finite time. Another Lyapunov candidate is proposed as

    {V_4}(t) = \frac{1}{2}{{\mathit{\boldsymbol{s}}}^T}(t){\mathit{\boldsymbol{s}}}(t).

    Taking the derivative of V_4(t) , one can obtain that

    \begin{align} {\dot{V}_4}(t) = & \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{s}}}_i}^T(t){{{\mathit{\boldsymbol{\dot s}}}}_i}(t)} \\ = &\sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{s}}}_i}^T(t)( - {k_i}{{\mathit{\boldsymbol{s}}}_i}(t) - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i})(t){\rm{ - }}\sum\limits_{j = 1}^n {w_i}{{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}})} \\ = & - \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{s}}}_i}^T}(t) {k_i}{{\mathit{\boldsymbol{s}}}_i}(t) - \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{s}}}_i}^T}(t) {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i}(t)){\rm{ - }}\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {w_i}{{g_{ij}}} {{\mathit{\boldsymbol{s}}}_i}^T(t){\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}}} \\ \le& - \sum\limits_{i = 1}^n {{{\mathit{\boldsymbol{s}}}_i}^T}(t) {k_i}{{\mathit{\boldsymbol{s}}}_i}(t) - \sum\limits_{i = 1}^n {({\varsigma }{\rm{ - }}{{\rm{\tilde\Delta}}_i})\left\| {{{\mathit{\boldsymbol{s}}}_i}(t)} \right\|} \\ \le& - 2\sum\limits_{i = 1}^n ({{\frac{1} {2}}k_i {{\mathit{\boldsymbol{s}}}_i}^T}(t) {{\mathit{\boldsymbol{s}}}_i}(t)) - \sqrt 2 {\sum\limits_{i = 1}^n {({\varsigma }{\rm{ - }}{{\rm{\tilde\Delta}}_i})\left\| {{\frac{1} {2}} {{\mathit{\boldsymbol{s}}}_i}^T(t){{\mathit{\boldsymbol{s}}}_i}(t)} \right\|} ^{\frac{1} {2}} } \\ \le & - {\phi_3}{V_4}(t) - {\phi_4}{{V_4}^{\frac{1} {2}}}(t) \end{align} (33)

    where \phi_3 = 2\kappa_{min} , \phi_4 = \sqrt 2 ({\varsigma }{\rm{ - }}{{\rm{\tilde\Delta}}_{max}}) , {{\rm{\tilde\Delta}}_{i} = \Delta_i+\Delta_0} , and {{\rm{\tilde\Delta}}_{max}} = max \{{{\rm{\tilde\Delta}}_{i}, i = 1, 2, ..., n}\} . According to Lemma 2, the finite-time convergence of each spacecraft is proved, and the convergence time T_4 satisfies

    T_4\le \frac{2}{{{\phi}_{3}}}\ln \frac{{{\phi}_{3}}V^{\frac{1}{2}}({{{T}}_{3}})+{{\phi}_{4}}}{{{\phi}_{4}}}+T_3.

    Hence, the proof of Theorem 2 is finished.

    For an event triggered control system, not only the stability of the controller should be analyzed, but also the Zeno behavior in the system should be further analyzed. In this subsection, we would like to exclude the Zeno behavior by proving that the trigger interval cannot be infinitely small.

    Theorem 3. For an SFF system (1) under the proposed control law (16) and the triggering function (12), there exists a lower bound for the time interval between any two triggers. In other words, there will be no Zeno behaviour during the whole process.

    Proof. During each trigger interval \left[ {t_{k_i}^i, t_{k_i + 1}^i} \right) , it is easy to obtain that

    \begin{align} \mathop {\lim }\limits_{t \to t_{k_i + 1}^i} \left\| {{{\mathit{\boldsymbol{e}}}_{is}}(t)} \right\| = & \left\| {\int_{t_{k_i}^i}^{t_{k_i + 1}^i} {{{{\mathit{\boldsymbol{\dot e}}}}_{is}}(z)dz + {{\mathit{\boldsymbol{e}}}_{is}}(t_{k_i}^i)} } \right\|\\ \le & \int_{t_{k_i}^i}^{t_{k_i + 1}^i} {\left\| {{{{\mathit{\boldsymbol{\dot e}}}}_{is}}(z)} \right\|} dz\\ = & \int_{t_{k_i}^i}^{t_{k_i + 1}^i} {\left\| {{{{\mathit{\boldsymbol{\dot s}}}}_i}(z)} \right\|} dz. \end{align} (34)

    By substituting Eq (17) into (34), we have

    \begin{align} \int_{t_{k_i}^i}^{t_{k_i + 1}^i} {\left\| {{{{\mathit{\boldsymbol{\dot s}}}}_i}(z)} \right\|} dz & = \int_{t_{k_i}^i}^{t_{k_i + 1}^i} {\left\| { - {k_i}{{\mathit{\boldsymbol{s}}}_i}(z) - {\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i}(z)){\rm{ - }}\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta}} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}}} \right\|} dz\\ &\le \int_{t_{k_i}^i}^{t_{k_i + 1}^i} {\left\| {{k_i}{{\mathit{\boldsymbol{s}}}_i}(z)} \right\| + \left\| {{\varsigma }{\mathop{\rm sgn}} ({{\mathit{\boldsymbol{s}}}_i}(z))} \right\| + \left\| {\sum\limits_{j = 1}^n {{g_{ij}}} {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}}} \right\|} dz. \end{align} (35)

    Since ||{\mathit{\boldsymbol{s}}}_i(t)|| and \left\| { {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}}} \right\| are bounded, it can be obtained that

    \begin{align} \mathop {\lim }\limits_{t \to t_{k_i + 1}^i} \left\| {{{\mathit{\boldsymbol{e}}}_{is}}(t)} \right\| & \le \int_{t_{k_i}^i}^{t_{k_i + 1}^i}\left( {{M_{si}} + {\varsigma _i} + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}}\right) dz\\ &\le \left( {t_{k_i + 1}^i - t_{k_i}^i} \right)\left( {{M_{si}} + {\varsigma _i} + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}} \right) \end{align} (36)

    where {M_{si}} , {M_{hi}} represent the upper bounds of ||{\mathit{\boldsymbol{s}}}_i|| and \left\| { {\mathop{\rm sig}\nolimits}^{{\beta }} {{({{\mathit{\boldsymbol{s}}}_i}(t_{k_i}^i) - {{\mathit{\boldsymbol{s}}}_j}(t_{k_j}^j))}}} \right\| respectively. Recalling the trigger condition (12), and thus we have

    \begin{align} \mathop {\lim }\limits_{t \to t_{k_i + 1}^i} \left\| {{{\mathit{\boldsymbol{e}}}_{is}}(t)} \right\| = {\frac{1} {{\mathcal L }}} \left( {\zeta \sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|{\rm{ + }}\frac{\frac{1}{\theta}H_i^ \frac{1+\beta}{2}(t)}{\sum\limits_{j = 1}^n{{g_{ij}}}\left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|^\beta} } \right). \end{align} (37)

    It follows from Eqs (36) and (37) that

    \begin{align} \left( {t_{k_i + 1}^i - t_{k_i}^i} \right)&\ge {{\mathop {\lim }\limits_{t \to t_{k_i + 1}^i} \frac{\left\| {{{\mathit{\boldsymbol{e}}}_{is}}(t)} \right\|}{\left( {{M_{si}} + {\varsigma} + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}} \right)}} }\\ &\ge \frac{{\frac{1} {{\mathcal L }}} \left( {\zeta \sum\limits_{j = 1}^n {{g_{ij}}} \left\| {{{{\mathit{\boldsymbol{\hat s}}}}_i}(t_{k_i}^i) - {{{\mathit{\boldsymbol{\hat s}}}}_j}(t_{k_j}^j)} \right\|{\rm{ + }}{\frac{1}{\theta {M_{hi}}}H_i^ \frac{1+\beta}{2}(t)} } \right)}{{\left( {{M_{si}} + {\varsigma} + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}} \right)}} \\ &\ge \frac{ {\frac{1}{{\mathcal L }\theta {M_{hi}}}H_i^ \frac{1+\beta}{2}}(t)}{{\left( {{M_{si}} + {\varsigma} + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}} \right)}}. \end{align} (38)

    Notice that it has been proved that H_i(t) > 0 ; in each interval \left[ {t_{k_i}^i, t_{k_i + 1}^i} \right) , there must exist a lower bound {\mathcal H}_{(i, k)} > 0 for H_i(t) . It follows that

    \begin{align} &\left( {t_{k_i + 1}^i - t_{k_i}^i} \right)\ge \frac{ {\frac{1}{{\mathcal L }\theta {M_{hi}}}{\mathcal{H}}_{(i,k)}^ \frac{1+\beta}{2}}}{{\left( {{M_{si}} + {\varsigma _i} + \left\| {{D_i}} \right\| + \sum\limits_{j = 1}^n {{g_{ij}}} {M_{hi}}} \right)}} > 0. \end{align} (39)

    Based on the above deduction, we proved that the interval between two triggers of spacecraft is strictly greater than a positive constant, which means that Zeno behavior is avoided in the DETS. This completes the proof for Theorem 3.

    This section takes the three-spacecraft distributed formation system as an example to verify the effectiveness of ESO (4), DETS (12) and the FTSM control law (16) through simulation. The simulation scenario and parameter settings are as follows.

    Assuming that the spacecraft in the formation are of equal mass, and {{m}_{i}} = 100 Kg (i = 1, 2, 3) . The external disturbance in the simulation is taken as {{\mathit{\boldsymbol{f}}}_{di}(t)} = 0.0001\times \left[\rm{ sin}(3t), \rm{ cos}(4t), \rm {sin}(5t) \right]^\rm{T} N. Assume that the three spacecraft are slightly deviated from the pre-designed relative orbit at the initial time. The initial relative position errors and the initial velocity errors are set as {{\mathit{\boldsymbol{e}}}_{\rho 1}(0)} = \left[ 14, 11, -5 \right]^\rm{T} m, {{\mathit{\boldsymbol{e}}}_{\rho 2}(0)} = \left[ 17, 12, 18 \right]^\rm{T} m, {{\mathit{\boldsymbol{e}}}_{\rho 3}(0)} = \left[ -8, 13, 6 \right]^\rm{T} m, {{\mathit{\boldsymbol{e}}}_{vi}(0)} = \left[ 0, 0, 0 \right]^\rm{T} m/s, (i = 1, 2, 3) . For the communication topology, the weighted adjacency is set as

    {G = \left[ \begin{matrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \\ \end{matrix} \right]}.

    The parameters of the ESO are chosen as {{{l}}_{ij}} = 5, (i, j = 1, 2, 3) , {{\alpha }_{1}} = 1 , {{\alpha }_{2}} = 0.1 , {{\alpha }_{3}} = 4 , {{\alpha }_{4}} = 5 , {{\alpha }_{5}} = 0.01 , {{\alpha }_{6}} = 0.01 and q = \frac{1}{5} . We select the parameters of the FTSM control law as w = 1 , k_1 = k_2 = k_3 = 3 , {{\gamma }} = 0.1 , {{\varsigma }} = 0.2 , {{\kappa }} = 0.1 , p = \frac{1}{7} . In addition, since the control force in practical engineering cannot be infinite, we limit the control force to 1N in the simulation. Simulation results under the above parameter settings are provided in Figures 212.

    Figure 2.  Coordination schematics.
    Figure 3.  Position observation error.
    Figure 4.  Velocity observation error.
    Figure 5.  Nonlinearity and disturbance observation error.
    Figure 6.  Coordination error.
    Figure 7.  Relative position error.
    Figure 8.  Relative velocity error.
    Figure 9.  Sliding surface.
    Figure 10.  Control force.
    Figure 11.  Event trigger instants under DETS.
    Figure 12.  Event trigger instants under static ETS.

    Figure 2 shows the 3D trajectory of the formation, from which we can see that the spacecraft converged to the expected orbit. The trajectories of the estimation error vectors are shown in Figures 35. Obviously, the position observation error, the velocity observation error and the merging observation error of non-linearity and disturbance quickly converge to the origin. Figure 6 shows the trajectory of the coordination vector. Figures 79 show, respectively, the trajectory of the relative position error vector, the trajectory of the relative velocity error vector and the trajectory of the sliding surface vector of the simulation system. The trajectory of the control force vector is shown in Figure 10. It can be seen that states of three spacecraft converge at around 150 s in a coordinated manner under control law (16). The coordination accuracy is within 1\times {{10}^{-5}} m, the relative position accuracy is within 5\times {{10}^{-5}} m, and the relative velocity accuracy is within 2\times {{10}^{-7}} m. Finally, the trigger instants for each spacecraft are exhibited in Figure 11 (according to the dynamic trigger condition (12), once h_i\ge 0 , an event is triggered). It can be noticed that under the DETS, the communication frequency is significantly reduced, and the Zeno behaviour is successfully avoided. In order to further illustrate the effectiveness of DETS (12), we added a comparative simulation by replacing DETS (12) with traditional static ETS (10), and the trigger instants under static ETS are exhibited in Figure 12. From the simulation figures, it can be seen that under the same working conditions, the amount of trigger instants for DETS is less than that of the static ETS, which shows the superiority of the method proposed in this paper.

    Through the above simulation results, we know that the finite-time relative position coordination can be achieved under the proposed FTSM control law in the presence of lacking velocity information and limited communication. The finite-time ESO can accurately and rapidly generate observations of position, velocity and the merging of non-linearity and disturbance. Also, the DETS can effectively reduce the communication frequency while ensuring the accuracy of the coordination.

    In this paper, we made the first attempt to investigate the coordinated control law for SFF systems that simultaneously considers finite-time coordination, unmeasured velocity and limited communication bandwidth. An ESO based FTSM control law under DETS was proposed. Lyapunov based theoretical stability analysis and numerical simulation have been carried out to verify the effectiveness of the control law. The result shows that finite-time relative position coordination of a distributed spacecraft formation without velocity information over limited communication bandwidth can be achieved by applying the proposed control law. Future work will focus on the optimization of the controller parameters using artificial intelligence technology.

    This work was supported by the Science Center Program of the National Natural Science Foundation of China (62188101), the National Natural Science Foundation of China (61833009, 61690212, 51875119), the Heilongjiang Touyan Team, and the Guangdong Major Project of Basic and Applied Basic Research (2019B030302001).

    The authors declare that they have no conflict of interest.



    [1] Anderson, TW (1971) The Statistical Analysis of Time Series. John Wiley & Sons, New York.
    [2] Brock W, Lakonishok J, LeBaron, B (1992) Simple Technical Trading Rules and the Stochastic Properties of Stock Returns. J Financ 47: 1731–1764. https://doi.org/10.2307/2328994 doi: 10.2307/2328994
    [3] Campbell JY, Lo AW, MacKinlay AC (1997) The Econometrics of Financial Markets. Princeton University Press, Princeton.
    [4] Charles A, Darné O (2009) Variance ratio test of random walk: an overview. J Econ Surv 23: 503–527. https://doi.org/10.1111/j.1467-6419.2008.00570.x doi: 10.1111/j.1467-6419.2008.00570.x
    [5] Christoffersen PF, Diebold FX (2006) Financial Asset Returns, Direction-of-Change Forecasting, and Volatility Dynamics. Manage Sci 52: 1273–1287. https://doi.org/10.1287/mnsc.1060.0520 doi: 10.1287/mnsc.1060.0520
    [6] Cowles A, Jones HE (1937) Some A Posteriori Probabilities in Stock Market Action. Econometrica 5: 280–294. https://doi.org/10.2307/1905515 doi: 10.2307/1905515
    [7] Fiorenzani S, Ravelli S, Edoli E (2012). Handbook of Energy Trading. John Wiley & Sons, Chichester.
    [8] Fisher RA (1925) Theory of Statistical Estimation. Math Proc Cambridge 22: 700–725. https://doi.org/10.1017/S0305004100009580 doi: 10.1017/S0305004100009580
    [9] Haas M, Pigorsch C (2009) Financial Economics: Fat–tailed Distributions. In Meyers, B., editor, Encyclopedia of Complexity and Systems Science. 4. Springer. https://doi.org/10.1007/978-0-387-30440-3
    [10] Hausman JA (1978) Specification Tests in Econometrics. Econometrica 46: 1251–1271. Specification Tests in Econometrics. https://doi.org/10.2307/1913827 doi: 10.2307/1913827
    [11] Lehmann EL, Casella G (1998) Theory of Point Estimation. Springer, New York.
    [12] Li A, Wei Q, Shi Y, et al. (2023) Research on stock price prediction from a data fusion perspective. Data Sci Financ Econ 3: 230–250. https://doi.org/10.3934/DSFE.2023014 doi: 10.3934/DSFE.2023014
    [13] Linton O (2019) Financial Econometrics: Models and Methods. Cambridge University Press, Cambridge.
    [14] Lo AW (2000) Finance: A Selective Survey. J Am Stat Assoc 95: 629–635. https://doi.org/10.2307/2669406 doi: 10.2307/2669406
    [15] Mikosch T, Stǎricǎ C (2000) Limit Theory for the Sample Autocorrelations and Extremes of a GARCH (1, 1) Process. Ann Stat 28: 1427–1451. https://doi.org/10.1214/aos/1015957401 doi: 10.1214/aos/1015957401
    [16] Sullivan R, Timmermann A, White H (1999) Data-Snooping, Technical Trading Rule Performance, and the Bootstrap. J Financ 54: 1647–1691. https://doi.org/10.1111/0022-1082.00163 doi: 10.1111/0022-1082.00163
    [17] Taylor SJ (2005) Asset price Dynamics, Volatility, and Prediction. Princeton University Press, Princeton.
    [18] Tsinaslanidis P, Guijarro F (2023) Testing for Sequences and Reversals on Bitcoin Series. In Tsounis, N. and Vlachvei, A., editors, Advances in Empirical Economic Research. ICOAE 2022. Springer, Cham. https://doi.org/10.1007/978-3-031-22749-3
    [19] Williamson SH (2023) Daily Closing Values of the DJA in the United States, 1885 to Present. MeasuringWorth. http://www.measuringworth.com/DJA/ (last accessed: May 5, 2023).
    [20] Xie H, Sun Y, Fan P (2023) Return direction forecasting: a conditional autoregressive shape model with beta density. Financ Innov 9: 1–16. https://doi.org/10.1186/s40854-023-00489-z doi: 10.1186/s40854-023-00489-z
  • This article has been cited by:

    1. Na Zhang, Jianwei Xia, Tianjiao Liu, Chengyuan Yan, Xiao Wang, Dynamic event-triggered adaptive finite-time consensus control for multi-agent systems with time-varying actuator faults, 2023, 20, 1551-0018, 7761, 10.3934/mbe.2023335
    2. Wenjing Wang, Jingjing Dong, Dong Xu, Zhilian Yan, Jianping Zhou, Synchronization control of time-delay neural networks via event-triggered non-fragile cost-guaranteed control, 2022, 20, 1551-0018, 52, 10.3934/mbe.2023004
    3. Wenjia Wang, 2023, Distributed Formation Control for Multiple Spacecraft with Event-triggered Communication, 979-8-3503-3172-1, 246, 10.1109/ICEIEC58029.2023.10200085
    4. Yifan Liu, Guozeng Cui, Ze Li, Fixed-time consensus control of stochastic nonlinear multi-agent systems with input saturation using command-filtered backstepping, 2024, 9, 2473-6988, 14765, 10.3934/math.2024718
    5. Qingxian Jia, Junnan Gao, Yunhua Wu, He Liao, Chengxi Zhang, Jin Wu, Dynamic event‐triggered orbit coordination for spacecraft formation via a self‐learning sliding mode control approach, 2024, 34, 1049-8923, 5754, 10.1002/rnc.7289
    6. Wenkang Hao, Qifeng Chen, Caisheng Wei, Yuxin Liao, Distributed control of spacecraft formation under J2 perturbation in the port-Hamiltonian framework, 2024, 74, 02731177, 5767, 10.1016/j.asr.2024.08.061
    7. Panfei Huang, Fuqiang Di, Hongshi Lu, Jiwei Xu, Sixiao Wang, Observer-based prescribed performance consensus protocol: Finite-time dynamic event-triggered schemes, 2024, 146, 12709638, 108931, 10.1016/j.ast.2024.108931
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1657) PDF downloads(109) Cited by(0)

Figures and Tables

Figures(3)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog