Search

This paper addresses the problem of designing novel switching control for a class of stochastic nonlinear switched fuzzy systems with time delay. Firstly, a stochastic nonlinear switched fuzzy system can precisely describe continuous and discrete dynamics as well as their interactions in the complex real-world systems. Next, novel control algorithm and switching law design of the state-dependent form are developed such that the stability is guaranteed. Since convex combination techniques are used to derive the delay independent criteria, some subsystems are allowed to be unstable. Finally, various comparisons of the elaborated examples are conducted to demonstrate the effectiveness of the proposed control design approach. All results illustrate good control performances as desired. [ABSTRACT FROM AUTHOR]

The discrete coupled algebraic Riccati equation (DCARE) has wide applications in robust control, optimal control, and so on. In this paper, we present two iterative algorithms for solving the DCARE. The two iterative algorithms contain both the iterative solution in the last iterative step and the iterative solution in the current iterative step. And, for different initial value, the iterative sequences are increasing and bounded in one algorithm and decreasing and bounded in another. They are all monotonous and convergent. Numerical examples demonstrate the convergence effect of the presented algorithms. [ABSTRACT FROM AUTHOR]

Cognitive radar can overcome the shortcomings of traditional radars that are difficult to adapt to complex environments and adaptively adjust the transmitted waveform through closed-loop feedback. The optimization design of the transmitted waveform is a very important issue in the research of cognitive radar. Most of the previous studies on waveform design assume that the prior information of the target spectrum is completely known, but actually the target in the real scene is uncertain. In order to simulate this situation, this paper uses a robust waveform design scheme based on signal-to-interference-plus-noise ratio (SINR) and mutual information (MI). After setting up the signal model, the SINR and MI between target and echo are derived based on the information theory, and robust models for MI and SINR are established. Next, the MI and SINR are maximized by using the maximum marginal allocation (MMA) algorithm and the water-filling method which is improved by bisection algorithm. Simulation results show that, under the most unfavorable conditions, the robust transmitted waveform has better performance than other waveforms in the improvement degree of SINR and MI. By comparing the robust transmitted waveform based on SINR criterion and MI criterion, the influence on the variation trend of SINR and MI is explored, and the range of critical value of Ty is found. The longer the echo observation time is, the better the performance of the SINR-based transmitted waveform over the MI-based transmitted waveform is. For the mutual information between the target and the echo, the performance of the MMA algorithm is better than the improved water-filling algorithm. [ABSTRACT FROM AUTHOR]

In recent years, more and more scientists have been interested in research on driving two-wheel bicycles. The problems in two-wheel bicycle control problem are self-balancing, uncertain models, and the impact of noise. In the paper, to solve the self-balancing problem, we use the flywheel method according to the inverted pendulum principle. To overcome the effects of the uncertain model, the impact of noise, we designed the vehicle balance controller according to the robust control algorithm. However, robust controllers often have a high order, which affects the quality during real control. To simplify the robust controller, we propose the use of a model order reduction algorithm. The simulation and experimental results have proved the correctness of the solutions given in the paper. [ABSTRACT FROM AUTHOR]

As a key feature of networked control systems (NCSs), the time delays induced by communication medium sharing and data exchange over the system components could largely degrade the NCS performances or may even cause system instability, and thus, it is of critical importance to reduce time delays within NCSs. This paper studies the time-delay reduction problem in distributed NCSs and presents a dual-way data scheduling mechanism for time-delay reductions in delay-bounded NCSs with time-varying delays. We assess the time delays and their influences on the NCSs first with various delay factors being considered and then describe a one-way scheduling mechanism for network-delay reductions in NCSs. Based upon such a method, a dual-way scheduling algorithm is finally proposed for distributed NCSs with different types of transmitted data packets. Experiments are conducted on a remote teaching platform to verify the effectiveness of the proposed dual-way scheduling mechanism. Results demonstrate that, with the stability time-delay bound considered within the scheduling process, the proposed mechanism is effective for NCS time-delay reductions while addressing the stability, control accuracy, and settling time issues efficiently. Such a proposed mechanism could also be implemented together with some other existing control algorithms for time-delay reductions in NCSs. Our work could provide both useful theoretical guidance and application references for stable tracking control of delay-bounded NCSs. [ABSTRACT FROM AUTHOR]

