arXiv subjects

Kai-Yuan Cai

Publications and source records attributed to Kai-Yuan Cai.

34 records · Page 2Linked to original sources

arXiv2017

Failsafe Mechanism Design of Multicopters Based on Supervisory Control Theory

In order to handle undesirable failures of a multicopter which occur in either the pre-flight process or the in-flight process, a failsafe mechanism design method based on supervisory control theory is proposed for the semi-autonomous control mode. Failsafe mechanism is a control logic that guides what subsequent actions the multicopter should take, by taking account of real-time information from guidance, attitude control, diagnosis, and other low-level subsystems. In order to design a failsafe mechanism for multicopters, safety issues of multicopters are introduced. Then, user requirements including functional requirements and safety requirements are textually described, where function requirements determine a general multicopter plant, and safety requirements cover the failsafe measures dealing with the presented safety issues. In order to model the user requirements by discrete-event systems, several multicopter modes and events are defined. On this basis, the multicopter plant and control specifications are modeled by automata. Then, a supervisor is synthesized by monolithic supervisory control theory. In addition, we present three examples to demonstrate the potential blocking phenomenon due to inappropriate design of control specifications. Also, we discuss the meaning of correctness and the properties of the obtained supervisor. This makes the failsafe mechanism convincingly correct and effective. Finally, based on the obtained supervisory controller generated by TCT software, an implementation method suitable for multicopters is presented, in which the supervisory controller is transformed into decision-making codes.

eess.SY↗

arXiv2017

Robust Dynamic Selection of Tested Modules in Software Testing for Maximizing Delivered Reliability

Software testing is aimed to improve the delivered reliability of the users. Delivered reliability is the reliability of using the software after it is delivered to the users. Usually the software consists of many modules. Thus, the delivered reliability is dependent on the operational profile which specifies how the users will use these modules as well as the defect number remaining in each module. Therefore, a good testing policy should take the operational profile into account and dynamically select tested modules according to the current state of the software during the testing process. This paper discusses how to dynamically select tested modules in order to maximize delivered reliability by formulating the selection problem as a dynamic programming problem. As the testing process is performed only once, risk must be considered during the testing process, which is described by the tester's utility function in this paper. Besides, since usually the tester has no accurate estimate of the operational profile, by employing robust optimization technique, we analysis the selection problem in the worst case, given the uncertainty set of operational profile. By numerical examples, we show the necessity of maximizing delivered reliability directly and using robust optimization technique when the tester has no clear idea of the operational profile. Moreover, it is shown that the risk averse behavior of the tester has a major influence on the delivered reliability.

cs.SE↗

arXiv2016

Representing Extended Finite State Machines for SDL by A Novel Control Model of Discrete Event Systems

This paper discusses EFSM for SDL and transforms EFSM into a novel control model of discrete event systems. We firstly propose a control model of discrete event systems, where the event set is made up of several conflicting pairs and control is implemented to select one event of the pair. Then we transform EFSM for SDL to the control model to clarify the control mechanism functioning in SDL flow graphs. This work views the EFSM for SDL in the perspective of supervisory control theory, and this contributes to the field of software cybernetics, which explores the theoretically justified interplay of software and the control.

cs.FL↗

arXiv2015

Controllability Analysis for Multirotor Helicopter Rotor Degradation and Failure

This paper considers the controllability analysis problem for a class of multirotor systems subject to rotor failure/wear. It is shown that classical controllability theories of linear systems are not sufficient to test the controllability of the considered multirotors. Owing to this, an easy-to-use measurement index is introduced to assess the available control authority. Based on it, a new necessary and sufficient condition for the controllability of multirotors is derived. Furthermore, a controllability test procedure is approached. The proposed controllability test method is applied to a class of hexacopters with different rotor configurations and different rotor efficiency parameters to show its effectiveness. The analysis results show that hexacopters with different rotor configurations have different fault-tolerant capabilities. It is therefore necessary to test the controllability of the multirotors before any fault-tolerant control strategies are employed.

eess.SY↗

arXiv2014

Calibration of Multiple Fish-Eye Cameras Using a Wand

