This paper considers actuator redundancy management for a class of overactuated nonlinear systems. Two tools for distributing the control effort among a redundant set of actuators are optimal control design and control allocation. In this paper, we investigate the relationship between these two design tools when the performance indexes are quadratic in the control input. We show that for a particular class of nonlinear systems, they give exactly the same design freedom in distributing the control effort among the actuators. Linear quadratic optimal control is contained as a special case. A benefit of using a separate control allocator is that actuator constraints can be considered, which is illustrated with a flight control example.

Resolving actuator redundancy: optimal control vs. control allocation

Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)

In this paper, a fault-tolerant control scheme is proposed for the rigid spacecraft attitude control system subject to external disturbances, multiple system uncertainties, and actuator faults. The angular velocity measurement is unavailable, which increases the complexity of the problem. An observer is first designed based on the super-twisting sliding mode method, which can provide accurate estimates of the angular velocity in finite time. Then, an adaptive fault-tolerant controller is proposed based on neural networks using the information from the observer. It is shown that the attitude orientations converge to the desired values exponentially. Finally, a simulation example is utilized to verify the effectiveness of the proposed scheme.

Fault-Tolerant Attitude Control for Rigid Spacecraft Without Angular Velocity Measurements

Faults and failures in the system components are two main reasons for the instability and the degradation in control performance. In recent decades, fault-tolerant control (FTC) approaches have been introduced to improve the resiliency of control systems against faults and failures. In general, FTC techniques are classified into active and passive approaches. This paper reviews fault and failure causes in control systems and discusses the latest solutions that are introduced to make the control system resilient.The recent achievements in fault detection and isolation (FDI) approaches and active FTC designs are investigated. Furthermore, a thorough comparison of several different aspects is conducted to understand the advantage and disadvantages of various FTC techniques to motivate researchers to further developing FTC and FDI approaches.

https://www.mdpi.com/2079-9292/9/9/1513/pdf

A Survey on Active Fault-Tolerant Control Systems

Adaptive sliding mode output feedback control for dynamic positioning ships with input saturation

Spacecraft attitude fault-tolerant control based on iterative learning observer and control allocation

Aiming at expanding few-shot relations' coverage in knowledge graphs (KGs), few-shot knowledge graph completion (FKGC) has recently gained more research interests. Some existing models employ a few-shot relation's multi-hop neighbor information to enhance its semantic representation. However, noise neighbor information might be amplified when the neighborhood is excessively sparse and no neighbor is available to represent the few-shot relation. Moreover, modeling and inferring complex relations of one-to-many (1-N), many-to-one (N-1), and many-to-many (N-N) by previous knowledge graph completion approaches requires high model complexity and a large amount of training instances. Thus, inferring complex relations in the few-shot scenario is difficult for FKGC models due to limited training instances. In this paper, we propose a few-shot relational learning with global-local framework to address the above issues. At the global stage, a novel gated and attentive neighbor aggregator is built for accurately integrating the semantics of a few-shot relation's neighborhood, which helps filtering the noise neighbors even if a KG contains extremely sparse neighborhoods. For the local stage, a meta-learning based TransH (MTransH) method is designed to model complex relations and train our model in a few-shot learning fashion. Extensive experiments show that our model outperforms the state-of-the-art FKGC approaches on the frequently-used benchmark datasets NELL-One and Wiki-One. Compared with the strong baseline model MetaR, our model achieves 5-shot FKGC performance improvements of 8.0% on NELL-One and 2.8% on Wiki-One by the metric Hits@10.

Relational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completion

Observer-based fault tolerant control and experimental verification for rigid spacecraft

Representation learning on a knowledge graph (KG) is to embed entities and relations of a KG into low-dimensional continuous vector spaces. Early KG embedding methods only pay attention to structured information encoded in triples, which would cause limited performance due to the structure sparseness of KGs. Some recent attempts consider paths information to expand the structure of KGs but lack explainability in the process of obtaining the path representations. In this paper, we propose a novel Rule and Path-based Joint Embedding (RPJE) scheme, which takes full advantage of the explainability and accuracy of logic rules, the generalization of KG embedding as well as the supplementary semantic structure of paths. Specifically, logic rules of different lengths (the number of relations in rule body) in the form of Horn clauses are first mined from the KG and elaborately encoded for representation learning. Then, the rules of length 2 are applied to compose paths accurately while the rules of length 1 are explicitly employed to create semantic associations among relations and constrain relation embeddings. Moreover, the confidence level of each rule is also considered in optimization to guarantee the availability of applying the rule to representation learning. Extensive experimental results illustrate that RPJE outperforms other state-of-the-art baselines on KG completion task, which also demonstrate the superiority of utilizing logic rules as well as paths for improving the accuracy and explainability of representation learning.

/pdf/rule-guided-compositional-representation-learning-on-34xwb573b9.pdf

Rule-Guided Compositional Representation Learning on Knowledge Graphs

Representation learning on a knowledge graph (KG) is to embed entities and relations of a KG into low-dimensional continuous vector spaces. Early KG embedding methods only pay attention to structured information encoded in triples, which would cause limited performance due to the structure sparseness of KGs. Some recent attempts consider paths information to expand the structure of KGs but lack explainability in the process of obtaining the path representations. In this paper, we propose a novel Rule and Path-based Joint Embedding (RPJE) scheme, which takes full advantage of the explainability and accuracy of logic rules, the generalization of KG embedding as well as the supplementary semantic structure of paths. Specifically, logic rules of different lengths (the number of relations in rule body) in the form of Horn clauses are first mined from the KG and elaborately encoded for representation learning. Then, the rules of length 2 are applied to compose paths accurately while the rules of length 1 are explicitly employed to create semantic associations among relations and constrain relation embeddings. Besides, the confidence level of each rule is also considered in optimization to guarantee the availability of applying the rule to representation learning. Extensive experimental results illustrate that RPJE outperforms other state-of-the-art baselines on KG completion task, which also demonstrate the superiority of utilizing logic rules as well as paths for improving the accuracy and explainability of representation learning.

Guanglin Niu

Papers

Spacecraft attitude fault-tolerant control based on iterative learning observer and control allocation

Relational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completion

Observer-based fault tolerant control and experimental verification for rigid spacecraft

Rule-Guided Compositional Representation Learning on Knowledge Graphs

Rule-Guided Compositional Representation Learning on Knowledge Graphs