A phase-based adaptive differential evolution (PADE) algorithm is proposed to solve the economic load dispatch (ELD) considering valve-point effects (VPE) and transmission losses. To a great extent, PADE makes up for the drawbacks of the traditional differential evolution (DE) through three improvements. First, we establish an archive of storing successful individuals to improve the quality of offspring. Second, to balance the exploring and exploiting ability of the algorithm, a phase-based mutation operation is carried out. Third, two control parameters are adaptively adjusted, which is helpful for enhancing the robustness of the algorithm. In addition, two types of repair methods of constraint handling are employed for the ELD without or with transmission losses to help PADE find feasible solutions more efficiently. A performance comparison between PADE and other DE approaches from the literature was carried out on six ELD test cases which consider a set of operating constraints including the VPE and transmission losses. Results show a competitive PADE performance in all test cases regarding the compared DE approaches. Compared to methods from the literature, the costs obtained by PADE are lower in most cases while the corresponding constraint violations reach a lower level. [ABSTRACT FROM AUTHOR]

This paper proposes a cascade control structure for three-phase grid-connected Photovoltaic (PV) systems. The PV system consists of a PV Generator, DC/DC converter, a DC link, a DC/AC fully controlled inverter, and the main grid. For the control process, a new control strategy using nonlinear Backstepping technique is developed. This strategy comprises three targets, namely, DC/DC converter control; tight control of the DC link voltage; and delivering the desired output power to the active grid with unity power factor (PF). Moreover, the control process relies mainly on the formulation of stability based on Lyapunov functions. Maximizing the energy reproduced from a solar power generation system is investigated as well by using the Perturb and Observe (P&O) algorithm. The Energetic Macroscopic Representation (EMR) and its reverse Maximum Control Structure (MCS) are used to provide, respectively, an instantaneous average model and a cascade control structure. The robust proposed control strategy adapts well to the cascade control technique. Simulations have been conducted using Matlab/Simulink software in order to illustrate the validity and robustness of the proposed technique under different operating conditions, namely, abrupt changing weather condition, sudden parametric variations, and voltage dips, and when facing measurement uncertainties. The problem of controlling the grid-connected PV system is addressed and dealt by using the nonlinear Backstepping control. [ABSTRACT FROM AUTHOR]

Object tracking with robust scale estimation is a challenging task in computer vision. This paper presents a novel tracking algorithm that learns the translation and scale filters with a complementary scheme. The translation filter is constructed using the ridge regression and multidimensional features. A robust scale filter is constructed by the bidirectional scale estimation, including the forward scale and backward scale. Firstly, we learn the scale filter using the forward tracking information. Then the forward scale and backward scale can be estimated using the respective scale filter. Secondly, a conservative strategy is adopted to compromise the forward and backward scales. Finally, the scale filter is updated based on the final scale estimation. It is effective to update scale filter since the stable scale estimation can improve the performance of scale filter. To reveal the effectiveness of our tracker, experiments are performed on 32 sequences with significant scale variation and on the benchmark dataset with 50 challenging videos. Our results show that the proposed tracker outperforms several state-of-the-art trackers in terms of robustness and accuracy. [ABSTRACT FROM AUTHOR]

Satellite remote sensing image target matching recognition exhibits poor robustness and accuracy because of the unfit feature extractor and large data quantity. To address this problem, we propose a new feature extraction algorithm for fast target matching recognition that comprises an improved feature from accelerated segment test (FAST) feature detector and a binary fast retina key point (FREAK) feature descriptor. To improve robustness, we extend the FAST feature detector by applying scale space theory and then transform the feature vector acquired by the FREAK descriptor from decimal into binary. We reduce the quantity of data in the computer and improve matching accuracy by using the binary space. Simulation test results show that our algorithm outperforms other relevant methods in terms of robustness and accuracy. [ABSTRACT FROM AUTHOR]

