Fitting traffic traces with discrete canonical phase type distributions and markov arrival processes
This paper is concerned with the flexibility in the closed loop pole location when solving the optimal control problem (also called the optimal disturbance attenuation problem) by proper measurement feedback. It is shown that there exists a precise and unique set of poles which is present in the closed loop system obtained by any measurement feedback solution of the optimal control problem. These “ optimal fixed poles” are characterized in geometric as well as structural terms. A procedure...
In this paper, a fixed-time safe control problem is investigated for an uncertain high-order nonlinear pure-feedback system with state constraints. A new nonlinear transformation function is firstly proposed to handle both the constrained and unconstrained cases in a unified way. Further, a radial basis function neural network is constructed to approximate the unknown dynamics in the system and a fixed-time dynamic surface control (FDSC) technique is developed to facilitate the fixed-time control...
This paper investigates the fixed-time trajectory tracking control problem for a nonholonomic mobile robot. Firstly, the tracking error system is derived for the mobile robot by the aid of a global invertible transformation. Then, based on the unified error dynamics and by using the fixed-time control method, continuous fixed-time tracking controllers are developed for the mobile robot such that the robot can track the desired trajectory in a fixed time. Moreover, the settling time is independent...
We study the problem of flatness of two-input driftless control systems. Although a characterization of flat systems of that class is known, the problems of describing all flat outputs and of calculating them is open and we solve it in the paper. We show that all x-flat outputs are parameterized by an arbitrary function of three canonically defined variables. We also construct a system of 1st order PDE’s whose solutions give all x-flat outputs of two-input driftless systems. We illustrate our results...
We study the problem of flatness of two-input driftless control systems. Although a characterization of flat systems of that class is known, the problems of describing all flat outputs and of calculating them is open and we solve it in the paper. We show that all x-flat outputs are parameterized by an arbitrary function of three canonically defined variables. We also construct a system of 1st order PDE’s whose solutions give all x-flat outputs of...
We study the problem of flatness of two-input driftless control systems. Although a characterization of flat systems of that class is known, the problems of describing all flat outputs and of calculating them is open and we solve it in the paper. We show that all x-flat outputs are parameterized by an arbitrary function of three canonically defined variables. We also construct a system of 1st order PDE’s whose solutions give all x-flat outputs of...
This paper studies Monge parameterization, or differential flatness, of control-affine systems with four states and two controls. Some of them are known to be flat, and this implies admitting a Monge parameterization. Focusing on systems outside this class, we describe the only possible structure of such a parameterization for these systems, and give a lower bound on the order of this parameterization, if it exists. This lower-bound is good enough to recover the known results about “(x,u)-flatness”...
In this paper, a generalized Motsch-Tadmor model with piecewise interaction functions and fixed processing delays is investigated. According to functional differential equation theory and correlation properties of the stochastic matrix, we obtained sufficient conditions for the system achieving flocking, including an upper bound of the time delay parameter. When the parameter is less than the upper bound, the system achieves asymptotic flocking under appropriate assumptions.
In this paper, we revisit the artificial potential based approach in the flocking control for multi-agent systems, where our main concerns are migration and trajectory tracking problems. The static destination or, more generally, the moving reference point is modeled by a virtual leader, whose information is utilized by some agents, called active agents (AA), for the controller design. We study a decentralized flocking controller for the case where the set of AAs is fixed. Some results on the velocity...
Two similar Laplacian-based models for swarms with informed agents are proposed and analyzed analytically and numerically. In these models, each individual adjusts its velocity to match that of its neighbors and some individuals are given a preferred heading direction towards which they accelerate if there is no local velocity consensus. The convergence to a collective group swarming state with constant velocity is analytically proven for a range of parameters and initial conditions. Using numerical...
In this paper congestion control problem in connection-oriented communication network with multiple data sources is addressed. In the considered network the feedback necessary for the flow regulation is provided by means of management units, which are sent by each source once every M data packets. The management units, carrying the information about the current network state, return to their origin round trip time RTT after they were sent. Since the source rate is adjusted only at the instant of...
Mathematics Subject Classification: 26A33; 93C15, 93C55, 93B36, 93B35, 93B51; 03B42; 70Q05; 49N05This paper proposes a novel method to design an H∞ -optimal fractional order PID (FOPID) controller with ability to control the transient, steady-state response and stability margins characteristics. The method uses particle swarm optimization algorithm and operates based on minimizing a general cost function. Minimization of the cost function is carried out subject to the H∞ -norm; this norm is also...
The problem of existence of a forecast (or planning) horizon has been considered in many special models, more or less precisely. We specify and investigate this problem for families of cheapest paths in networks with weakly ordered nodes. In a discrete network, the standard forward algorithm finds the subnetwork generated by optimal paths. The proposed forward procedure reduces subnetworks such that the forecast horizon remains unchanged. Based on the final subnetwork, we have an answer to the forecast...