Adaptive Neural-Network-Based Fault-Tolerant Control for a Flexible String With Composite Disturbance Observer and Input Constraints

Nearly optimal fault-tolerant constrained tracking for multi-axis servo system via practical terminal sliding mode and adaptive dynamic programming

In this paper, a nearly optimal tracking control is proposed for n-links robotic manipulators subject to parameter uncertainties, time-profile failures, and input saturation constraints. Firstly, the practical terminal sliding-mode (PTSM) manifold with a linear additional term is proposed to combine the system states related to joint rotation, such that the controlled states quickly fall into a tiny neighborhood of the equilibrium once they reach the PTSM manifold. Secondly, a nearly optimal sliding-mode reaching law is designed by using the adaptive dynamic programming (ADP) technique. Benefiting from a non-quadratic positive defined mapping of the proposed performance index, which relates to the derivative of the sliding-mode function, reduced-order system dynamics can be constrained to a desired region. For the bounded actuator fault caused by various inducements such as the power supply fluctuation and the wear of parts, a radial basis function neural network (RBFNN) is introduced to compensate for this, and the input saturation constraints of the controlled plant are also compensated at the same time. Innovatively, the node weights of RBFNN are updated by the critic network of the ADP framework, such that the integrity of the proposed control strategy is improved. Simulations verify the main conclusions.

Adaptive neural network control for Markov jumping systems against deception attacks

This paper proposes an innovative approach for mitigating the effects of deception attacks in Markov jumping systems by developing an adaptive neural network control strategy. To address the challenge of dual-mode monitoring mechanisms, two independent Markov chains are used to describe the state changes of the system and the intermittent actuator. By employing a mapping technique, these individual chains are amalgamated into a unified joint Markov chain. Additionally, to effectively approximate the unbounded false signals injected by deception attacks, an adaptive neural network technique is skillfully built. A mode monitoring scheme is implemented to design an asynchronous control law that links the mode information between the joint Markov chain and controller with fewer modes. The paper derives sufficient criteria for the mean-square bounded stability of the resulting system based on Lyapunov theories. Finally, a numerical experiment is conducted to demonstrate the effectiveness of the proposed method.

Design of a Non-Linear Observer for SOC of Lithium-Ion Battery Based on Neural Network

This paper presents a method for use in estimating the state of charge (SOC) of lithium-ion batteries which is based on an electrochemical impedance equivalent circuit model with a controlled source. Considering that the open-circuit voltage of a battery varies with the SOC, an equivalent circuit model with a controlled source is proposed which the voltage source and current source interact with each other. On this basis, the radial basis function (RBF) neural network is adopted to estimate the uncertainty in the battery model online, and a non-linear observer based on the radial basis function of the RBF neural network is designed to estimate the SOC of batteries. It is proved that the SOC estimation error is ultimately bounded by Lyapunov stability analysis, and the error bound can be arbitrarily small. The high accuracy and validity of the non-linear observer based on the RBF neural network in SOC estimation are verified with experimental simulation results. The SOC estimation results of the extended Kalman filter (EKF) are compared with the proposed method. It improves convergence speed and accuracy.

A Bus-Scheduling Method Based on Multi-Sensor Data Fusion and Payment Authenticity Verification

It is of great significance to ensure public transportation management capabilities by improving urban public transport services. One method is to solve the problems related to the quality of data submitted for public funding as well as the accuracy and transparency of the supervision and review processes; moreover, improving public-transportation-service systems is a viable method to solve such problems. With technological advancements and the application of new technologies such as automatic driving and multiple payment, it has gradually become difficult for user-data verification systems, based on the original single bus payment method, to cater to these new technologies. Diversified payment and complex management methods have highlighted the need for new verification methods. Firstly, in this paper, we constructed the Origin–Destination (OD) model of bus-passenger flows by using real-time transmission of passenger-multiple-payment data, on-board-video passenger flow detection data and vehicle real-time positioning data. On this basis, the bus waybill data of other intelligent bus systems and the wait data of bus stations were integrated, so as to establish the travel chain theory by matching passenger flow and the temporal and spatial distribution model. Then, an OD analysis of public-transport passenger flows could be carried out, with a detailed analysis of vehicle, station and line-passenger flow, and the travel characteristics of public transport passenger flow could be excavated. Then, according to the means-end chain theory, the spatiotemporal distribution of the passenger flow data was obtained to carry out an OD analysis of the passenger flow, so as to perform a refinement analysis of the vehicle, station, and passenger flow. Thereby, the characteristics of the passenger flow were explored. Subsequently, payment-authenticity-verification models were established for the data-validity assessment, video-data analysis, passenger-flow estimation, and early warnings in order to determine the authenticity of the payment data. Lastly, based on the multi-sensor passenger flow data fusion and the data authenticity verification models, combined with the application of new technologies such as the use of autonomous buses, the test was promoted. That is, by taking intelligent bus scheduling as the scenario, the research method was tested and verified with real-time passenger flow data according to historical data. The results showed that the method accurately predicted the passenger flow, and had a positive role in improving the efficiency of payment-data-authenticity verification. The application of the method can enhance the management and service quality of public transportation.

