Bin Du

Dr. Bin Du


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
3 March 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
BDBin Du
Bin Du
JCJun Chen
Jun Chen
DSDengfeng Sun
Dengfeng Sun
SMSatyanarayana Gupta Manyam
Satyanarayana Gupta Manyam
DCDavid W. Casbeer
David W. Casbeer
Chance-constrained optimization provides a promi-sing framework for solving control and planning problems with uncertainties, due to its modeling capability to capture randomness in real-world applications. In this paper, we consider a UAV trajectory planning problem with probabilistic geo-fence, building on the chance-constrained optimization approach. In the considered problem, randomness of the model, such as the uncertain boundaries of geo-fences, is incorporated in the formulation. By solving the formulated chance-constrained optimization with a novel sampling based solution method, the optimal UAV trajectory is achieved while limiting the probability of collision with geo-fences to a prefixed threshold. Furthermore, to obtain a totally collision-free trajectory, i.e., avoiding the collision not only at the discrete time-steps but also within the entire time horizon, we build on the idea of an iterative scheme. That is, to iterate the solving of the chance-constrained optimization until the collision with probabilistic geo-fence is avoided at any time within the time horizon. At last, we validate the effectiveness of our method via numerical simulations.

6 February 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
CHChaochun Huang
Chaochun Huang
BDBin Du
Bin Du
Mou ChenMou Chen
Mou Chen
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.

20 February 2020 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
BDBin Du
Bin Du
RMRuijiu Mao
Ruijiu Mao
NKNan Kong
Nan Kong
DSDengfeng Sun
Dengfeng Sun
This paper presents an algorithmic framework for distributed data fusion using a network of multiple Unmanned Aerial Vehicles (UAVs). Each UAV in the network is capable of sensing signals, performing computational tasks, and exchanging information with its immediate neighbors. Based on the limited local measurement and exchanged information only from neighbors, we aim to propose a fully distributed algorithm to integrate information from various measurements of individual UAVs. As an important building block of the distributed data fusion algorithm, a novel sum consensus scheme is also developed with only assuming row-stochastic weight matrices. As a potential application of the proposed distributed data fusion, we consider an on-scene signal sensing scenario and deploy the network of UAVs to monitor the health status of some certain targets. Consequently, through the proposed distributed algorithm, each UAV is able to obtain a more reliable fused sensing result with higher accuracy, compared to the local measurement collected by the UAV itself. The effectiveness of the proposed algorithmic framework is finally validated by both theoretical analysis and numerical s

7 June 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BDBin Du
Bin Du
KQKun Qian
Kun Qian
CCChristian Claudel
Christian Claudel
DSDengfeng Sun
Dengfeng Sun
This paper presents a novel Jacobi-style iteration algorithm for solving the problem of distributed submodular maximization, in which multiple agents determine their strategies from the private sets so that a global, non-separable submodular objective function is jointly maximized. Building on the multi-linear extension of the submodular function, we expect to achieve the solution from a probabilistic, rather than deterministic, perspective, and thus transfer the considered problem from the discrete domain into the continuous domain. Since it is observed that an unbiased estimation of the gradient of multi-linear extension function can be obtained by sampling the agents’ local strategies, a projected stochastic gradient algorithm is proposed to solve the problem. Our algorithm enables simultaneous updates among all individual agents and guarantees to converge asymptotically to a desirable equilibrium solution. Such an equilibrium solution is shown to be at least suboptimal, which is comparable to the state-of-art in the literature. The convergence rate, which is characterized by the running average of gradient mapping, is proved to be , where is the number of iterations. Moreover, we further enhance the proposed algorithm by handling the scenario in which agents’ communication delays are present. The enhanced algorithm admits a more realistic distributed implementation of our approach. Finally, a movie recommendation task is conducted on a real-world movie rating dataset, to validate the numerical performance of our algorithms.

30 April 2021 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
BDBin Du
Bin Du
KQKun Qian
Kun Qian
CCChristian Claudel
Christian Claudel
DSDengfeng Sun
Dengfeng Sun
Motivated by the application of environment monitoring, this article studies a novel algorithmic framework for solving, in a parallelized manner, the problem of multisensor active information gathering. Unlike the existing methods relying on the fully connected sensor network and sequential processing, our approach builds on the generic network topology and enables individual sensors to simultaneously make their decisions by communicating with the immediate neighbors. Leveraging the cooperation among the multisensor network, we show that the computational complexity of the proposed parallelized algorithm can be greatly reduced compared to the sequential updating schemes, and meanwhile, the suboptimality of obtained solutions is guaranteed. The interconnection between the algorithm complexity and solution quality is explicitly established with respect to the network topology. Based on such interconnection, we further provide the approach to design the optimal sensor network by the given time budget of the algorithm execution. Finally, numerical simulations on a methane emission monitoring scenario are presented to validate the effectiveness of our approach.

26 December 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BDBin Du
Bin Du
KQKun Qian
Kun Qian
CCChristian Claudel
Christian Claudel
DSDengfeng Sun
Dengfeng Sun
This article presents a learning-based algorithm for solving the online source-seeking problem with a multiagent system under an unknown dynamical environment. Our algorithm, building on a notion termed as dummy confidence upper bound (D-UCB), integrates both estimation of the unknown environment and task planning for the multiple agents simultaneously, and as a result, enables the multiple agents to track the extremum spots of the dynamical environment in an online manner. Unlike the standard confidence upper bound algorithm in the context of multiarmed bandits, the notion of D-UCB helps significantly reduce the computational complexity in solving the subproblems of task planning, and thus renders our algorithm exceptionally computation-efficient in the distributed setting. The performance of our algorithm is theoretically guaranteed by showing a sublinear upper bound of the cumulative regret. Numerical results on a real-world pollution monitoring and tracking problem are also provided to demonstrate the effectiveness of the algorithm.