Xinlei Yi

Xinlei Yi

Auto-generated profile, based on publicly available information

Xinlei Yi

College of Electronics and Information Engineering, Tongji University, Shanghai, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XYXinlei Yi
Xinlei Yi
KLKun Liu
Kun Liu
DDDimos V. Dimarogonas
Dimos V. Dimarogonas
KJKarl H. Johansson
Karl H. Johansson
We propose two novel dynamic event-triggered control laws to solve the average consensus problem for firstorder continuous-time multi-agent systems over undirected graphs. Compared with most existing triggering laws, the proposed laws involve internal dynamic variables, which play an essential role in guaranteeing that the triggering time sequence does not exhibit Zeno behavior. Moreover, some existing triggering laws are special cases of ours. For the proposed selftriggered algorithm, continuous agent listening is avoided as each agent predicts its next triggering time and broadcasts it to its neighbors at the current triggering time. Thus, each agent only needs to sense and broadcast at its triggering times, and to listen to and receive incoming information from its neighbors at their triggering times. It is proved that the proposed triggering laws make the state of each agent converge exponentially to the average of the agents' initial states if and only if the underlying graph is connected. Numerical simulations are provided to illustrate the effectiveness of the theoretical results.

6 January 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XYXinlei Yi
Xinlei Yi
XLXiuxian Li
Xiuxian Li
LXLihua Xie
Lihua Xie
KJKarl H. Johansson
Karl H. Johansson

1 September 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XLXiuxian Li
Xiuxian Li
XYXinlei Yi
Xinlei Yi
LXLihua Xie
Lihua Xie
This article investigates the distributed online optimization problem over a multi-agent network subject to local set constraints and coupled inequality constraints, which has a lot of applications in many areas, such as wireless sensor networks, power systems, and plug-in electric vehicles. In this problem, the cost function at each time step is the sum of local cost functions with each of them being gradually revealed to its corresponding agent, and meanwhile only local functions in coupled inequality constraints are accessible to each agent. To address this problem, a modified primal-dual algorithm, called distributed online primal-dual push-sum algorithm, is developed in this article, which does not rest on any assumption on parameter boundedness and is applicable to unbalanced networks. It is shown that the proposed algorithm is sublinear for both the dynamic regret and the violation of coupled inequality constraints. Finally, the theoretical results are supported by a simulation example.

13 October 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XYXinlei Yi
Xinlei Yi
XLXiuxian Li
Xiuxian Li
TYTao Yang
Tao Yang
LXLihua Xie
Lihua Xie
TCTianyou Chai
Tianyou Chai
KJKarl Henrik Johansson
Karl Henrik Johansson
Distributed bandit online convex optimization with time-varying coupled inequality constraints is considered, motivated by a repeated game between a group of learners and an adversary. The learners attempt to minimize a sequence of global loss functions and at the same time satisfy a sequence of coupled constraint functions, where the constraints are coupled across the distributed learners at each round. The global loss and the coupled constraint functions are the sum of local convex loss and constraint functions, respectively, which are adaptively generated by the adversary. The local loss and constraint functions are revealed in a bandit manner, i.e., only the values of loss and constraint functions are revealed to the learners at the sampling instance, and the revealed function values are held privately by each learner. Both one- and two-point bandit feedback are studied with the two corresponding distributed bandit online algorithms used by the learners. We show that sublinear expected regret and constraint violation are achieved by these two algorithms, if the accumulated variation of the comparator sequence also grows sublinearly. In particular, we show that $\mathcal {O}(T^{\theta })$ expected static regret and $\mathcal {O}(T^{7/4-\theta })$ constraint violation are achieved in the one-point bandit feedback setting, and $\mathcal {O}(T^{\max \lbrace \kappa,1-\kappa \rbrace })$ expected static regret and $\mathcal {O}(T^{1-\kappa /2})$ constraint violation in the two-point bandit feedback setting, where $\theta \in (3/4,5/6]$ and $\kappa \in (0,1)$ are user-defined tradeoff parameters. Finally, the tightness of the theoretical results is illustrated by numerical simulations of a simple power grid example, which also compares the proposed algorithms to algorithms existing in the literature.

30 August 2021 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
XLXiuxian Li
Xiuxian Li
XYXinlei Yi
Xinlei Yi
LXLihua Xie
Lihua Xie
This article investigates distributed online convex optimization in the presence of an aggregative variable without any global/central coordinators over a multiagent network. In this problem, each individual agent is only able to access partial information of time-varying global loss functions, thus requiring local information exchanges between neighboring agents. Motivated by many applications in reality, the considered local loss functions depend not only on their own decision variables, but also on an aggregative variable, such as the average of all decision variables. To handle this problem, an online distributed gradient tracking algorithm (O-DGT) is proposed with exact gradient information and it is shown that the dynamic regret is upper bounded by three terms: 1) a sublinear term; 2) a path variation term; and 3) a gradient variation term. Meanwhile, the O-DGT algorithm is also analyzed with stochastic/noisy gradients, showing that the expected dynamic regret has the same upper bound as the exact gradient case. To our best knowledge, this article is the first to study online convex optimization in the presence of an aggregative variable, which enjoys new characteristics in comparison with the conventional scenario without the aggregative variable. Finally, a numerical experiment is provided to corroborate the obtained theoretical results.

10 September 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XYXinlei Yi
Xinlei Yi
SZShengjun Zhang
Shengjun Zhang
TYTao Yang
Tao Yang
TCTianyou Chai
Tianyou Chai
KJKarl H. Johansson
Karl H. Johansson
This article considers the distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of local cost functions by using local information exchange. We first consider a distributed first-order primal–dual algorithm. We show that it converges sublinearly to a stationary point if each local cost function is smooth and linearly to a global optimum under an additional condition that the global cost function satisfies the Polyak–Łojasiewicz condition. This condition is weaker than strong convexity, which is a standard condition for proving linear convergence of distributed optimization algorithms, and the global minimizer is not necessarily unique. Motivated by the situations where the gradients are unavailable, we then propose a distributed zeroth-order algorithm, derived from the considered first-order algorithm by using a deterministic gradient estimator, and show that it has the same convergence properties as the considered first-order algorithm under the same conditions. The theoretical results are illustrated by numerical simulations.