The performance analysis of high-speed railway (HSR) network has attracted broad attention in recent years. The characteristics of HSR scenario, compared with traditional public network scenario, mainly lies in the sp...
详细信息
ISBN:
(纸本)9781450330084
The performance analysis of high-speed railway (HSR) network has attracted broad attention in recent years. The characteristics of HSR scenario, compared with traditional public network scenario, mainly lies in the special traffic between trains and stations, i.e., train control traffic, video monitoring traffic and passenger traffic in general. Since the performance analysis of traffic in HSR, especially train control traffic and video monitoring traffic, can better guarantee the safety and improvement of railway, thus this paper researches and analyzes the performance bounds of HSR railway uplink traffic. The work is carried out based on a group of actual measurement data gathered from Chinese Train controlsystem (CTCS) and an advanced performance analysis tool stochastic network calculus (SNC). Finally, by means of the measurement data in the uplink direction, the stochastic backlog and delay bounds of train control traffic and video monitoring traffic under different violation probabilities and bit rates are derived and compared.
This paper designs multi-step probabilistic sets for linear, discrete-time, stochastic systems with unbounded multiplicative noise and probabilistic constraints. Multi-step probabilistic sets strengthen IWPp by bringi...
详细信息
This paper designs multi-step probabilistic sets for linear, discrete-time, stochastic systems with unbounded multiplicative noise and probabilistic constraints. Multi-step probabilistic sets strengthen IWPp by bringing more degrees of freedom to optimize the applicable region of finite-step probabilistic constraints, and extending the prediction horizon of IWPp to infinity for infinite-horizon probabilistic constraints. Conditions for multi-step probabilistic sets are then incorporated into a stochastic model predictive control algorithm to satisfy probabilistic constraints. Closed-loop mean-square stability is guaranteed by the algorithm. A numerical example shows the performance of the proposed algorithm.
This paper addresses the problem of infinite time performance of model predictive controllers applied to constrained nonlinear systems. The total performance is compared with a finite horizon optimal cost to reveal pe...
详细信息
This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and ...
详细信息
This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and passive agents. The objective is to directly control the active agents such that the states of all the agents would achieve consensus. In order to obtain a computational approach, we subtly introduce an appropriate Markov chain to cast the heterogeneous systems into a unified framework. Such a framework is helpful for tackling the constraints from passive agents. Furthermore, a sufficient and necessary condition is established to guarantee the consensus in heterogeneous multi-agent systems. Finally, simulation results are provided to verify the theoretical analysis and the effectiveness of the proposed protocol.
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.
In the brand new era of “big data”, finding creative strategies for information fusion in a complicated system is important. Previous researchers have introduced a model called “Local Strongly Coupled system”, in ...
详细信息
In the brand new era of “big data”, finding creative strategies for information fusion in a complicated system is important. Previous researchers have introduced a model called “Local Strongly Coupled system”, in which every agent stochastically communicates only with its neighbours (i.e. “coupled” nodes). However, the meaning of a system's intrinsic a priori constraints is always neglected. And we assume that in practical instances, the whole system is supposed to take on a consistent result, or “consensus” decision. This paper, taking constraints into account, presents a new strategy to help minimize the filtering error. Furthermore, based on consensus policy, the approach is applied to local strongly coupled systems, especially systems with packet loss. Effectiveness and practicability of all the proposed algorithms are shown through simulations.
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.
作者:
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.
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...
详细信息
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.
暂无评论