This paper is concerned with stochastic model predictive control for Markovian jump linear systems with additive disturbance, where the systems are subject to soft constraints on the system state and the disturbance s...
This paper is concerned with stochastic model predictive control for Markovian jump linear systems with additive disturbance, where the systems are subject to soft constraints on the system state and the disturbance sequence is finitely supported with joint cumulative distribution function given. By resorting to the maximal disturbance invariant set of the system, a model predictive control law is given based on a dynamic controller which is with guaranteed recursive feasibility and ensures the probabilistic constraints on the states. By optimizing the volume of the disturbance invariant set, the dynamic controller is given. The closed loop system under this control law is proven to be stable in the mean square sense. Finally, a numerical example is given to illustrate the developed results.
作者:
Xiaofan WangXiaoling WangDepartment of Automation
Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China
Existed works on consensus in networks have been focused on reaching an agreement among states of nodes in a network. In this work, we propose a discrete-time edge consensus protocol for complex networks. By mapping t...
详细信息
ISBN:
(纸本)9781479934331
Existed works on consensus in networks have been focused on reaching an agreement among states of nodes in a network. In this work, we propose a discrete-time edge consensus protocol for complex networks. By mapping the edge topology into a corresponding line graph, we prove that consensus can be achieved among the states of all edges in a connected network. Theoretical analysis and simulation results are provided to show the effectiveness of the model and the influence of network topology.
Previously, we proposed a topological-based swarming model in which agents probabilistically decide which other agents to interact with based on the proximity of positions of agents. Agents then average their directio...
详细信息
Previously, we proposed a topological-based swarming model in which agents probabilistically decide which other agents to interact with based on the proximity of positions of agents. Agents then average their direction with the directions of the agents they have interacted with. In this paper, we improve the model mentioned-above by taking the influence of similarity of directions into consideration, and the former model can be considered as a special case of this model here. We propose a probabilistic method which depends on both proximity of agents' positions and similarity of agents' moving directions. And agents are more likely to form links with those agents who carry a similar direction to theirs and those agents who are proximal to them. We show that there exits a non-zero positive lower bound of the selection probability, and the system can be connected in probability, which ensures the system's achievement of swarming. And by simulations, it is shown that the rate of getting alignment exhibit a strong correlation with the parameters of the system which are weighting factor, neighborhood size, proximity factor and similarity factor.
Walking on irregular terrain is usually a common task for a quadruped robot. It is however difficult to control the robot in this situation as undesirable impulse force by collision between the foot of robot and obsta...
详细信息
This paper describes a novel development of a lower limber exoskeleton for physical assistance and rehabilitation. The developed exoskeleton is a motorized leg device having a total of 4 DOF with hip, knee, and ankle ...
详细信息
Online fault diagnosis has been a crucial task for industrial processes. Reconstruction-based fault diagnosis has been drawing special attentions as a good alternative to the traditional contribution plot. It identifi...
详细信息
Online fault diagnosis has been a crucial task for industrial processes. Reconstruction-based fault diagnosis has been drawing special attentions as a good alternative to the traditional contribution plot. It identifies the fault cause by finding the specific fault subspace that can well eliminate alarming signals from a bunch of alternatives that have been prepared based on historical fault data. However, in practice, the abnormality may result from the joint effects of multiple faults, which thus can not be well corrected by single fault subspace archived in the historical fault library. In the present work, an aggregative reconstruction-based fault diagnosis strategy is proposed to handle the case where multiple fault causes jointly contribute to the abnormal process behaviors. First, fault subspaces are extracted based on historical fault data in two different monitoring subspaces where analysis of relative changes is taken to enclose the major fault effects that are responsible for different alarming monitoring statistics. Then, a fault subspace selection strategy is developed to analyze the combinatorial fault nature which will sort and select the informative fault subspaces that are most likely to be responsible for the concerned abnormalities. Finally, an aggregative fault subspace is calculated by combining the selected fault subspaces which represents the joint effects from multiple faults and works as the final reconstruction model for online fault diagnosis. Theoretical support is framed and the related statistical characteristics are analyzed. Its feasibility and performance are illustrated with simulated multi-faults using data from the Tennessee Eastman(TE) benchmark process.
In this paper, we study the coordinated obstacle avoidance algorithm of multi-agent systems when only a subset of agents has obstacle dynamic information, or every agent has local interaction. Each agent can get parti...
详细信息
In this paper, we study the coordinated obstacle avoidance algorithm of multi-agent systems when only a subset of agents has obstacle dynamic information, or every agent has local interaction. Each agent can get partial measuring states information from its neighboring agent and obstacle. Coordinated obstacle avoidance here represents not only the agents moving without collision with an obstacle, but also the agents bypassing and assembling at the opposite side of the obstacle collectively, where the opposite side is defined according to the initial relative position of the agents to the obstacle. We focus on the collective obstacle avoidance algorithms for both agents with first-order kinematics and agents with second-order dynamics. In the situation where only a fixed fraction of agents can sense obstacle information for agents with first-order kinematics, we propose a collective obstacle avoidance algorithm without velocity measurements. And then we extend the algorithm to the case in switched topology. We show that all agents can bypass an obstacle and converge together, and then assemble at the opposite side of the obstacle in finite time, if the agents׳ topology graph is connected and at least one agent can sense the obstacle. In the case where obstacle information is available to only a fixed fraction of agents with second-order kinematics, we propose two collective obstacle avoidance algorithms without measuring acceleration when the obstacle has varying velocity and constant velocity. The switched topology is considered and extended next. We show that agents can bypass the obstacle with their positions and velocities approaching consensus in finite time if the connectivity of switched topology is continuously maintained. Several simulation examples demonstrate the proposed algorithms.
3D human pose reconstruction is a key concern in computer vision area in recent *** to the deficiency of depth information,reconstructing human pose from a single image or image sequences is still a difficult and chal...
详细信息
3D human pose reconstruction is a key concern in computer vision area in recent *** to the deficiency of depth information,reconstructing human pose from a single image or image sequences is still a difficult and challenging *** this paper,we present an annealed particle filter algorithm based on reprojection error to recover the 3D configuration of human upper body,with the annotated joints’position in the *** addition,we make simplifications to the weak perspective projection,and the 7 camera parameters to be estimated are reduced to only *** show that our method is simple but exactly suitable for recovering articulated human upper body pose.
The property of single prediction predictive control in the form of dynamic matrix control is studied within internal model control framework. The sensitivity function and integral squared error are used as performanc...
详细信息
The property of single prediction predictive control in the form of dynamic matrix control is studied within internal model control framework. The sensitivity function and integral squared error are used as performance evaluation criteria in the frequency and time domain respectively, to quantitatively analyze single prediction strategy, especially on controller with the prediction and control horizon P = M = 1. We present the correlation between system performance and model mismatch in this case. The performance limitation for tracking unit step signal is obtained through derivation and simulation.
In this paper, new Lyapunov-based reset rules are constructed to improve ℒ 2 gain performance of linear-time-invariant (LTI) systems. By using the hybrid system framework, sufficient conditions for exponential and fin...
详细信息
In this paper, new Lyapunov-based reset rules are constructed to improve ℒ 2 gain performance of linear-time-invariant (LTI) systems. By using the hybrid system framework, sufficient conditions for exponential and finite gain ℒ 2 stability are presented. It is shown that the ℒ 2 gain of the closed loop system with resets can be improved compared with the base system. Numerical example supports our results.
暂无评论