Results 251 to 260 of about 15,708,220 (295)

Finite-Time Cooperative Engagement

IEEE Transactions on Automatic Control, 2019
A smooth finite-time distributed control architecture is introduced and analyzed for the cooperative engagement problem. Using a time transformation method as well as Lyapunov stability theory, it is shown that the proposed architecture guarantees finite-time cooperative engagement in that the difference between the positions of each agent and a time ...
Tansel Yucelen, Zhen Kan, Eduardo Pasiliao   +2 more
openaire   +1 more source

Stretching and folding in finite time

Chaos: An Interdisciplinary Journal of Nonlinear Science, 2016
Complex flows mix efficiently, and this process can be understood by considering the stretching and folding of material volumes. Although many metrics have been devised to characterize stretching, fewer are able to capture folding in a quantitative way in spatiotemporally variable flows.
Tian Ma, Nicholas T. Ouellette, Erik M. Bollt   +2 more
openaire   +2 more sources

Optimization in finite-reservoir finite-time thermodynamics

Physical Review E, 2014
A necessary condition to optimize work output is obtained for general heat engines working between two finite-sized heat reservoirs in a given period of time τ, with the amount of heat received from the hot reservoir being fixed for all possible realizations of the process.
openaire   +2 more sources

Finite-time attitude control: a finite-time passivity approach

IEEE/CAA Journal of Automatica Sinica, 2015
This paper studies the finite-time attitude control problem for a rigid body. It is known that linear asymptotically stabilizing control laws can be derived from passivity properties for the system which describes the kinematic and dynamic motion of the attitude.
Shuochen Liu, Zhiyong Geng, Junyong Sun
openaire   +1 more source

On tests with finite memory in finite time (Corresp.)

IEEE Transactions on Information Theory, 1974
The purpose of this correspondence is to display an inductive proof of an optimality result for testing symmetric simple hypotheses concerning a binomial parameter with a three-state memory and n observations. Specifically, it is shown that if one restricts attention to three-state automata allowing transitions only between adjacent states, then no ...
openaire   +2 more sources

Finite time stability and stabilization

Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 2002
In this paper, finite time stability and stabilization are investigated for systems described by ordinary differential equations (ODE) or differential inclusions: some sufficient conditions are given for scalar and n-dimensional cases. Then, a stabilization result for I/O linearizable systems is derived from these results.
Wilfried Perruquetti, Sergey V. Drakunov
openaire   +1 more source

Sojourn times with finite time‐horizon in finite semi‐markov processes

Applied Stochastic Models and Data Analysis, 1993
AbstractLet Y = {Yt:t ≥ 0} be a semi‐Markov process with finite state space S. Assume that Y is either irreducible and S is then partitioned into two classes A and B, or, that Y is absorbing and S is partitioned into A, B and C, where C is the set of all absorbing states of Y. Denote by TA, m(t) the mth sojourn time of Y in A during [0, t]. TA, m(t) is
openaire   +2 more sources

Finite-time stability and instability of stochastic nonlinear systems

Automatica, 2011
Finite-time stability and instability of stochastic nonlinear ...
Juliang Yin, Xinghuo Yu, Zhihong Man
exaly   +1 more source

Finite-time distributed averaging

2014 American Control Conference, 2014
This paper proposes a distributed averaging algorithm for multi-agent networks, in which each agent is with a real-valued measurement. Provided that the underlying graph of the network is a tree, the proposed algorithm enables each agent to compute the average of the values of all agents in the network in a finite number of steps.
Shaoshuai Mou, A. Stephen Morse
openaire   +2 more sources

Finite-time stability of discrete-time systems

Proceedings of the 2004 American Control Conference, 2004
We deal with some finite-time control problems for discrete-time linear systems. First we provide necessary and sufficient conditions for finite-time stability; these conditions require either the computation of the state transition matrix of the system or the solution of a certain difference Lyapunov equation (or inequality).
Amato, F., Carbone, M., Ariola, M., Cosentino, C.   +3 more
openaire   +4 more sources