Bin Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bin Du has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Dengfeng Sun
School of Aeronautics and Astronautics, Purdue University, West Lafayette, IN, USA
12 shared publications - Christian Claudel
The University of Texas at Austin
4 shared publications - Kun Qian
Department of Civil, Architectural, and Environmental Engineering, University of Texas at Austin, Austin, TX, USA
4 shared publications Dingqi Zhu
Nanjing University of Aeronautics and Astronautics
3 shared publications- Nan Kong
Weldon School of Biomedical Engineering Purdue University West Lafayette Indiana USA
3 shared publications - Mou Chen
Nanjing University of Aeronautics and Astronautics
2 shared publications
Latest Publications
- 1 June 2026
- Published by Taylor & Francis in International Journal of Control
- Vol. 99 (8) , 1-16
Multi-agent discrete-time circular formation control with moving distance constraints
1. Over the last decades, multi-agent formation control has become a fundamental problem and attracted significant amount of attention in various research communities, including system control, rob...
- 1 June 2026
- Published by Taylor & Francis in International Journal of Control
- Vol. 99 (8) , 1-16
Multi-agent discrete-time circular formation control with moving distance constraints
1. Over the last decades, multi-agent formation control has become a fundamental problem and attracted significant amount of attention in various research communities, including system control, rob...
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 6273-6286
Task Assignment for Uncrewed Aerial Vehicle Swarm via SCA-ADMM Algorithm
The task assignment strategy of Unmanned Aerial Vehicle (UAV) swarm under the improved Successive Convex Approximation (SCA) framework is studied in this paper. A mathematical model with binary decision variables is established via considering the heterogeneous characteristics of Unmanned Aerial Vehicles (UAVs) and multiple constraints such as completion rate, execution synchronization and timeliness of task implementation. To address the deficiencies of traditional SCA, a single-loop structure where convex approximation functions and Lagrange multipliers are updated in parallel is introduced. Alternating Direction Method of Multipliers (ADMM) algorithm is used to reduce the number of iterations for solving multivariate optimization problems. The convergence of the algorithm and the stable solution of the optimization problem are obtained through applying the difference method and the Lagrange multiplier method. The results are also applied to the case of UAV failure. Finally, the efficacy of the proposed method is validated through the utilization of UAV swarm to attack enemy positions.
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 6273-6286
Task Assignment for Uncrewed Aerial Vehicle Swarm via SCA-ADMM Algorithm
The task assignment strategy of Unmanned Aerial Vehicle (UAV) swarm under the improved Successive Convex Approximation (SCA) framework is studied in this paper. A mathematical model with binary decision variables is established via considering the heterogeneous characteristics of Unmanned Aerial Vehicles (UAVs) and multiple constraints such as completion rate, execution synchronization and timeliness of task implementation. To address the deficiencies of traditional SCA, a single-loop structure where convex approximation functions and Lagrange multipliers are updated in parallel is introduced. Alternating Direction Method of Multipliers (ADMM) algorithm is used to reduce the number of iterations for solving multivariate optimization problems. The convergence of the algorithm and the stable solution of the optimization problem are obtained through applying the difference method and the Lagrange multiplier method. The results are also applied to the case of UAV failure. Finally, the efficacy of the proposed method is validated through the utilization of UAV swarm to attack enemy positions.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4097-4104
Multiagent Online Source Seeking Against Nonstochastic Disturbances
This note proposes to leverage the emerging learning techniques to devise a multiagent online source seeking algorithm under unknown environments. Of particular significance in our problem setups are: first, the underlying environment is not only unknown, but dynamically changing and also perturbed by two types of nonstochastic disturbances, and second, a group of agents is deployed and expected to cooperatively seek as many sources as possible. Correspondingly, a new technique of the discounted Kalman filter is developed to tackle nonstochastic disturbances, and a notion of confidence bound in polytope nature is utilized to aid the computation-efficient cooperation among multiple agents. With standard assumptions on the unknown environment as well as the disturbances, our algorithm is shown to achieve sublinear regrets under the two types of nonstochastic disturbances; both results are comparable to the state of the art. Numerical examples are provided on a real-world pollution monitoring application to demonstrate the effectiveness of our algorithm.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 4097-4104
Multiagent Online Source Seeking Against Nonstochastic Disturbances
This note proposes to leverage the emerging learning techniques to devise a multiagent online source seeking algorithm under unknown environments. Of particular significance in our problem setups are: first, the underlying environment is not only unknown, but dynamically changing and also perturbed by two types of nonstochastic disturbances, and second, a group of agents is deployed and expected to cooperatively seek as many sources as possible. Correspondingly, a new technique of the discounted Kalman filter is developed to tackle nonstochastic disturbances, and a notion of confidence bound in polytope nature is utilized to aid the computation-efficient cooperation among multiple agents. With standard assumptions on the unknown environment as well as the disturbances, our algorithm is shown to achieve sublinear regrets under the two types of nonstochastic disturbances; both results are comparable to the state of the art. Numerical examples are provided on a real-world pollution monitoring application to demonstrate the effectiveness of our algorithm.
- Open Access
Backstepping-Based Finite-Horizon Optimization for Pitching Attitude Control of Aircraft
In this paper, the problem of pitching attitude finite-horizon optimization for aircraft is posed with system uncertainties, external disturbances, and input constraints. First, a neural network (NN) and a nonlinear disturbance observer (NDO) are employed to estimate the value of system uncertainties and external disturbances. Taking input constraints into account, an auxiliary system is designed to compensate for the constrained input. Subsequently, the backstepping control containing NN and NDO is used to ensure the stability of systems and suppress the adverse effects caused by the system uncertainties and external disturbances. In order to avoid the derivation operation in the process of backstepping, a dynamic surface control (DSC) technique is utilized. Simultaneously, the estimations of the NN and NDO are applied to derive the backstepping control law. For the purpose of achieving finite-horizon optimization for pitching attitude control, an adaptive method termed adaptive dynamic programming (ADP) with a single NN-termed critic is applied to obtain the optimal control. Time-varying feature functions are applied to construct the critic NN in order to approximate the value function in the Hamilton–Jacobi–Bellman (HJB) equation. Furthermore, a supplementary term is added to the weight update law to minimize the terminal constraint. Lyapunov stability theory is used to prove that the signals in the control system are uniformly ultimately bounded (UUB). Finally, simulation results illustrate the effectiveness of the proposed finite-horizon optimal attitude control method.
Open AccessBackstepping-Based Finite-Horizon Optimization for Pitching Attitude Control of Aircraft
In this paper, the problem of pitching attitude finite-horizon optimization for aircraft is posed with system uncertainties, external disturbances, and input constraints. First, a neural network (NN) and a nonlinear disturbance observer (NDO) are employed to estimate the value of system uncertainties and external disturbances. Taking input constraints into account, an auxiliary system is designed to compensate for the constrained input. Subsequently, the backstepping control containing NN and NDO is used to ensure the stability of systems and suppress the adverse effects caused by the system uncertainties and external disturbances. In order to avoid the derivation operation in the process of backstepping, a dynamic surface control (DSC) technique is utilized. Simultaneously, the estimations of the NN and NDO are applied to derive the backstepping control law. For the purpose of achieving finite-horizon optimization for pitching attitude control, an adaptive method termed adaptive dynamic programming (ADP) with a single NN-termed critic is applied to obtain the optimal control. Time-varying feature functions are applied to construct the critic NN in order to approximate the value function in the Hamilton–Jacobi–Bellman (HJB) equation. Furthermore, a supplementary term is added to the weight update law to minimize the terminal constraint. Lyapunov stability theory is used to prove that the signals in the control system are uniformly ultimately bounded (UUB). Finally, simulation results illustrate the effectiveness of the proposed finite-horizon optimal attitude control method.
- 11 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1922-1927
Securing Trust-Based Resilient Algorithms Against Smart Malicious Agents
In this work, we study the problem of legitimate in-neighborhood learning with multi-agent systems, where stochastic observations of trust between agents are available. Unlike previous works, we consider two types of malicious agents: naive and smart. Naive malicious agents always behave maliciously, while smart malicious agents can intermittently disguise themselves as legitimate agents. We identify a security vulnerability of the standard threshold design =1/2, which is commonly used in trust aggregation approaches. This design fails to account for the deceptive behavior of smart malicious agents, making the approach vulnerable to their attacks. To address this, we propose a threshold design that explicitly accounts for such agents. Specifically, we provide a sufficient condition for the existence of a constant threshold that enables legitimate agents to identify their legitimate in-neighbors over time, despite the presence of smart malicious agents. In addition, we show that the proposed threshold design ensures geometrically decaying misclassification probabilities. Finally, we present numerical examples to validate our theoretical results and demonstrate how the design enhances the security of existing trust-based resilient algorithms against smart malicious agents.
- 11 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1922-1927
Securing Trust-Based Resilient Algorithms Against Smart Malicious Agents
In this work, we study the problem of legitimate in-neighborhood learning with multi-agent systems, where stochastic observations of trust between agents are available. Unlike previous works, we consider two types of malicious agents: naive and smart. Naive malicious agents always behave maliciously, while smart malicious agents can intermittently disguise themselves as legitimate agents. We identify a security vulnerability of the standard threshold design =1/2, which is commonly used in trust aggregation approaches. This design fails to account for the deceptive behavior of smart malicious agents, making the approach vulnerable to their attacks. To address this, we propose a threshold design that explicitly accounts for such agents. Specifically, we provide a sufficient condition for the existence of a constant threshold that enables legitimate agents to identify their legitimate in-neighbors over time, despite the presence of smart malicious agents. In addition, we show that the proposed threshold design ensures geometrically decaying misclassification probabilities. Finally, we present numerical examples to validate our theoretical results and demonstrate how the design enhances the security of existing trust-based resilient algorithms against smart malicious agents.
- Open Access
- 27 December 2024
- Published by Scilight Press Pty Ltd in Applied Mathematics and Statistics
- Vol. 1 (1) , 5
Bandit-Based Multi-Agent Source Seeking with Safety Guarantees
Article Zhibin Ji † , Dingqi Zhu † and Bin Du * College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211016, China * Correspondence: iniesdu@nuaa.edu.cn † These authors contributed equally to this work. Received: 2 November 2024; Revised: 24 December 2024;Accepted: 26 December 2024; Published: 27 December 2024 Abstract: In this paper, we focus on a multi-agent source seeking problem where the safety of agents is characterized by a set of linear constraints. In particular, the safety constraints are also dependent on the unknown environment states, which makes the source seeking problem challenging to solve. To overcome such a challenge, we introduce a new notion of measurable path and then specify the reachability condition for all agents. A time-sequence of exploration is further introduced to help the agents to escape the stuck positions. To provide a performance guarantee for our source seeking algorithm, we perform the regret analysis and show a sub-linear cumulative regret. Finally, we evaluate the effectiveness of our SafeSearch algorithm through a set of simulations.
- 27 December 2024
- Published by Scilight Press Pty Ltd in Applied Mathematics and Statistics
- Vol. 1 (1) , 5
Open AccessBandit-Based Multi-Agent Source Seeking with Safety Guarantees
Article Zhibin Ji † , Dingqi Zhu † and Bin Du * College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211016, China * Correspondence: iniesdu@nuaa.edu.cn † These authors contributed equally to this work. Received: 2 November 2024; Revised: 24 December 2024;Accepted: 26 December 2024; Published: 27 December 2024 Abstract: In this paper, we focus on a multi-agent source seeking problem where the safety of agents is characterized by a set of linear constraints. In particular, the safety constraints are also dependent on the unknown environment states, which makes the source seeking problem challenging to solve. To overcome such a challenge, we introduce a new notion of measurable path and then specify the reachability condition for all agents. A time-sequence of exploration is further introduced to help the agents to escape the stuck positions. To provide a performance guarantee for our source seeking algorithm, we perform the regret analysis and show a sub-linear cumulative regret. Finally, we evaluate the effectiveness of our SafeSearch algorithm through a set of simulations.
- 10 May 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 47 (2) , 369-380
Air–ground cooperative multi-target searching under an unknown urban environment
The collaboration of heterogeneous multiple robots has been shown to be capable of significantly enhancing the system redundancy, autonomy, robustness, and so on. However, realizing the collaboration with specific tasks in practice often requires the development of sophisticated mechanisms which are envisioned to exploit distinct benefits of the heterogeneous platforms. Thus, we propose a novel air–ground cooperative framework in this paper for the task of multi-target searching under an unknown urban environment. In particular, a group of unmanned aerial vehicles (UAVs) is employed to operate above the urban area to provide surveillance from a global perspective. Under the guidance of UAVs, multiple teams of unmanned ground vehicles (UGVs) are deployed to conduct the target searching missions. The UAVs’ and UGVs’ searching strategies are devised correspondingly leveraging on their own advantageous features. Finally, an ingenious integration of UAVs’ and UGVs’ searching operations is established by a notion of the upper confidence bound. Simulation results are provided to demonstrate the effectiveness of our approach.
- 10 May 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 47 (2) , 369-380
Air–ground cooperative multi-target searching under an unknown urban environment
The collaboration of heterogeneous multiple robots has been shown to be capable of significantly enhancing the system redundancy, autonomy, robustness, and so on. However, realizing the collaboration with specific tasks in practice often requires the development of sophisticated mechanisms which are envisioned to exploit distinct benefits of the heterogeneous platforms. Thus, we propose a novel air–ground cooperative framework in this paper for the task of multi-target searching under an unknown urban environment. In particular, a group of unmanned aerial vehicles (UAVs) is employed to operate above the urban area to provide surveillance from a global perspective. Under the guidance of UAVs, multiple teams of unmanned ground vehicles (UGVs) are deployed to conduct the target searching missions. The UAVs’ and UGVs’ searching strategies are devised correspondingly leveraging on their own advantageous features. Finally, an ingenious integration of UAVs’ and UGVs’ searching operations is established by a notion of the upper confidence bound. Simulation results are provided to demonstrate the effectiveness of our approach.
- 29 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 442-447
Multi-Agent Discrete-Time Asynchronous Circular Formation Control
This letter studies the circular formation control problem from a perspective of distributed optimization. Two types of algorithms are developed, i.e., a synchronous Jacobi iteration method and its asynchronous variant, both of which are proven to achieve the convergence with exponential rates. As distinct from the existing continuous-time approaches, a step-size is imposed into our discrete-time methods and its influence on the convergence rate is analyzed explicitly. According to the analysis, the optimal choice of step-size is provided with respect to the convergence rate. Extensive numerical results are finally present to demonstrate the theoretical findings in this letter.
- 29 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 442-447
Multi-Agent Discrete-Time Asynchronous Circular Formation Control
This letter studies the circular formation control problem from a perspective of distributed optimization. Two types of algorithms are developed, i.e., a synchronous Jacobi iteration method and its asynchronous variant, both of which are proven to achieve the convergence with exponential rates. As distinct from the existing continuous-time approaches, a step-size is imposed into our discrete-time methods and its influence on the convergence rate is analyzed explicitly. According to the analysis, the optimal choice of step-size is provided with respect to the convergence rate. Extensive numerical results are finally present to demonstrate the theoretical findings in this letter.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (4) , 3611-3622
Adapting Progressive Hedging for Solving Two-Stage Stochastic Programs Under a Peer-to-Peer Computing Network
Following recent technology advances and increasing applications in peer-to-peer network computing, we explore the potential of using decentralized optimization methods to solve notoriously hard stochastic programs. As the first attempt, we adapt the well-known progressive hedging (PH) method under a peer-to-peer computing network for solving two-stage stochastic programs efficiently. Similar to the existing parallel PH method, our decentralized variant assigns each node within the network to take charge of the computing tasks covering one or few scenarios, and thus it distributes the overall computational burden over the entire network. However, unlike the parallel PH method, the decentralized variant no longer needs a master node to realize central coordination, and thus it improves the scalability of the network computing as well. In this paper, we show the exact convergence of our decentralized method for solving two-stage stochastic programs with continuous variables subject to convex constraints. Further, we investigate several computational issues for the mixed-integer cases to improve the adaptation efficiency. Finally, the efficiency of our method is demonstrated through comparative computational experiments on a set of benchmark test instances.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (4) , 3611-3622
Adapting Progressive Hedging for Solving Two-Stage Stochastic Programs Under a Peer-to-Peer Computing Network
Following recent technology advances and increasing applications in peer-to-peer network computing, we explore the potential of using decentralized optimization methods to solve notoriously hard stochastic programs. As the first attempt, we adapt the well-known progressive hedging (PH) method under a peer-to-peer computing network for solving two-stage stochastic programs efficiently. Similar to the existing parallel PH method, our decentralized variant assigns each node within the network to take charge of the computing tasks covering one or few scenarios, and thus it distributes the overall computational burden over the entire network. However, unlike the parallel PH method, the decentralized variant no longer needs a master node to realize central coordination, and thus it improves the scalability of the network computing as well. In this paper, we show the exact convergence of our decentralized method for solving two-stage stochastic programs with continuous variables subject to convex constraints. Further, we investigate several computational issues for the mixed-integer cases to improve the adaptation efficiency. Finally, the efficiency of our method is demonstrated through comparative computational experiments on a set of benchmark test instances.
- 6 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (3) , 3038-3049
Multi-UAV Cooperative Online Searching Based on Voronoi Diagrams
This paper presents a Voronoi-based online source searching algorithm for a team of cooperative unmanned aerial vehicles (UAVs) under an unknown environment. By integrating the environment estimation as well as searching task planning, the multiple UAVs are able to simultaneously localize as many sources as possible in an online and decentralized manner. In particular, to tackle with several applicability issues, we leverage the technique of Voronoi diagram which helps i) avoid potential collisions among multiple UAVs; and ii) keep all UAVs' traveling distance short during the searching process; and iii) reduce the searching solution space. Moreover, we further hence the algorithm by enabling the UAVs' incremental movements and coverage-based searching. The performance of our online searching algorithm is validated both theoretically and numerically.
- 6 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (3) , 3038-3049
Multi-UAV Cooperative Online Searching Based on Voronoi Diagrams
This paper presents a Voronoi-based online source searching algorithm for a team of cooperative unmanned aerial vehicles (UAVs) under an unknown environment. By integrating the environment estimation as well as searching task planning, the multiple UAVs are able to simultaneously localize as many sources as possible in an online and decentralized manner. In particular, to tackle with several applicability issues, we leverage the technique of Voronoi diagram which helps i) avoid potential collisions among multiple UAVs; and ii) keep all UAVs' traveling distance short during the searching process; and iii) reduce the searching solution space. Moreover, we further hence the algorithm by enabling the UAVs' incremental movements and coverage-based searching. The performance of our online searching algorithm is validated both theoretically and numerically.