4.7 Article

Asynchronous control of discrete-time impulsive switched systems with mode-dependent average dwell time

Journal

ISA TRANSACTIONS
Volume 53, Issue 2, Pages 367-372

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.isatra.2013.11.019

Keywords

Asymptotic stability; Asynchronous control; Mode-dependent average dwell time

Funding

  1. National Natural Science Foundation of China [61374117, 61004048, 61174137, 61104064]
  2. General Research Fund of Hong Kong Special Administrative Region Government [CityU 112809]
  3. National Science Foundation of Jiang Su Province [BK2010493]
  4. 973 project [2011CB707000]
  5. Science and Technology Department of Sichuan Province [2013GZ0080]
  6. China Postdoctoral Science Foundation [2012M510135]

Ask authors/readers for more resources

This paper mainly studies the asynchronous control problem for a class of discrete-time impulsive switched systems, where asynchronous means the switching of the controllers has a lag to the switching of system modes. By using multiple Lyapunov functions (MLFs), the much looser asymptotic stability result of closed-loop systems is derived with a mode-dependent average dwell time (MDADT) technique. Based on the stability result obtained, the problem of asynchronous control is solved under a proper switching law. Moreover, the stability and stabilization results are formulated in form of matrix inequalities that are numerically feasible. Finally, an illustrative numerical example is presented to show the effectiveness of the obtained stability results. (C) 2013 ISA. Published by Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Software Engineering

A differentiable homotopy method to compute perfect equilibria

Yin Chen, Chuangyin Dang

Summary: This paper introduces a differentiable homotopy method for computing perfect equilibria of normal-form games, establishing a smooth path to a perfect equilibrium by constructing an artificial game and continuously differentiable function. Numerical results show that this method is numerically stable and efficient, outperforming the simplicial homotopy method especially for large-scale problems.

MATHEMATICAL PROGRAMMING (2021)

Article Operations Research & Management Science

A new alternating direction trust region method based on conic model for solving unconstrained optimization

Honglan Zhu, Qin Ni, Jianlin Jiang, Chuangyin Dang

Summary: In this paper, a new alternating direction trust region method based on conic model is proposed, solving the trust region subproblem in two orthogonal directions in two steps and overcoming the difficulties of solving the conic model subproblem. It shows better performance compared to the dogleg method, especially for large-scale problems.

OPTIMIZATION (2021)

Article Operations Research & Management Science

Computing equilibria for markets with constant returns production technologies

Yang Zhan, Chuangyin Dang

Summary: This paper discusses the computation of equilibrium in an exchange economy with constant returns production technologies. By converting the economy into a pure exchange economy and introducing a complementarity condition, feasibility of production plans is ensured. A homotopy method and path-following algorithm are proposed to solve these problems simultaneously.

ANNALS OF OPERATIONS RESEARCH (2021)

Article Computer Science, Software Engineering

A smooth homotopy method for incomplete markets

Yang Zhan, Chuangyin Dang

Summary: The problem of discontinuity in excess demand functions in the general equilibrium with incomplete asset markets model can be resolved by introducing a new return matrix with constant rank, ensuring continuity within a subset of the price space. By restricting the price vector to this subset, standard homotopy path-following arguments can be employed to handle incomplete markets and provide a constructive proof for the generic existence of general equilibrium. A homotopy method can then be used for computing equilibria in the GEI model, with numerical experiments demonstrating its efficiency.

MATHEMATICAL PROGRAMMING (2021)

Article Management

A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications

Yiyin Cao, Chuangyin Dang, Zhongdong Xiao

Summary: This paper presents a globally convergent differentiable path-following method for computing subgame perfect equilibria in robust stochastic games. By incorporating a logarithmic-barrier term and an extra variable, the method solves a convex optimization problem in each state and establishes a polynomial equilibrium system. Numerical comparisons demonstrate the superiority of the logarithmic-barrier method over the convex-quadratic-penalty method.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Operations Research & Management Science

Complementarity Enhanced Nash's Mappings and Differentiable Homotopy Methods to Select Perfect Equilibria

Yiyin Cao, Chuangyin Dang, Yabin Sun

Summary: The paper introduces the application of perfect equilibrium in extensive-form games and proposes a method to enhance Nash's mapping for selecting a perfect equilibrium through an artificial game.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2022)

Article Operations Research & Management Science

The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems

Min Jiang, Zhiqing Meng, Rui Shen, Chuangyin Dang

Summary: The research investigates two methods for two-cardinality sparse constrained optimization problems and provides error estimations for them. Two algorithms are designed based on these methods, and their convergence is proved. Numerical results indicate that the two algorithms have similar effectiveness in finding approximate solutions for the optimization problems.

