Dengfeng Sun

Dengfeng Sun

Auto-generated profile, based on publicly available information

Dengfeng Sun

School of Aeronautics and Astronautics, Purdue University, West Lafayette, IN, USA

Research Focus & Metrics

Academic Career Length

15Years (2012-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.

16 July 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JZJiazhen Zhou
Jiazhen Zhou
LJLi Jin
Li Jin
XWXiao Wang
Xiao Wang
DSDengfeng Sun
Dengfeng Sun
In this paper, we address the issue of congestion in future Unmanned Aerial Vehicle (UAVs) traffic system in uncertain weather. We treat the traffic of UAVs as fluid queues, and introduce models for traffic dynamics at three basic traffic components: single link, tandem link, and merge link. The impact of weather uncertainty is captured as fluctuation of the saturation rate of fluid queue discharge (capacity). The uncertainty is assumed to follow a continuous-time Markov process. We define the resilience of the UAV traffic system as the long-run stability of the traffic queues and the optimal throughput strategy under uncertainties. We derive the necessary and sufficient conditions for the stabilities of the traffic queues in the three basic traffic components. Both conditions can be easily verified in practice. The optimal throughput can be calculated via the stability conditions. Our results offer strong insight and tool for designing flows in the UAV traffic system that is resilient against weather uncertainty.

23 August 2012 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YCYi Cao
Yi Cao
DSDengfeng Sun
Dengfeng Sun
Optimizing nationwide air traffic flow entails computational difficulty as the traffic is generally modeled as a multicommodity network, which involves a huge number of variables. This paper presents a framework that speeds up the optimization. Nationwide air traffic is modeled using a link transmission model (LTM), to which a dual-decomposition method is applied. The large-scale problem is decomposed into a master problem and a number of independent subproblems, which are easy to solve. As a result, the execution of solving the subproblem is parallelizable. A parallel computing framework is based on multiprocessing technology. The master problem is updated on a server, and a client cluster is deployed to finish the subproblems such that the most computationally intensive part of the optimization can be executed in parallel. The server and the clients communicate via Transmission Control Protocol (TCP)/User Datagram Protocol (UDP). An adaptive job allocation method is developed to balance the workload among each client, resulting in maximized utilization of the computing resources. Experiment results show that, compared with an earlier single process solution, the proposed framework considerably increases computational efficiency. The optimization of a 2-h nationwide traffic problem involving 2326 subproblems takes 6 min using ten Dell workstations. The increased computational workload due to the increased number of subproblems can be mitigated by the extension of computer deployment.

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

2 December 2014 in Chinese Journal of Mechanical Engineering
Verified
Journal Article
Closed access
PDF file
Zhufeng ShaoZhufeng Shao
Zhufeng Shao
XTXiaoqiang Tang
Xiaoqiang Tang
LWLiping Wang
Liping Wang
DSDengfeng Sun
Dengfeng Sun
Optimum design is a key approach to make full use of potential advantages of a parallel manipulator. The optimum design of multi-parameter parallel manipulators(more than three design parameters), such as Stewart manipulator, relies on analysis based and algorithm based optimum design methods, which fall to be accurate or intuitive. To solve this problem and achieve both accurate and intuition, atlas based optimum design of a general Stewart parallel manipulator is established, with rational selection of design parameters. Based on the defined spherical usable workspace(SUW), primary kinematic performance indices of the Stewart manipulator, involving workspace and condition number are introduced and analyzed. Then, corresponding performance atlases are drawn with the established non-dimensional design space, and impact of joint distribution angles on the manipulator performance is analyzed and illustrated. At last, an example on atlas based optimum design of the Stewart manipulator is accomplished to illustrate the optimum design process, considering the end-effector posture. Deduced atlases can be flexibly applied to both quantitative and qualitative analysis to get the desired optimal design for the Stewart manipulator with respect to related performance requirements. Besides, the established optimum design method can be further applied to other multi-parameter parallel manipulators.

1 March 2018 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
LCLijian Chen
Lijian Chen
WCWen-Chyuan Chiang
Wen-Chyuan Chiang
RRRobert Russell
Robert Russell
JCJun Chen
Jun Chen
DSDengfeng Sun
Dengfeng Sun