This paper investigates the attitude tracking and disturbance rejection problem of rigid spacecraft. Using a new matrix product, i.e., the semitensor product of matrices, the parameter uncertainties in the inertia mat...This paper investigates the attitude tracking and disturbance rejection problem of rigid spacecraft. Using a new matrix product, i.e., the semitensor product of matrices, the parameter uncertainties in the inertia matrix is isolated. Both the parameter uncertainties and the external disturbance are handled by robust adaptive control method. By combining the semitensor product of matrices, backstepping control methodology, and adaptive control technique, a new adaptive control law is designed. Simulation result is also presented to demonstrate the proposed design method.展开更多
Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions ar...Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms.Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.展开更多
In this paper, we propose a matrix-based approach for finite automata and then study the reachability conditions. Both the deterministic and nondeterministic automata are expressed in matrix forms, and the necessary a...In this paper, we propose a matrix-based approach for finite automata and then study the reachability conditions. Both the deterministic and nondeterministic automata are expressed in matrix forms, and the necessary and sufficient conditions on reachability are given using semitensor product of matrices. Our results show that the matrix expression provides an effective computational way for the reachability analysis of finite automata.展开更多
基金supported by the National Natural Science Foundation of China(Nos.60736022,61074114)
文摘This paper investigates the attitude tracking and disturbance rejection problem of rigid spacecraft. Using a new matrix product, i.e., the semitensor product of matrices, the parameter uncertainties in the inertia matrix is isolated. Both the parameter uncertainties and the external disturbance are handled by robust adaptive control method. By combining the semitensor product of matrices, backstepping control methodology, and adaptive control technique, a new adaptive control law is designed. Simulation result is also presented to demonstrate the proposed design method.
基金supported by the National Natural Science Foundation of China(61174094)the Tianjin Natural Science Foundation of China(13JCYBJC1740014JCYBJC18700)
文摘Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms.Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.
基金supported by the National Natural Science Foundation of China (No. 61174071)
文摘In this paper, we propose a matrix-based approach for finite automata and then study the reachability conditions. Both the deterministic and nondeterministic automata are expressed in matrix forms, and the necessary and sufficient conditions on reachability are given using semitensor product of matrices. Our results show that the matrix expression provides an effective computational way for the reachability analysis of finite automata.