This study proposes a chaos robustness criterion for a kind of 2D piecewise smooth maps (2DPSMs). Using the chaos robustness criterion, one can easily determine the robust chaos parameter regions for some 2DPSMs. Combining 2DPSM with a generalized synchronization (GS) theorem, this study introduces a novel 6-dimensional discrete GS chaotic system. Based on the system, a 216-word chaotic pseudorandom number generator (CPRNG) is designed. The key space of the CPRNG is larger than 2996. Using the FIPS 140-2 test suit/generalized FIPS 140-2 test suit tests the randomness of the 1000 key streams consists of 20,000 bits generated by the CPRNG, the RC4 algorithm, and the ZUC algorithm, respectively. The numerical results show that the three algorithms do not have significant differences. The CPRNG and a stream encryption scheme with avalanche effect (SESAE) are used to encrypt an image. The results demonstrate that the CPRNG is able to generate the avalanche effects which are similar to those generated via ideal CPRNGs. The SESAE with one-time-pad scheme makes any attackers have to use brute attacks to break our cryptographic system. [ABSTRACT FROM AUTHOR]

A robust H∞ control method and switched control algorithm for hydraulic actuator presents in human-machine coordinated motion to solve the motion delay of lower extremity exoskeleton. After the characteristic parameters synthesis of human limb and exoskeleton linkage, the human-machine coupled motion model is constructed to estimate the appropriate hydraulic pressure, which is considered as a structural uncertainty in hydraulic model. Then the robust controller is designed to improve the robust stability and performance under the structural and parametric uncertainty disturbances. Simulation results show that, in walking mode, this robust controller can achieve a better dynamic response and aid-force efficiency than PID controller. Then, according to gait divisions of person’s limb motion, the switched control algorithm is designed to reduce the delay of exoskeleton tracking person. Finally, the experimental results show that the human-machine coordinated walk with bearing 60 kg load and squat action with no external load are realized effectively by this proposed method. [ABSTRACT FROM AUTHOR]

A robust fault detection scheme for a class of nonlinear systems with uncertainty is proposed. The proposed approach utilizes robust control theory and parameter optimization algorithm to design the gain matrix of fault tracking approximator (FTA) for fault detection. The gain matrix of FTA is designed to minimize the effects of system uncertainty on residual signals while maximizing the effects of system faults on residual signals. The design of the gain matrix of FTA takes into account the robustness of residual signals to system uncertainty and sensitivity of residual signals to system faults simultaneously, which leads to a multiobjective optimization problem. Then, the detectability of system faults is rigorously analyzed by investigating the threshold of residual signals. Finally, simulation results are provided to show the validity and applicability of the proposed approach. [ABSTRACT FROM AUTHOR]

Assessment of the components of a solution helps provide useful information for an optimization problem. This paper presents a new population-based problem-reduction evolutionary algorithm (PREA) based on the solution components assessment. An individual solution is regarded as being constructed by basic elements, and the concept of acceptability is introduced to evaluate them. The PREA consists of a searching phase and an evaluation phase. The acceptability of basic elements is calculated in the evaluation phase and passed to the searching phase. In the searching phase, for each individual solution, the original optimization problem is reduced to a new smaller-size problem. With the evolution of the algorithm, the number of common basic elements in the population increases until all individual solutions are exactly the same which is supposed to be the near-optimal solution of the optimization problem. The new algorithm is applied to a large variety of capacitated vehicle routing problems (CVRP) with customers up to nearly 500. Experimental results show that the proposed algorithm has the advantages of fast convergence and robustness in solution quality over the comparative algorithms. [ABSTRACT FROM AUTHOR]

Recently, synchronization movement control of multiple vessels has been studied broadly. In most of the studies, the communication network among vessels is considered to be fixed and the time delay is often ignored. However, the communication network among vessels maybe vary because of switching of different tasks, and the time delay is necessary to be considered when the communication network is unreliable. In this paper, the synchronization movement of multiple vessels with switching connected communication topologies is studied, and an adaptive synchronization control algorithm that is based on backstepping sliding mode control is proposed. The control algorithm is achieved by defining cross coupling error which is combination of the trajectory tracking error and velocity tracking error. And an adaptive control term is used to estimate the external disturbances, so that the unknown external disturbances can be compensated. Furthermore, the robustness of the control law to time-varying time delay is also discussed. At last, some simulations are carried out to validate the effectiveness of the proposed synchronization control algorithm. [ABSTRACT FROM AUTHOR]

