Tingting Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tingting Zhang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Fengzhi Guo
System Design Institute of Hubei Aerospace Technology and Academy, Wuhan, 430040, China
2 shared publications - Shijie Zhang
Harbin Institute of Technology, 150001 Harbin, People’s Republic of China
2 shared publications - Anhui Zhang
School of Astronautics, Harbin Institute of Technology, Harbin, 150001 China
1 shared publication - Anhui Zhang
School of Astronautics, Harbin Institute of Technology, Harbin 150001, China
1 shared publication - Dehua Chen
School of Physics and Electronic Science, East China Normal University, Shanghai 200241, People's Republic of China
1 shared publication Jiajin Le
School of Computer Science and Technology, Donghua University, Shanghai, P. R. China
1 shared publication
Latest Publications
- Open Access
- 2 March 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-25
Event-Triggered Adaptive Sliding Mode Attitude Containment Control for Microsatellite Cluster under Directed Graph
In order to investigate the attitude containment control problem for a microsatellite cluster, an event-triggered adaptive sliding mode attitude containment control algorithm is proposed for the satellite cluster flight system under directed topology, so that attitude of followers asymptotically converges to the convex hull formed by the leaders’ orientations. At first, the event-triggered control strategy is introduced into the attitude containment control problem for the microsatellite cluster. The triggering condition consisting of state-dependent and time-dependent function is designed to adjust control period and avoid the Zeno behaviour. When the function value meets the triggering condition, the event is triggered, state information is sampled, control law is computed, and actuators are updated, while the control action performed in nontriggering time is the same as the previous triggering instant. Then, in the presence of model uncertainties and external disturbances, an event-triggered adaptive sliding mode attitude containment control algorithm is presented under directed topology, and sufficient and necessary conditions for the followers to enter into the target area formed by the leaders are given. Furthermore, cell partitions from graph theory are employed to investigate the influence of information topology on steady states of followers, which provides theoretical basis for orientation design of cluster satellites. Finally, simulation results show that the proposed control strategy could reduce control execution frequency, as well as ensure the similar control performance with the time-triggered one, and followers belonging to the same cell have the same steady states.
- 2 March 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-25
Open AccessEvent-Triggered Adaptive Sliding Mode Attitude Containment Control for Microsatellite Cluster under Directed Graph
In order to investigate the attitude containment control problem for a microsatellite cluster, an event-triggered adaptive sliding mode attitude containment control algorithm is proposed for the satellite cluster flight system under directed topology, so that attitude of followers asymptotically converges to the convex hull formed by the leaders’ orientations. At first, the event-triggered control strategy is introduced into the attitude containment control problem for the microsatellite cluster. The triggering condition consisting of state-dependent and time-dependent function is designed to adjust control period and avoid the Zeno behaviour. When the function value meets the triggering condition, the event is triggered, state information is sampled, control law is computed, and actuators are updated, while the control action performed in nontriggering time is the same as the previous triggering instant. Then, in the presence of model uncertainties and external disturbances, an event-triggered adaptive sliding mode attitude containment control algorithm is presented under directed topology, and sufficient and necessary conditions for the followers to enter into the target area formed by the leaders are given. Furthermore, cell partitions from graph theory are employed to investigate the influence of information topology on steady states of followers, which provides theoretical basis for orientation design of cluster satellites. Finally, simulation results show that the proposed control strategy could reduce control execution frequency, as well as ensure the similar control performance with the time-triggered one, and followers belonging to the same cell have the same steady states.
- Open Access
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 164637-164660
Orbital Containment Control Algorithm and Complex Information Topology Design for Large-Scale Cluster of Spacecraft
In order to investigate coordinated orbit control problem for large-scale cluster flight spacecraft, a distributed orbital containment control algorithm is proposed for spacecraft cluster flight system with multiple leaders. At first, a general distributed orbital containment control strategy for large-scale cluster spacecraft system is given, so that all followers are driven to the convex hull formed by leaders. Then the constraints of convergence and convergence rate of cluster spacecraft system on control gains and information topology are investigated. Specifically, the control gains which achieve maximal convergence rate are analyzed. Furthermore, two kinds of cell partitions from graph theory are employed to investigate the influence of information topology on steady states of followers, which provides theoretical basis for collision avoidance design. Finally, simulation results show that the designed information topology could meet the requirements of large-scale cluster system, and followers belonging to the same cell have the same steady states.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 164637-164660
Open AccessOrbital Containment Control Algorithm and Complex Information Topology Design for Large-Scale Cluster of Spacecraft
In order to investigate coordinated orbit control problem for large-scale cluster flight spacecraft, a distributed orbital containment control algorithm is proposed for spacecraft cluster flight system with multiple leaders. At first, a general distributed orbital containment control strategy for large-scale cluster spacecraft system is given, so that all followers are driven to the convex hull formed by leaders. Then the constraints of convergence and convergence rate of cluster spacecraft system on control gains and information topology are investigated. Specifically, the control gains which achieve maximal convergence rate are analyzed. Furthermore, two kinds of cell partitions from graph theory are employed to investigate the influence of information topology on steady states of followers, which provides theoretical basis for collision avoidance design. Finally, simulation results show that the designed information topology could meet the requirements of large-scale cluster system, and followers belonging to the same cell have the same steady states.
- 14 June 2019
- Published by Springer Nature
- p. 184-192
Deep Learning-Based V2V Channel Estimations Using VNETs
- 14 June 2019
- Published by Springer Nature
- p. 184-192
Deep Learning-Based V2V Channel Estimations Using VNETs
- 12 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 196-202
Sensor time series association rule discovery based on modified discretization method
Association rule discovery from sensor time series is a challenge. Because the time series has high dimensional, numerical and continuous nature. However the general association methods can only deal with data which are symbolic and discrete. And the general association methods have high processing time consumption when the data have high dimension. So a useful framework is proposed, which is pre-processing, representation, discretization and temporal association mining. In the discretization section, a modified discretization method is proposed which can combine the advantages of other methods, such as piecewise aggregate approximation (PAA), knee point selection, symbolic aggregate approximation (SAX) and monotonicity feature extraction. In the association section, a modified Apriori algorithm is proposed to discover special patterns and normal rules.
- 12 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 196-202
Sensor time series association rule discovery based on modified discretization method
Association rule discovery from sensor time series is a challenge. Because the time series has high dimensional, numerical and continuous nature. However the general association methods can only deal with data which are symbolic and discrete. And the general association methods have high processing time consumption when the data have high dimension. So a useful framework is proposed, which is pre-processing, representation, discretization and temporal association mining. In the discretization section, a modified discretization method is proposed which can combine the advantages of other methods, such as piecewise aggregate approximation (PAA), knee point selection, symbolic aggregate approximation (SAX) and monotonicity feature extraction. In the association section, a modified Apriori algorithm is proposed to discover special patterns and normal rules.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (1930529X) , 1-6
Fair Energy Allocation in Wireless Sensor Networks: Theory and Practice
This paper deals with the energy allocation in multi-hop wireless sensor networks. Because the traffic loads are not evenly distributed in a multi-hop wireless sensor network, different sensor nodes usually experience different energy consumption rates. We present Routing Independent Fair Energy-Allocation Scheme (RIFES), which allocates the available energy resource to a sensor node according to its pre-estimated traffic load. Because traffic load is the dominating source of energy consumption, RIFES optimizes the network's lifetime by equalizing all individual nodes' expected energy exhaustion times. Due to the fact that a node's real experienced traffic load may differ to its pre-estimated traffic load in practice, it is hard for RIFES to achieve its theoretical optimal performance. To bridge this gap between theory and practice, this paper also presents several distributed routing algorithms, the use of which prolongs the network's lifetime by balancing the real-experienced traffic loads among neighboring nodes.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (1930529X) , 1-6
Fair Energy Allocation in Wireless Sensor Networks: Theory and Practice
This paper deals with the energy allocation in multi-hop wireless sensor networks. Because the traffic loads are not evenly distributed in a multi-hop wireless sensor network, different sensor nodes usually experience different energy consumption rates. We present Routing Independent Fair Energy-Allocation Scheme (RIFES), which allocates the available energy resource to a sensor node according to its pre-estimated traffic load. Because traffic load is the dominating source of energy consumption, RIFES optimizes the network's lifetime by equalizing all individual nodes' expected energy exhaustion times. Due to the fact that a node's real experienced traffic load may differ to its pre-estimated traffic load in practice, it is hard for RIFES to achieve its theoretical optimal performance. To bridge this gap between theory and practice, this paper also presents several distributed routing algorithms, the use of which prolongs the network's lifetime by balancing the real-experienced traffic loads among neighboring nodes.