OPTIMIZATION (2022)

Article Computer Science, Interdisciplinary Applications

SaaS or not: optimal versioning strategy of releasing enterprise software

Yangyang Sun, Chuangyin Dang, Gengzhong Feng

Summary: This paper addresses the versioning issue of enterprise software, considering the distinctive features of the SaaS model and obtaining differentiated results compared with previous work. The research results provide guidelines for software firms in deciding their product releases in the future.

INDUSTRIAL MANAGEMENT & DATA SYSTEMS (2022)

Article Automation & Control Systems

Semisupervised Laplace-Regularized Multimodality Metric Learning

Jianqing Liang, Pengfei Zhu, Chuangyin Dang, Qinghua Hu

Summary: This paper introduces a semi-supervised Laplace-regularized multimodal metric-learning method, which explores a joint formulation of multiple metrics and weights to learn appropriate distances from multimodal and high-dimensional features.

IEEE TRANSACTIONS ON CYBERNETICS (2022)

Article Economics

A variant of Harsanyi?s tracing procedures to select a perfect equilibrium in normal form games

Yiyin Cao, Chuangyin Dang

Summary: The linear tracing procedure is crucial in the equilibrium selection theory but fails to always select a perfect equilibrium when there are more than two players. To address this issue, we develop a variant of the linear tracing procedure by creating a perturbed game and establish the existence of a smooth path from a unique starting point to a perfect equilibrium using optimality conditions and transformations on variables. Additionally, we propose variant procedures to select a perfect equilibrium.

GAMES AND ECONOMIC BEHAVIOR (2022)

Article Computer Science, Artificial Intelligence

Metric learning via perturbing hard-to-classify instances

Xinyao Guo, Wei Wei, Jianqing Liang, Chuangyin Dang, Jiye Liang

Summary: Constraint selection is an effective approach to deal with the problem of excessive constraints in metric learning. This article introduces a novel metric learning algorithm, ML-PHI, which perturbs hard-to-classify instances to reduce over-fitting and mitigate the negative impact of those instances.

PATTERN RECOGNITION (2022)

Review Computer Science, Cybernetics

Are sticky users less likely to lurk? Evidence from online reviews

Jin Yang, Zili Zhang, Chuangyin Dang, Ziqiong Zhang

Summary: This study investigates the role of user stickiness in review posting behavior and found that sticky users are more likely to engage in review posting related to a product. The positive stickiness-post effect varies based on user expertise, product type, and product provider scale. These findings provide insights for product providers to understand and gather user intelligence.

BEHAVIOUR & INFORMATION TECHNOLOGY (2023)

Article Computer Science, Information Systems

Multiple metric learning via local metric fusion

Xinyao Guo, Lin Li, Chuangyin Dang, Jiye Liang, Wei Wei

Summary: Adaptive distance metric learning based on data characteristics can improve learner's performance significantly. Multiple local metric learning is an essential tool to describe local properties of heterogeneous data. The proposed Multiple Metric Learning via Local Metric Fusion (MML-LMF) framework unifies local metric learning and fusion of similar local metrics, adaptively determines the number of local metrics, and outperforms existing state-of-the-art global and multiple metric learning algorithms, as demonstrated on various benchmarks and datasets.

INFORMATION SCIENCES (2023)

Article Mathematics, Applied

OPTIMIZATION CONDITIONS AND DECOMPOSABLE ALGORITHMS FOR CONVERTIBLE NONCONVEX OPTIMIZATION

Min Jiang, Rui Shen, Zhiqing Meng, Chuangyin Dang

Summary: This paper defines a convertible nonconvex function (CN function for short) and a weak (strong) uniform (decomposable, exact) CN function, proves the optimization conditions for their global solutions, and proposes algorithms for solving the unconstrained optimization problems with decomposable CN functions. The operational properties of CN functions are proved, and the optimization conditions for the global optimal solution with weak uniform CN function are also proved. A decomposable algorithm is proposed and its convergence is proved. The numerical results demonstrate the effectiveness of the decomposable algorithm in solving the unconstrained optimization problems with CN function.

JOURNAL OF NONLINEAR AND VARIATIONAL ANALYSIS (2023)

Article Computer Science, Interdisciplinary Applications

An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games

Chuangyin Dang, P. Jean-Jacques Herings, Peixuan Li

Summary: This paper introduces an interior-point differentiable path-following method (IPM) for computing subgame perfect equilibrium in stationary strategies (SSPE) in stochastic games. The proposed IPM method has several advantages over existing methods and has been shown to be more efficient and reliable.

INFORMS JOURNAL ON COMPUTING (2022)

No Data Available