An off-line robust constrained model predictive control (MPC) algorithm for linear time-varying (LTV) systems is developed. A novel feature is the fact that both model uncertainty and bounded additive disturbance are explicitly taken into account in the offline formulation of MPC. In order to reduce the on-line computational burdens, a sequence of explicit control laws corresponding to a sequence of positively invariant sets is computed off-line. At each sampling time, the smallest positively invariant set containing the measured state is determined and the corresponding control law is implemented in the process. The proposed MPC algorithm can guarantee robust stability while ensuring the satisfaction of input and output constraints. The effectiveness of the proposed MPC algorithm is illustrated by two examples. [ABSTRACT FROM AUTHOR]

A control law for retarded time-delay systems is considered, concerning infinite closed-loop spectrum assignment. An algebraic method for spectrum assignment is presented with a unique optimization algorithm for minimization of spectral abscissa and effective shaping of the chains of infinitely many closed-loop poles. Uncertainty of plant delays of a certain structure is considered in a sense of a robust simultaneous stabilization. Robust performance is achieved using mixed sensitivity design, which is incorporated into the addressed control law. [ABSTRACT FROM AUTHOR]

There are increasing concerns about missing traffic data in recent years. In this paper, a robust missing traffic flow data imputation approach based on matrix completion is proposed. In the proposed method, the similarity of traffic flow from day to day is exploited to impute missing data by the low-rank hypothesis of constructed traffic flow matrix. And the physical limitation of road capacity and nonnegativity is also considered through the optimization process, which avoids the possibility of producing negative and overcapacity values. Moreover, the proposed algorithm can impute missing data and recover outlier in a unify framework. The experiment results show that the proposed method is more accurate, stable, and reasonable. [ABSTRACT FROM AUTHOR]

This paper considers the problem of recovering low-rank matrices which are heavily corrupted by outliers or large errors. To improve the robustness of existing recovery methods, the problem is solved by formulating it as a generalized non-smooth non-convex minimization functional via exploiting the Schatten p-norm (0 < p ⩽ 1) and Lq(0 < q ⩽ 1) seminorm. Two numerical algorithms are provided based on the augmented Lagrange multiplier (ALM) and accelerated proximal gradient (APG) methods as well as efficient root-finder strategies. Experimental results demonstrate that the proposed generalized approach is more inclusive and effective compared with state-of-the-art methods, either convex or nonconvex. [ABSTRACT FROM AUTHOR]

Due to being poor in control quality of the combustion process of gas heating furnace, this paper explored a sort of strong robust control algorithm in order to improve the control quality of the combustion process of gas heating furnace. The paper analyzed the control puzzle in the complex combustion process of gas heating furnace, summarized the cybernetics characteristic of the complex combustion process, researched into control strategy of the uncertainty complex control process, discussed the control model of the complex process, presented a sort of intelligent integration between human-simulated intelligence and expert control technology, and constructed the control algorithm for the combustion process controlling of gas heating furnace. The simulation results showed that the control algorithm proposed in the paper is not only better in dynamic and steady quality of the combustion process, but also obvious in energy saving effect, feasible, and effective in control strategy. [ABSTRACT FROM AUTHOR]

Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the "store-carry-forward" strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI) algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks. [ABSTRACT FROM AUTHOR]

For the areas of low textured in image pairs, there is nearly no point that can be detected by traditional methods. The information in these areas will not be extracted by classical interest-point detectors. In this paper, a novel weakly textured point detection method is presented. The points with weakly textured characteristic are detected by the symmetry concept. The proposed approach considers the gray variability of the weakly textured local regions. The detection mechanism can be separated into three steps: region-similarity computation, candidate point searching, and refinement of weakly textured point set. The mechanism of radius scale selection and texture strength conception are used in the second step and the third step, respectively. The matching algorithm based on sparse representation (SRM) is used for matching the detected points in different images. The results obtained on image sets with different objects show high robustness of the method to background and intraclass variations as well as to different photometric and geometric transformations; the points detected by this method are also the complement of points detected by classical detectors from the literature. And we also verify the efficacy of SRM by comparing with classical algorithms under the occlusion and corruption situations for matching the weakly textured points. Experiments demonstrate the effectiveness of the proposed weakly textured point detection algorithm. [ABSTRACT FROM AUTHOR]