Fish-eye cameras are becoming increasingly popular in computer vision, but their use for 3D measurement is limited partly due to the lack of an accurate, efficient and user-friendly calibration procedure. For such a purpose, we propose a method to calibrate the intrinsic and extrinsic parameters (including radial distortion parameters) of two/multiple fish-eye cameras simultaneously by using a wand under general motions. Thanks to the generic camera model used, the proposed calibration method is also suitable for two/multiple conventional cameras and mixed cameras (e.g. two conventional cameras and a fish-eye camera). Simulation and real experiments demonstrate the effectiveness of the proposed method. Moreover, we develop the camera calibration toolbox, which is available online.

cs.CV↗

arXiv2014

Controllability Analysis and Degraded Control for a Class of Hexacopters Subject to Rotor Failures

This paper considers the controllability analysis and fault tolerant control problem for a class of hexacopters. It is shown that the considered hexacopter is uncontrollable when one rotor fails, even though the hexacopter is over-actuated and its controllability matrix is row full rank. According to this, a fault tolerant control strategy is proposed to control a degraded system, where the yaw states of the considered hexacopter are ignored. Theoretical analysis indicates that the degraded system is controllable if and only if the maximum lift of each rotor is greater than a certain value. The simulation and experiment results on a prototype hexacopter show the feasibility of our controllability analysis and degraded control strategy.

eess.SY↗

arXiv2014

Discrete-Time Output-Feedback Robust Repetitive Control for a Class of Nonlinear Systems by Additive State Decomposition

The discrete-time robust repetitive control (RC, or repetitive controller, also designated RC) problem for nonlinear systems is both challenging and practical. This paper proposes a discrete-time output-feedback RC design for a class of systems subject to measurable nonlinearities to track reference robustly with respect to the period variation. The design relies on additive state decomposition, by which the output-feedback RC problem is decomposed into an output-feedback RC problem for a linear time-invariant system and a state-feedback stabilization problem for a nonlinear system. Thanks to the decomposition, existing controller design methods in both the frequency domain and time domain can be employed to make the robustness and discretization for a nonlinear system tractable. To demonstrate the effectiveness, an illustrative example is given.

eess.SY↗

arXiv2014

A New Causal Ideal Internal Dynamics Generator

The design of ideal internal dynamics (IID) generators, namely solving IID, is a fundamental problem, which is a key step to handle the nonminimum-phase output tracking problem. In this paper, for a class of unstable matrix differential equations, a new causal dynamic IID generator is proposed, whose parameters are partly chosen via H_2/H_inf optimization. Compared with existing similar generators, it is applicable to matrix differential equations with singular system matrices and is easily extended to slowly time-varying matrix differential equations without extra computation.

eess.SY↗

arXiv2014

Additive-State-Decomposition Dynamic Inversion Stabilized Control for a Class of Uncertain MIMO Systems

This paper presents a new control, namely additive-state-decomposition dynamic inversion stabilized control, that is used to stabilize a class of multi-input multi-output (MIMO) systems subject to nonparametric time-varying uncertainties with respect to both state and input. By additive state decomposition and a new definition of output, the considered uncertain system is transformed into a minimum-phase uncertainty-free system with relative degree one, in which all uncertainties are lumped into a new disturbance at the output. Subsequently, dynamic inversion control is applied to reject the lumped disturbance. Performance analysis of the resulting closed-loop dynamics shows that the stability can be ensured. Finally, to demonstrate its effectiveness, the proposed control is applied to two existing problems by numerical simulation. Furthermore, in order to show its practicability, the proposed control is also performed on a real quadrotor to stabilize its attitude when its inertia moment matrix is subject to a large uncertainty.

eess.SY↗

arXiv2014

A New Continuous-Time Equality-Constrained Optimization Method to Avoid Singularity

In equality-constrained optimization, a standard regularity assumption is often associated with feasible point methods, namely the gradients of constraints are linearly independent. In practice, the regularity assumption may be violated. To avoid such a singularity, we propose a new projection matrix, based on which a feasible point method for the continuous-time, equality-constrained optimization problem is developed. First, the equality constraint is transformed into a continuous-time dynamical system with solutions that always satisfy the equality constraint. Then, the singularity is explained in detail and a new projection matrix is proposed to avoid singularity. An update (or say a controller) is subsequently designed to decrease the objective function along the solutions of the transformed system. The invariance principle is applied to analyze the behavior of the solution. We also propose a modified approach for addressing cases in which solutions do not satisfy the equality constraint. Finally, the proposed optimization approaches are applied to two examples to demonstrate its effectiveness.

cs.NE↗

arXiv2012

Additive-State-Decomposition-Based Tracking Control for TORA Benchmark

