arXiv subjects

Qiang Shen

Publications and source records attributed to Qiang Shen.

23 records · Page 2Linked to original sources

arXiv2019

Decoder Choice Network for Meta-Learning

Meta-learning has been widely used for implementing few-shot learning and fast model adaptation. One kind of meta-learning methods attempt to learn how to control the gradient descent process in order to make the gradient-based learning have high speed and generalization. This work proposes a method that controls the gradient descent process of the model parameters of a neural network by limiting the model parameters in a low-dimensional latent space. The main challenge of this idea is that a decoder with too many parameters is required. This work designs a decoder with typical structure and shares a part of weights in the decoder to reduce the number of the required parameters. Besides, this work has introduced ensemble learning to work with the proposed approach for improving performance. The results show that the proposed approach is witnessed by the superior performance over the Omniglot classification and the miniImageNet classification tasks.

cs.LG↗

arXiv2019

Development of a General Momentum Exchange Devices Fault Model for Spacecraft Fault-Tolerant Control System Design

This paper investigates the mechanism of various faults of momentum exchange devices. These devices are modeled as a cascade electric motor EM - variable speed drive VSD system. Considering the mechanical part of the EM and the VSD system, the potential faults are reviewed and summarized. Thus with a clear understanding of these potential faults, a general fault model in a cascade multiplicative structure is established for momentum exchange devices. Based on this general model, various fault scenarios can be simulated, and the possible output can be appropriately visualized. In this paper, six types of working condition are identified and the corresponding fault models are constructed. Using this fault model, the control responses using reaction wheels and single gimbal control moment gyros under various fault conditions are demonstrated. The simulation results show the severities of the faults and demonstrate that the additive fault is more serious than the multiplicative fault from the viewpoint of control accuracy. Finally, existing fault-tolerant control strategies are brief summarized and potential approaches including both passive and active ones to accommodate gimbal fault of single gimbal control moment gyro is demonstrated.

eess.SY↗

arXiv2019

DS-VIO: Robust and Efficient Stereo Visual Inertial Odometry based on Dual Stage EKF

This paper presents a dual stage EKF (Extended Kalman Filter)-based algorithm for the real-time and robust stereo VIO (visual inertial odometry). The first stage of this EKF-based algorithm performs the fusion of accelerometer and gyroscope while the second performs the fusion of stereo camera and IMU. Due to the sufficient complementary characteristics between accelerometer and gyroscope as well as stereo camera and IMU, the dual stage EKF-based algorithm can achieve a high precision of odometry estimations. At the same time, because of the low dimension of state vector in this algorithm, its computational efficiency is comparable to previous filter-based approaches. We call our approach DS-VIO (dual stage EKFbased stereo visual inertial odometry) and evaluate our DSVIO algorithm by comparing it with the state-of-art approaches including OKVIS, ROVIO, VINS-MONO and S-MSCKF on the EuRoC dataset. Results show that our algorithm can achieve comparable or even better performances in terms of the RMS error

cs.CV↗

arXiv2018

Mesh-Based Affine Abstraction of Nonlinear Systems with Tighter Bounds

In this paper, we consider the problem of piecewise affine abstraction of nonlinear systems, i.e., the overapproximation of its nonlinear dynamics by a pair of piecewise affine functions that "includes" the dynamical characteristics of the original system. As such, guarantees for controllers or estimators based on the affine abstraction also apply to the original nonlinear system. Our approach consists of solving a linear programming (LP) problem that over-approximates the nonlinear function at only the grid points of a mesh with a given resolution and then accounting for the entire domain via an appropriate correction term. To achieve a desired approximation accuracy, we also iteratively subdivide the domain into subregions. Our method applies to nonlinear functions with different degrees of smoothness, including Lipschitz continuous functions, and improves on existing approaches by enabling the use of tighter bounds. Finally, we compare the effectiveness of our approach with existing optimization-based methods in simulation and illustrate its applicability for estimator design.

math.OC↗

arXiv2014

Learning Bayesian Network Equivalence Classes with Ant Colony Optimization

Bayesian networks are a useful tool in the representation of uncertain knowledge. This paper proposes a new algorithm called ACO-E, to learn the structure of a Bayesian network. It does this by conducting a search through the space of equivalence classes of Bayesian networks using Ant Colony Optimization (ACO). To this end, two novel extensions of traditional ACO techniques are proposed and implemented. Firstly, multiple types of moves are allowed. Secondly, moves can be given in terms of indices that are not based on construction graph nodes. The results of testing show that ACO-E performs better than a greedy search and other state-of-the-art and metaheuristic algorithms whilst searching in the space of equivalence classes.

cs.NE↗