28 October 2020 in IEEE Transactions on Control of Network Systems
In this paper, a unique multi-agent control problem is defined --- all the elements of all the agent states reaching consensus at the same time, i.e., the multi-agent system achieves time-synchronized consensus; and fixed-time-synchronized consensus, where the upper bound of the synchronized settling time is independent of the initial states of multi-agent systems. To articulate this (fixed-) time-synchronized consensus problem, we first propose Time-Synchronized Stability and Fixed-Time-Synchronized Stability, a special kind of fixed/finite-time stability, where all the elements of the system state synchronously arrive at the equilibrium at the same time, with the upper bound of the synchronized settling time-dependent/independent of initial conditions. Based on fixed-time-synchronized stability, a singularity-free sliding mode control law is designed to solve the fixed-time-synchronized consensus problem. Finally, numerical simulations are conducted to showcase the effectiveness, and further exploration of the merit of the proposed controller is provided.
29 January 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Previous research on finite-time control focuses on forcing a system state (vector) to converge within a certain time moment, regardless of how each state element converges. In the present work, we introduce a control problem with unique finite/fixed-time stability considerations, namely time-synchronized stability (TSS), where at the same time , all the system state elements converge to the origin, and fixed-TSS, where the upper bound of the synchronized settling time is invariant with any initial state. Accordingly, sufficient conditions for (fixed-) TSS are presented. On the basis of these formulations of the time-synchronized convergence property, the classical sign function, and also a norm-normalized sign function , are first revisited. Then in terms of this notion of TSS, we investigate their differences with applications in control system design for first-order systems (to illustrate the key concepts and outcomes), paying special attention to their convergence performance. It is found that while both these sign functions contribute to system stability, nevertheless an important result can be drawn that norm-normalized sign functions help a system to additionally achieve TSS. Furthermore, we propose a fixed-time-synchronized sliding-mode controller for second-order systems; and we also consider the important related matters of singularity avoidance there. Finally, numerical simulations are conducted to present the (fixed-) time-synchronized features attained; and further explorations of the merits of the proposed (fixed-) TSS are described.
17 August 2022 in IEEE Transactions on Intelligent Transportation Systems
In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm has shown noteworthy advantageous outcomes of computation efficiency in achieving motion planning tasks under general constraints of different types. However, the constrained iLQR methodology requires a feasible trajectory at the first iteration as a prerequisite when the logarithmic barrier function is used. Also, the methodology leaves open the possibility for incorporation of fast, efficient, and effective optimization methods (i.e., fast-solvers) to further speed up the optimization process such that the requirements of real-time implementation can be successfully fulfilled. In this paper, a well-defined and commonly-encountered motion planning problem is formulated under nonlinear vehicle dynamics and various constraints, and the alternating direction method of multipliers (ADMM) is utilized to determine the optimal control actions leveraging the iLQR. With this development, the approach is able to circumvent the feasibility requirement of the trajectory at the first iteration. An illustrative example of motion planning for autonomous vehicles is then investigated with different driving scenarios taken into consideration, and a noteworthy achievement of high computation efficiency is attained with the proposed development. Comparing with the constrained iLQR algorithm based on the logarithmic barrier function, our proposed method reduces the average computation time by $31.93\%$ , $38.52\%$ , and $44.57\%$ in the three scenarios; compared with the optimization solver IPOPT, our proposed method reduces the average computation time by $46.02\%$ , $53.26\%$ , and $88.43\%$ in the three scenarios. As a result, real-time computation and implementation can be realized through our proposed framework, and thus it provides additional safety to the on-road driving tasks.
25 October 2021 in IEEE Transactions on Smart Grid
This paper investigates the economic operation of a microgrid with a variety of distributed energy resources. Given the intermittency of renewable generation and the high stochasticity in market prices and loads, online power scheduling approaches are generally preferred for their uncertainty handling capacity by exploiting real-time information. Traditional online methods like model predictive control require a separate forecaster, while recent reinforcement learning (RL) based methods can learn a policy from historical data directly. However, RL methods often suffer from dimensionality issues arising from the continuous state and action space, complex constraints, and sluggish training. We propose a novel data-driven online approach based on imitation learning instead, which overcomes these limitations through problem decomposition, and more importantly, mimicking a mixed-integer linear programming (MILP) solver rather than learn from scratch. The policy demonstrated by the MILP expert is approximated with a deep neural network. Our approach reduces the training time dramatically even in a small microgrid, achieving a 17-times speedup in contrast to a Q-learning method. Moreover, the operation cost achieved by our approach subject to various uncertainties is close to the theoretical minimum value. Extensive numerical studies on both simulated and real-world data highlight the performance advantage of the proposed approach as compared to other common methods.
30 March 2021 in IEEE Transactions on Automatic Control
In this note, simultaneous-arrival-to-origin (SATO) convergence is defined --- all the elements of the system state arriving at the origin at the same time. Accordingly, a relevant sufficient condition is proposed for SATO convergence. Based on this formulation of SATO convergence, the classical sign function and the norm-normalized sign function are revisited. We investigate their differences with applications in sliding-mode control design, paying special attention to their convergence performance. It is found that both functions (expectedly when properly invoked) contribute to system stability, while the norm-normalized sign function additionally enables the system to achieve SATO convergence. This finding shows the distinctive merit of the norm-normalized sign function in achieving more than finite-time stability for a sliding-mode control system. Extensions to the scenario with a networked system are studied, where with the utilization of the norm-normalized sign function, the networked system (now with the SATO convergence property) drives all the agents to reach consensus simultaneously. Additionally, for double integrator systems and Euler-Lagrange systems, singularity-fr