In this paper, a new control scheme, called additive state decomposition based tracking control, is proposed to solve the tracking (rejection) problem for rotational position of the TORA (a nonlinear nonminimum phase system). By the additive state decomposition, the tracking (rejection) task for the considered nonlinear system is decomposed into two independent subtasks: a tracking (rejection) subtask for a linear time invariant (LTI) system, leaving a stabilization subtask for a derived nonlinear system. By the decomposition, the proposed tracking control scheme avoids solving regulation equations and can tackle the tracking (rejection) problem in the presence of any external signal (except for the frequencies at +1 or -1) generated by a marginally stable autonomous LTI system. To demonstrate the effectiveness, numerical simulation is given.

eess.SY↗

arXiv2012

Output Feedback Tracking Control for a Class of Uncertain Systems subject to Unmodeled Dynamics and Delay at Input

Besides parametric uncertainties and disturbances, the unmodeled dynamics and time delay at the input are often present in practical systems, which cannot be ignored in some cases. This paper aims to solve output feedback tracking control problem for a class of nonlinear uncertain systems subject to unmodeled high-frequency gains and time delay at the input. By the additive decomposition, the uncertain system is transformed to an uncertainty-free system, where the uncertainties, disturbance and effect of unmodeled dynamics plus time delay are lumped into a new disturbance at the output. Sequently, additive decomposition is used to decompose the transformed system, which simplifies the tracking controller design. To demonstrate the effectiveness, the proposed control scheme is applied to three benchmark examples.

eess.SY↗

arXiv2012

Additive-Decomposition-Based Output Feedback Tracking Control for Systems with Measurable Nonlinearities and Unknown Disturbances

In this paper, a new control scheme, called as additive-decomposition-based tracking control, is proposed to solve the output feedback tracking problem for a class of systems with measurable nonlinearities and unknown disturbances. By the additive decomposition, the output feedback tracking task for the considered nonlinear system is decomposed into three independent subtasks: a pure tracking subtask for a linear time invariant (LTI) system, a pure rejection subtask for another LTI system and a stabilization subtask for a nonlinear system. By benefiting from the decomposition, the proposed additive-decomposition-based tracking control scheme i) can give a potential way to avoid conflict among tracking performance, rejection performance and robustness, and ii) can mix both design in time domain and frequency domain for one controller design. To demonstrate the effectiveness, the output feedback tracking problem for a single-link robot arm subject to a sinusoidal or a general disturbance is solved respectively, where the transfer function method for tracking and rejection and backstepping method for stabilization are applied together to the design.

nlin.AO↗

arXiv2009

Phase Transition on The Degree Sequence of a Mixed Random Graph Process

This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and non-uniformly bounded. By developing a comparing argument, phase transition on the degree distributions of the mixed model is revealed: while the {\it pure} classical model possesses a {\it exponential} degree sequence, the {\it pure} BA model and the mixed model possess {\it power law} degree sequences. As an application of the methodology, phase transition on the degree sequence of {\it another} mixed model with {\it hard copying} is also studied, especially, in the power law region, the inverse power can take any value greater than 1.

math.PR↗

arXiv2008

The Degree Sequence of a Scale-Free Random Graph Process with Hard Copying

In this paper we consider a simple model of random graph process with {\it hard} copying as follows: At each time step $t$, with probability $0<α\leq 1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in the manner of {\it preferential attachment}; or with probability $1-α$ an existing vertex is copied uniformly at random. In this way, while a vertex with large degree is copied, the number of added edges is its degree and thus the number of added edges is not upper bounded. We prove that, in the case of $α$ being large enough, the model possesses a mean degree sequence as $ d_{k}\sim Ck^{-(1+2α)}$, where $d_k$ is the limit mean proportion of vertices of degree $k$.

math.PR↗

arXiv2008

On the Degree Sequence and its Critical Phenomenon of an Evolving Random Graph Process

In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $α_1$, a new vertex $x_t$ and $m$ edges incident with $x_t$ are added; or, with probability $α-α_1$, $m$ edges are added; or finally, with probability $1-\a$, $m$ random edges are deleted. Note that in any case edges are added in the manner of preferential attachment. we prove that there exists a critical point $α_c$ satisfying: 1) if $α_1<α_c$, then the model has power law degree sequence; 2) if $α_1>α_c$, then the model has exponential degree sequence; and 3) if $α_1=α_c$, then the model has a degree sequence lying between the above two cases.

math.PR↗