Intelligent Bus Scheduling Control Based on On-Board Bus Controller and Simulated Annealing Genetic Algorithm

The stable and fast service of a bus network is one of the important indicators of the service quality and management level of urban public transport. With the continuous expansion of cities, the bus network complexity has been increasing accordingly. The application of new technologies such as self-driving buses has made the bus network more complex and its vulnerability more obvious. Therefore, how to collect information on passenger flow, traffic flow, and transport distribution using intelligent means, and how to establish an effective intelligent bus scheduling control method have been important questions surrounding the improvement of the level of urban bus operation. To address this challenge, this paper proposes the design method of a bus controller based on data collection and the edge computing requirements of autonomous driving buses; and installs them widely on buses. In addition, an intelligent bus control scheduling method based on the simulated annealing genetic algorithm was developed according to the current scheduling requirements. The proposed method combines the strong local search ability of the simulated annealing algorithm, which prevents the search process from falling into a local optimum, and the strong search ability of the genetic algorithm in the overall search process, leading an intelligent bus control scheduling method based on the simulated annealing genetic algorithm. The proposed method was verified by experiments on the optimal scheduling of multi-destination public transport as an example, we verified the research method, and finally, simulated it using historical data. There is good model prediction of the experimental results. Therefore, the intelligent traffic control can be realized through efficient bus scheduling, thus improving the robustness of the bus network operation.

Finite-Time Neural Network Fault-Tolerant Control for Robotic Manipulators under Multiple Constraints

In this study, a backstepping-based fault-tolerant controller for a robotic manipulator system with input and output constraints was developed. First, a barrier Lyapunov function was adopted to ensure that the system output satisfied time-varying constraints. Subsequently, the actuator input saturation and asymmetric dead-zone characteristics were also considered, and the actuator characteristics were described using a continuous function. The impacts of actuator failures and unknown dynamical parameters of the system were eliminated by employing Gaussian radial basis function neural networks. The external disturbances were compensated for, using a disturbance observer. Meanwhile, a finite-time dynamic surface technique was adopted to accelerate the convergence of the system errors. Finally, simulation of a 2-degrees-of-freedom robotic manipulator system showed the effectiveness of the proposed controller.

An Improved Proximal Policy Optimization Method for Low-Level Control of a Quadrotor

In this paper, a novel deep reinforcement learning algorithm based on Proximal Policy Optimization (PPO) is proposed to achieve the fixed point flight control of a quadrotor. The attitude and position information of the quadrotor is directly mapped to the PWM signals of the four rotors through neural network control. To constrain the size of policy updates, a PPO algorithm based on Monte Carlo approximations is proposed to achieve the optimal penalty coefficient. A policy optimization method with a penalized point probability distance can provide the diversity of policy by performing each policy update. The new proxy objective function is introduced into the actor–critic network, which solves the problem of PPO falling into local optimization. Moreover, a compound reward function is presented to accelerate the gradient algorithm along the policy update direction by analyzing various states that the quadrotor may encounter in the flight, which improves the learning efficiency of the network. The simulation tests the generalization ability of the offline policy by changing the wing length and payload of the quadrotor. Compared with the PPO method, the proposed method has higher learning efficiency and better robustness.

Multi-Agent Reinforcement Learning with Optimal Equivalent Action of Neighborhood

In a multi-agent system, the complex interaction among agents is one of the difficulties in making the optimal decision. This paper proposes a new action value function and a learning mechanism based on the optimal equivalent action of the neighborhood (OEAN) of a multi-agent system, in order to obtain the optimal decision from the agents. In the new Q-value function, the OEAN is used to depict the equivalent interaction between the current agent and the others. To deal with the non-stationary environment when agents act, the OEAN of the current agent is inferred simultaneously by the maximum a posteriori based on the hidden Markov random field model. The convergence property of the proposed methodology proved that the Q-value function can approach the global Nash equilibrium value using the iteration mechanism. The effectiveness of the method is verified by the case study of the top-coal caving. The experiment results show that the OEAN can reduce the complexity of the agents’ interaction description, meanwhile, the top-coal caving performance can be improved significantly.