Yi Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yi Huang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Ziyang Meng
Tsinghua University
20 shared publications - Jian Sun
Beijing Institute of Technology
16 shared publications - Yingmin Jia
Beihang University (BUAA)
4 shared publications - Wei Ren
Department of Electrical and Computer Engineering, University of California, Riverside, CA, USA
3 shared publications Bingjin Liu
State Key Laboratory of Autonomous Intelligent Unmanned Systems, School of Automation, Beijing Institute of Technology, Beijing, China
2 shared publicationsBowen Sun
State Key Lab oratory of Autonomous Intelligent Unmanned Systems, School of Automation, Beijing Institute of Technology, Beijing, China
2 shared publications
Latest Publications
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 12012-12026
Visibility-Constrained Vision-Based Air-to-Air Tracking and Control for Noncooperative UAVs With Unknown Maneuvers
This paper proposes a visibility-constrained vision based air-to-air tracking system for the pursuit of non cooperative Unmanned Aerial Vehicles (UAVs) with complex and unknown maneuvers, which comprises a target motion estimator and a Position-Based Visual Servo (PBVS) controller. Firstly, the target motion estimator integrates Pseudo Linear Kalman Filter (PLKF) with Interactive Multi Model (IMM) filters, which can effectively cope with the high uncertainty of target motion in air-to-air scenarios, overcoming the limitations of traditional single-model estimation in complex maneuvering trajectories. Moreover, the proposed estimator does not require the observer to perform higher-order motion than the target to recover the target state. Secondly, the designed PBVS controller is based on virtual coordinate frame to decouple the translation and rotation control, thereby simplifying the controller design. In order to ensure the target visibility throughout the entire tracking process, the Control Barrier Function (CBF) is incorporated to dynamically adjust the controller input by imposing constraints on the actual image plane, which enhances the reliability and safety of the system. Finally, simulation and real-world experiment results have verified the effectiveness of the proposed method.
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 12012-12026
Visibility-Constrained Vision-Based Air-to-Air Tracking and Control for Noncooperative UAVs With Unknown Maneuvers
This paper proposes a visibility-constrained vision based air-to-air tracking system for the pursuit of non cooperative Unmanned Aerial Vehicles (UAVs) with complex and unknown maneuvers, which comprises a target motion estimator and a Position-Based Visual Servo (PBVS) controller. Firstly, the target motion estimator integrates Pseudo Linear Kalman Filter (PLKF) with Interactive Multi Model (IMM) filters, which can effectively cope with the high uncertainty of target motion in air-to-air scenarios, overcoming the limitations of traditional single-model estimation in complex maneuvering trajectories. Moreover, the proposed estimator does not require the observer to perform higher-order motion than the target to recover the target state. Secondly, the designed PBVS controller is based on virtual coordinate frame to decouple the translation and rotation control, thereby simplifying the controller design. In order to ensure the target visibility throughout the entire tracking process, the Control Barrier Function (CBF) is incorporated to dynamically adjust the controller input by imposing constraints on the actual image plane, which enhances the reliability and safety of the system. Finally, simulation and real-world experiment results have verified the effectiveness of the proposed method.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (2) , 1249-1261
Discrete-Time Distributed Optimal Formation Algorithms for Multiagent Systems With Nonlinear Inequality Constraints
This article studies the distributed optimal formation problems for multiagent systems subject to nonlinear inequality constraints. This problem can be formulated into a nonlinear mixed-integer programming (NMIP) problem. We first decompose the NMIP problem into a formation optimal matching problem, which is actually an integer linear programming (ILP) problem, and an optimal formation reference center problem described as a constrained quadratic optimization problem. Subsequently, we develop a discrete-time perturbation-based distributed dual consensus ADMM (PDC-ADMM) algorithm, which achieves an optimal integer solution to the ILP problem and eliminates the unmatched phenomenon. In addition, we propose a distributed optimistic gradient descent ascent (D-OGDA) algorithm with a constant step size, which guarantees exact convergence to the optimal formation reference center. Finally, three simulation examples are carried out to demonstrate the effectiveness of the developed algorithms.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (2) , 1249-1261
Discrete-Time Distributed Optimal Formation Algorithms for Multiagent Systems With Nonlinear Inequality Constraints
This article studies the distributed optimal formation problems for multiagent systems subject to nonlinear inequality constraints. This problem can be formulated into a nonlinear mixed-integer programming (NMIP) problem. We first decompose the NMIP problem into a formation optimal matching problem, which is actually an integer linear programming (ILP) problem, and an optimal formation reference center problem described as a constrained quadratic optimization problem. Subsequently, we develop a discrete-time perturbation-based distributed dual consensus ADMM (PDC-ADMM) algorithm, which achieves an optimal integer solution to the ILP problem and eliminates the unmatched phenomenon. In addition, we propose a distributed optimistic gradient descent ascent (D-OGDA) algorithm with a constant step size, which guarantees exact convergence to the optimal formation reference center. Finally, three simulation examples are carried out to demonstrate the effectiveness of the developed algorithms.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7691-7698
Distributed Proximal Algorithms for Nonsmooth Optimization: Unified Convergence Analysis
This article studies two classes of nonsmooth distributed optimization problems with coupled constraints, in which the local cost function of each agent consists of a Lipschitz differentiable function and a nonsmooth function. By applying the primal–dual method and proximal operation, we propose two discrete-time distributed algorithms to solve the nonsmooth resource allocation problem and optimal consensus problem, respectively. Different from some previous results with decreasing step-sizes, the proposed algorithms are developed by using the constant step-sizes, which achieves a faster convergence rate. Moreover, we find that these two distributed proximal algorithms have the same structure and can be formulated in a unified framework. A unified convergence analysis is shown that these two algorithms achieve exact convergence to an optimal solution with an ergodic convergence rate $O(1/k)$. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed algorithms.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7691-7698
Distributed Proximal Algorithms for Nonsmooth Optimization: Unified Convergence Analysis
This article studies two classes of nonsmooth distributed optimization problems with coupled constraints, in which the local cost function of each agent consists of a Lipschitz differentiable function and a nonsmooth function. By applying the primal–dual method and proximal operation, we propose two discrete-time distributed algorithms to solve the nonsmooth resource allocation problem and optimal consensus problem, respectively. Different from some previous results with decreasing step-sizes, the proposed algorithms are developed by using the constant step-sizes, which achieves a faster convergence rate. Moreover, we find that these two distributed proximal algorithms have the same structure and can be formulated in a unified framework. A unified convergence analysis is shown that these two algorithms achieve exact convergence to an optimal solution with an ergodic convergence rate $O(1/k)$. Finally, a simulation example is presented to demonstrate the effectiveness of the proposed algorithms.
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (7) , 1519-1521
Distributed Event-Triggered Nash Equilibrium Seeking for Aggregative Game with Second-Order Dynamics
Dear Editor, This letter studies the distributed Nash equilibrium seeking problem of aggregative game, in which the decision of each player obeys second-order dynamics and is constrained by nonidentical convex sets. To seek the generalized Nash equilibrium (GNE), a projection based distributed algorithm via constant step-sizes is developed with linear convergence. In particular, a variable tracking technique is incorporated to estimate the aggregative function, and an event-triggered mechanism is designed to reduce the communication cost. Finally, a numerical example demonstrates the theoretical results.
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (7) , 1519-1521
Distributed Event-Triggered Nash Equilibrium Seeking for Aggregative Game with Second-Order Dynamics
Dear Editor, This letter studies the distributed Nash equilibrium seeking problem of aggregative game, in which the decision of each player obeys second-order dynamics and is constrained by nonidentical convex sets. To seek the generalized Nash equilibrium (GNE), a projection based distributed algorithm via constant step-sizes is developed with linear convergence. In particular, a variable tracking technique is incorporated to estimate the aggregative function, and an event-triggered mechanism is designed to reduce the communication cost. Finally, a numerical example demonstrates the theoretical results.
- 7 March 2025
- Published by Springer Nature
- p. 533-542
Image-Based Prescribed Performance Control for Quadrotor to Track an Unknown Target
- 7 March 2025
- Published by Springer Nature
- p. 533-542
Image-Based Prescribed Performance Control for Quadrotor to Track an Unknown Target
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (7) , 10081-10091
A Smooth Distributed Formation Control Method for Quadrotor UAVs Under Event-Triggering Mechanism and Switching Topologies
This paper focuses on the formation control problem of a team of quadrotor unmanned aerial vehicles (UAVs) subject to switching directed topologies. We present a distributed event-triggered formation control algorithm via hierarchical framework, which achieves the formation control objective with weak assumptions on switching topologies. In particular, we develop a distributed control force that enables the achievement of the target formation, which only relies on the neighbors' position information under event-triggering mechanism. The proposed algorithm can maintain smooth characteristics when confronted with discontinuities stemming from event-triggering mechanism and switching interactions among agents. Additionally, the boundedness of the command control force can be guaranteed by employing an auxiliary system. Subsequently, we develop an attitude tracking control algorithm to guarantee that the attitude error almost globally exponentially converges to zero. Finally, a numerical example is carried out to validate the theoretical results.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (7) , 10081-10091
A Smooth Distributed Formation Control Method for Quadrotor UAVs Under Event-Triggering Mechanism and Switching Topologies
This paper focuses on the formation control problem of a team of quadrotor unmanned aerial vehicles (UAVs) subject to switching directed topologies. We present a distributed event-triggered formation control algorithm via hierarchical framework, which achieves the formation control objective with weak assumptions on switching topologies. In particular, we develop a distributed control force that enables the achievement of the target formation, which only relies on the neighbors' position information under event-triggering mechanism. The proposed algorithm can maintain smooth characteristics when confronted with discontinuities stemming from event-triggering mechanism and switching interactions among agents. Additionally, the boundedness of the command control force can be guaranteed by employing an auxiliary system. Subsequently, we develop an attitude tracking control algorithm to guarantee that the attitude error almost globally exponentially converges to zero. Finally, a numerical example is carried out to validate the theoretical results.
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (12) , 11178-11185
Distributed Algorithms via Saddle-Point Dynamics for Multi-Robot Task Assignment
This letter develops two distributed algorithms to solve multi-robot task assignment problems (MTAP). We first describe MTAP as an integer linear programming (ILP) problem and then reformulate it as a relaxed convex optimization problem. Based on the saddle-point dynamics, we propose two distributed optimization algorithms using optimistic gradient decent ascent (OGDA) and extra-gradient (EG) methods, which achieve exact convergence to an optimal solution of the relaxed problem. In most cases, such an solution reflects the optimality of the original ILP problems. For some special ILP problems, we provide a perturbation-based distributed method to avoid the inconsistency phenomenon, such that an optimal solution to any ILP problem is obtained. Compared with some decentralized algorithms requiring a central robot that communicates with the other robots, our developed algorithms are fully distributed, in which each robot only communicates with the nearest neighbors for an arbitrary connected graph. We evaluate the developed algorithms in terms of computation, communication, and data storage complexities, and compare them with some typical algorithms. It is shown that the developed algorithms have low computational and communication complexities. We also verify the effectiveness of our algorithms via numerical examples.
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (12) , 11178-11185
Distributed Algorithms via Saddle-Point Dynamics for Multi-Robot Task Assignment
This letter develops two distributed algorithms to solve multi-robot task assignment problems (MTAP). We first describe MTAP as an integer linear programming (ILP) problem and then reformulate it as a relaxed convex optimization problem. Based on the saddle-point dynamics, we propose two distributed optimization algorithms using optimistic gradient decent ascent (OGDA) and extra-gradient (EG) methods, which achieve exact convergence to an optimal solution of the relaxed problem. In most cases, such an solution reflects the optimality of the original ILP problems. For some special ILP problems, we provide a perturbation-based distributed method to avoid the inconsistency phenomenon, such that an optimal solution to any ILP problem is obtained. Compared with some decentralized algorithms requiring a central robot that communicates with the other robots, our developed algorithms are fully distributed, in which each robot only communicates with the nearest neighbors for an arbitrary connected graph. We evaluate the developed algorithms in terms of computation, communication, and data storage complexities, and compare them with some typical algorithms. It is shown that the developed algorithms have low computational and communication complexities. We also verify the effectiveness of our algorithms via numerical examples.
- 25 October 2024
- Published by Springer Nature
- p. 202-210
Distributed Event-Triggered Formation Control of Multiple UAVs with Communication Delays
- 25 October 2024
- Published by Springer Nature
- p. 202-210
Distributed Event-Triggered Formation Control of Multiple UAVs with Communication Delays
- 12 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (9) , 5317-5326
Distributed Constrained Optimization for Second-Order Multiagent Systems via Event-Based Communication
This article studies the distributed constrained optimization problems for the discrete-time second-order multiagent systems (MASs), in which each agent privately owns local cost function and nonidentical convex set constraints. To solve this problem, a projection-based distributed event-triggered algorithm is developed via the constant step-sizes, which achieves an ergodic convergence rate $O(1/k)$ for the general convex functions. By applying the event-triggered mechanism, the proposed algorithm can avoid unnecessary communication among the agents. Moreover, it is shown that the introduced event-triggered component does not sacrifice the convergence rate. Finally, a simulation example is carried out to demonstrate the theoretical results.
- 12 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (9) , 5317-5326
Distributed Constrained Optimization for Second-Order Multiagent Systems via Event-Based Communication
This article studies the distributed constrained optimization problems for the discrete-time second-order multiagent systems (MASs), in which each agent privately owns local cost function and nonidentical convex set constraints. To solve this problem, a projection-based distributed event-triggered algorithm is developed via the constant step-sizes, which achieves an ergodic convergence rate $O(1/k)$ for the general convex functions. By applying the event-triggered mechanism, the proposed algorithm can avoid unnecessary communication among the agents. Moreover, it is shown that the introduced event-triggered component does not sacrifice the convergence rate. Finally, a simulation example is carried out to demonstrate the theoretical results.