Noncooperative target spacecrafts are those assets in orbit that cannot convey any information about their states (position, attitude, and velocities) or facilitate rendezvous and docking/berthing (RVD/B) process. Designing a guidance, navigation, and control (GNC) module for the chaser in a RVD/B mission with noncooperative target should be inevitably solved for on-orbit servicing technologies. The proximity operations and the guidance for achieving rendezvous problems are addressed in this paper. The out-of- plane maneuvers of proximity operations are explored with distinct subphases, including a chaser far approach in the target's orbit to the first hold point and a closer approach to the final berthing location. Accordingly, guidance solutions are chosen for each subphase from the standard Hill based Closhessy-Willtshire (CW) solution, elliptical fly-around, and Glideslope algorithms. The control is based on a linear quadratic regulator approach (LQR). At the final berthing location, attitude tracker based on a proportional derivative (PD) form is tested to synchronize the chaser and target attitudes. The paper analyzes the performance of both controllers in terms of the tracking ability and the robustness. Finally, it prescribes any restrictions that may be imposed on the guidance during any subphase which can help to improve the controllers tracking ability. [ABSTRACT FROM AUTHOR]

The attitude tracking control problem of a spacecraft nonlinear system with external disturbances and inertia uncertainties is studied. Two robust attitude tracking controllers based on finite-time second-order sliding mode control schemes are proposed to solve this problem. For the first controller, smooth super twisting control is applied to quaternion-based spacecraft-attitude-tracking maneuvers. The second controller is developed by adding linear correction terms to the first super twisting control algorithm in order to improve the dynamic performance of the closed-loop system. Both controllers are continuous and, therefore, chattering free. The concepts of a strong Lyapunov function are employed to ensure a finite-time convergence property of the proposed controllers. Theoretical analysis shows that the resulting control laws have strong robustness and disturbance attenuation ability. Numerical simulations are also given to demonstrate the performance of the proposed control laws. [ABSTRACT FROM AUTHOR]

This paper concerns the tracking control of a robot manipulator with unknown uncertainties and disturbances. It presents a new control method that uses only joint position measurements to design a tracking controller. The controller has two parts. One is based on a feedback linearization technique; itmakes the nominal model of a manipulator asymptotically track a desired trajectory. The other is based on the idea of equivalent input disturbance (EID); it compensates for uncertainties and disturbances. Together they enable a robot manipulator to precisely track the desired trajectory. The new control algorithm is applied to a two-link robot manipulator, and simulation results demonstrate the validity of this method. [ABSTRACT FROM AUTHOR]

A Canonic-Signed-Digit-(CSD-) coded genetic algorithm (GA) is proposed to find the optimal design of robustly stable infinite impulse response digital filter (IIR). Under the characteristics of the CSD structure, the circuit of the filter can be simplified and also the calculation speed can be raised to increase the hardware's efficiency. However, the design of CSD has a big challenge: the CSD structure of the system parameters will be destroyed by an optimal design procedure. To solve this problem, in this research a CSD-coded GA is proposed so that the CSD structure can be maintained. Moreover, the robustly stable IIR filters design problem is included in this paper. The robustness of the IIR filters is achieved by ensuring that all poles of the filters are located inside a disk D (α, r) contained in the unit circle, in which α is the center, r is the radius of the disk, and |α| r < 1. Consequently, in this paper, a new and more efficient D (α, r)-stability criterion will be derived and then embedded in GA for the design of robust IIR filters. It is worthwhile to note that to design an IIR filter simultaneously with CSD-structured parameters and robust stability is difficult and is not well explored so far. An example will be presented to show the efficiency of the proposed strategy for design of IIR filters. [ABSTRACT FROM AUTHOR]

