Search results for "Control and Systems Engineering"

Duality theory for multi-marginal optimal transport with repulsive costs in metric spaces

2018

In this paper we extend the duality theory of the multi-marginal optimal transport problem for cost functions depending on a decreasing function of the distance (not necessarily bounded). This class of cost functions appears in the context of SCE Density Functional Theory introduced in "Strong-interaction limit of density-functional theory" by M. Seidl.

Stochastic Stability Analysis for Markovian Jump Neutral Nonlinear Systems

2012

In this paper, the stability problem is studied for a class of Markovian jump neutral nonlinear systems with time-varying delay. By Lyapunov-Krasovskii function approach, a novel mean-square exponential stability criterion is derived for the situations that the system's transition rates are completely accessible, partially accessible and non-accessible, respectively. Moreover, the developed stability criterion is extended to the systems with different bounded sector nonlinear constraints. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed methods.

Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information

2014

This paper is concerned with the problem of H"~ filtering for a class of two-dimensional Markovian jump linear systems described by the Fornasini-Marchesini local state-space model. The systems under consideration are subject to state-delays and deficient mode information in the Markov chain. The description of deficient mode information is comprehensive that simultaneously includes the exactly known, partially unknown and uncertain transition probabilities. By invoking the properties of the transition probability matrix, together with the convexification of uncertain domains, a new H"~ performance analysis criterion for the filtering error system is firstly derived. Then, via some matrix i…

Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms : An experimental analysis

2022

Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are use…

Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups

2020

We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.

Robust Finite-Time Control of Switched Linear Systems and Application to a Class of Servomechanism Systems

2015

This paper investigates finite-time (FT) stability and stabilization problems for a class of switched linear systems with polytopic uncertainties. Both stable and unstable subsystems are considered to coexist in the system, and a new concept of extended FT stability is proposed as the first attempt. A stability criterion is first established, where the admissible maximum switching number is obtained while ensuring extended FT stability of switched linear systems with time-varying delays under a given maximum ratio between the running time of unstable subsystems and the running time of stable subsystems. Sufficient conditions on the existence of desired memory state-feedback controllers are …

Conceptual spaces for anchoring

2003

On complexity and motion planning for co-rank one sub-Riemannian metrics

2004

In this paper, we study the motion planning problem for generic sub-Riemannian metrics of co-rank one. We give explicit expressions for the metric complexity (in the sense of Jean (10,11)), in terms of the elementary invariants of the problem. We construct asymptotic optimal syntheses. It turns out that among the results we show, the most complicated case is the 3-dimensional. Besides the generic C ∞ case, we study some non-generic generalizations in the analytic case.

Projective Reeds-Shepp car onS2with quadratic cost

2008

Fix two points x, ¯ ∈ S 2 and two directions (without orientation) η,¯ η of the velocities in these points. In this paper we are interested to the problem of minimizing the cost

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

2008

We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP.