scholarly journals Distributed Control for Multiagent Consensus Motions with Nonuniform Time Delays

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Mengji Shi ◽  
Kaiyu Qin
Keyword(s):  
Distributed Control ◽  
Time Delays ◽  
Original System ◽  
Complex Numbers ◽  
Control Problems ◽  
Rectilinear Motion ◽  
State Variables ◽  
Real Numbers ◽  
Numerical Examples ◽  
Delay Margin

This paper solves control problems of agents achieving consensus motions in presence of nonuniform time delays by obtaining the maximal tolerable delay value. Two types of consensus motions are considered: the rectilinear motion and the rotational motion. Unlike former results, this paper has remarkably reduced conservativeness of the consensus conditions provided in such form: for each system, if all the nonuniform time delays are bounded by the maximal tolerable delay value which is referred to as “delay margin,” the system will achieve consensus motion; otherwise, if all the delays exceed the delay margin, the system will be unstable. When discussing the system which is intended to achieve rotational consensus motion, an expanded system whose state variables are real numbers (those of the original system are complex numbers) is introduced, and corresponding consensus condition is given also in the form of delay margin. Numerical examples are provided to illustrate the results.

Response Analysis of van der Pol Vibro-Impact System with Coulomb Friction Under Gaussian White Noise

2018 ◽  
Vol 28 (13) ◽  
pp. 1830043 ◽  
Author(s):  
Meng Su ◽  
Wei Xu ◽  
Guidong Yang
Keyword(s):  
White Noise ◽  
Coulomb Friction ◽  
Gaussian White Noise ◽  
Original System ◽  
Stochastic Averaging ◽  
Response Analysis ◽  
State Variables ◽  
Van Der Pol ◽  
Impact System ◽  
The Impact

In this paper, the stationary response of a van der Pol vibro-impact system with Coulomb friction excited by Gaussian white noise is studied. The Zhuravlev nonsmooth transformation of the state variables is utilized to transform the original system to a new system without the impact term. Then, the stochastic averaging method is applied to the equivalent system to obtain the stationary probability density functions (pdfs). The accuracy of the analytical results obtained from the proposed procedure is verified by those from the Monte Carlo simulation based on the original system. Effects of different damping coefficients, restitution coefficients, amplitudes of friction and noise intensities on the response are discussed. Additionally, stochastic P-bifurcations are explored.

scholarly journals Cooperative Problem Solving in Telecommunication Network

2013 ◽  
Vol 4 (3) ◽  
pp. 388-392
Author(s):  
Shanu K Rakesh ◽  
Bharat Choudhary ◽  
Rachna Sandhu
Keyword(s):  
Communication Network ◽  
Problem Solving ◽  
Distributed Control ◽  
Communication Networks ◽  
Foraging Behaviour ◽  
Telecommunication Network ◽  
Telecommunication Networks ◽  
Control Problems ◽  
Engineering Systems ◽  
Biologically Inspired

Swarm intelligence, as demonstrated by natural biological swarms, has numerous powerful properties desirable in many engineering systems, such as telecommunication. Communication network management is becoming increasingly difficult  due to the increasing size, rapidly changing topology, and complexity of communication networks. This paper describes  how biologically-inspired agents can be used to solve control problems in telecommunications. These agents, inspired by the foraging behaviour of ants, exhibit the desirable characteristics of simplicity of action and interaction. The colle ction of agents, or swarm system, deals only with local knowledge and exhibits a form of distributed control with agent communication effected through the environment. In this paper we explore the application of ant-like agents to the problem of routing in telecommunication networks.

Encircling Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Nineteenth Century ◽  
Real Number ◽  
Traveling Salesman Problem ◽  
Complex Number ◽  
Traveling Salesman ◽  
Complex Numbers ◽  
Real Numbers ◽  
Hamiltonian Graphs ◽  
The World ◽  
The Traveling Salesman Problem

This chapter considers Hamiltonian graphs, a class of graphs named for nineteenth-century physicist and mathematician Sir William Rowan Hamilton. In 1835 Hamilton discovered that complex numbers could be represented as ordered pairs of real numbers. That is, a complex number a + b i (where a and b are real numbers) could be treated as the ordered pair (a, b). Here the number i has the property that i² = -1. Consequently, while the equation x² = -1 has no real number solutions, this equation has two solutions that are complex numbers, namely i and -i. The chapter first examines Hamilton's icosian calculus and Icosian Game, which has a version called Traveller's Dodecahedron or Voyage Round the World, before concluding with an analysis of the Knight's Tour Puzzle, the conditions that make a given graph Hamiltonian, and the Traveling Salesman Problem.

Unbounded Positive Definite Functions

1969 ◽  
Vol 21 ◽  
pp. 1309-1318 ◽  
Author(s):  
James Stewart
Keyword(s):  
Abelian Group ◽  
Positive Measure ◽  
Positive Definite Function ◽  
Positive Definite ◽  
Locally Compact Abelian Group ◽  
Definite Function ◽  
Complex Numbers ◽  
Stieltjes Transform ◽  
Real Numbers ◽  
Image Position

Let G be an abelian group, written additively. A complexvalued function ƒ, defined on G, is said to be positive definite if the inequality1holds for every choice of complex numbers C1, …, cn and S1, …, sn in G. It follows directly from (1) that every positive definite function is bounded. Weil (9, p. 122) and Raïkov (5) proved that every continuous positive definite function on a locally compact abelian group is the Fourier-Stieltjes transform of a bounded positive measure, thus generalizing theorems of Herglotz (4) (G = Z, the integers) and Bochner (1) (G = R, the real numbers).If ƒ is a continuous function, then condition (1) is equivalent to the condition that2

Shifted Chebyshev schemes for solving fractional optimal control problems

2019 ◽  
Vol 25 (15) ◽  
pp. 2143-2150 ◽  
Author(s):  
M Abdelhakem ◽  
H Moussa ◽  
D Baleanu ◽  
M El-Kady
Keyword(s):  
Optimal Control ◽  
Fractional Order ◽  
Chebyshev Polynomials ◽  
Optimal Control Problems ◽  
Optimization Problems ◽  
Control Problems ◽  
Numerical Examples ◽  
Fractional Optimal Control ◽  
Functional Approximation ◽  
Fractional Optimal Control Problems

Two schemes to find approximated solutions of optimal control problems of fractional order (FOCPs) are investigated. Integration and differentiation matrices were used in these schemes. These schemes used Chebyshev polynomials in the shifted case as a functional approximation. The target of the presented schemes is to convert such problems to optimization problems (OPs). Numerical examples are included, showing the strength of the schemes.

Sign in / Sign up

Export Citation Format

Share Document