Bilevel programming is characterized by two optimization problems located at different levels, in which the constraint region of the upper level problem is implicitly determined by the lower level problem. This paper is focused on a class of bilevel programming with a linear lower level problem and presents a new algorithm for solving this kind of problems by combining an evolutionary algorithm with the duality principle. First, by using the prime-dual conditions of the lower level problem, the original problem is transformed into a single-level nonlinear programming problem. In addition, for the dual problem of the lower level, the feasible bases are taken as individuals in population. For each individual, the values of dual variables can be obtained by taking the dual problem into account, thus simplifying the single-level problem. Finally, the simplified problem is solved, and the objective value is taken as the fitness of the individual. Besides, when nonconvex functions are involved in the upper level, a coevolutionary scheme is incorporated to obtain global optima. In the computational experiment, 10 problems, smaller or larger-scale, are solved, and the results show that the proposed algorithm is efficient and robust. [ABSTRACT FROM AUTHOR]

This paper presents a precision fault reconstruction scheme for a class of nonlinear systems involving unknown input disturbances. First, using the coordinate transformation algorithm, the disturbances and faults of the system are fully decoupled. Therefore, it is possible to eliminate the influence of disturbances to the system, namely, better disturbances robustness. On this basis, the design of a sliding mode state observer makes the most genuine reconstruction realizable, instead of estimation of faults. Furthermore, with the equivalent principle of sliding mode variable structure, the precision reconstruction of arbitrary nonlinear faults is achieved. Finally, the applications of fault reconstruction in a third-order nonlinear theoretical model with disturbances and in a single-link robot system, respectively, have demonstrated the validity of the proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid scheme is proposed to find the reliable point-correspondences between two images, which combines the distribution of invariant spatial feature description and frequency domain alignment based on two-stage coarse to fine refinement strategy. Firstly, the source and the target images are both down-sampled by the image pyramid algorithm in a hierarchical multi-scale way. The Fourier-Mellin transform is applied to obtain the transformation parameters at the coarse level between the image pairs; then, the parameters can serve as the initial coarse guess, to guide the following feature matching step at the original scale, where the correspondences are restricted in a search window determined by the deformation between the reference image and the current image; Finally, a novel matching strategy is developed to reject the false matches by validating geometrical relationships between candidate matching points. By doing so, the alignment parameters are refined, which is more accurate and more flexible than a robust fitting technique. This in return can provide a more accurate result for feature correspondence. Experiments on real and synthetic image-pairs show that our approach provides satisfactory feature matching performance. [ABSTRACT FROM AUTHOR]

The special importance of Difference of Convex (DC) functions programming has been recognized in recent studies on nonconvex optimization problems. In this work, a class of DC programming derived from the portfolio selection problems is studied. The most popular method applied to solve the problem is the Branch-and-Bound (B&B) algorithm. However, "the curse of dimensionality" will affect the performance of the B&B algorithm. DC Algorithm (DCA) is an efficient method to get a local optimal solution. It has been applied to many practical problems, especially for large-scale problems. A B&B-DCA algorithm is proposed by embedding DCA into the B&B algorithms, the new algorithm improves the computational performance and obtains a global optimal solution. Computational results show that the proposed B&B-DCA algorithm has the superiority of the branch number and computational time than general B&B. The nice features of DCA (inexpensiveness, reliability, robustness, globality of computed solutions, etc.) provide crucial support to the combined B&B-DCA for accelerating the convergence of B&B. [ABSTRACT FROM AUTHOR]

In order to design the automotive components considering probabilistic uncertainties in the decision variables, it is desired to perform a robust design process. The peak crushing force of the energy absorber components is one of the important objectives of the design of such components. In this paper, at first, the peak crushing force of the S-shaped box beams, as a highly simplified model of front member of a vehicle body, is extracted mathematically. Using such obtained mathematical model and Monte Carlo simulation, genetic algorithm is then used for the robust design of the S-shaped box beams having probabilistic uncertainties in material and geometrical parameters. In this way the variance-per-mean ratio of the peak crushing force (Pmax) is considered as the objective function. It is shown that some interesting relationships as useful robust design principles involved in the performance of the S-shaped box beams can be discovered by the robust design of the obtained mathematical model. [ABSTRACT FROM AUTHOR]