Distributed efficiency-based circular formation for the unmanned air vehicles detection system

Author(s):  
Hu Zilun ◽  
Yang Jianying

This paper considers on the general circumnavigation problem for a team of vertical takeoff and landing unmanned air vehicles, with the goal of achieving specific circular formations and circling centered at a target of interest. Different from the traditional circular formation problem, in this paper, not only the formation but also the detection efficiency of the formation is taken into consideration. A novel distributed optimal circular formation algorithm is proposed. According to this algorithm, the circular formation can be guaranteed with the optimal radius that can optimize the team performance function. Hereon, the performance functions can be time-varying, and thus a time-varying optimal circular formation is created. Theoretical studies indicate that the proposed algorithm can achieve the formation in a distributed manner only based on the local information and the network connection. Finally, simulation examples are presented to show the validity of the theoretical results.

Author(s):  
S. Bras ◽  
J. F. Vasconcelos ◽  
C. Silvestre ◽  
P. Oliveira

Author(s):  
Rawad Bitar ◽  
Yuxuan Xing ◽  
Yasaman Keshtkarjahromi ◽  
Venkat Dasari ◽  
Salim El Rouayheb ◽  
...  

AbstractEdge computing is emerging as a new paradigm to allow processing data near the edge of the network, where the data is typically generated and collected. This enables critical computations at the edge in applications such as Internet of Things (IoT), in which an increasing number of devices (sensors, cameras, health monitoring devices, etc.) collect data that needs to be processed through computationally intensive algorithms with stringent reliability, security and latency constraints. Our key tool is the theory of coded computation, which advocates mixing data in computationally intensive tasks by employing erasure codes and offloading these tasks to other devices for computation. Coded computation is recently gaining interest, thanks to its higher reliability, smaller delay, and lower communication costs. In this paper, we develop a private and rateless adaptive coded computation (PRAC) algorithm for distributed matrix-vector multiplication by taking into account (1) the privacy requirements of IoT applications and devices, and (2) the heterogeneous and time-varying resources of edge devices. We show that PRAC outperforms known secure coded computing methods when resources are heterogeneous. We provide theoretical guarantees on the performance of PRAC and its comparison to baselines. Moreover, we confirm our theoretical results through simulations and implementations on Android-based smartphones.


Joule ◽  
2021 ◽  
Author(s):  
Xiao-Guang Yang ◽  
Teng Liu ◽  
Shanhai Ge ◽  
Eric Rountree ◽  
Chao-Yang Wang

Sign in / Sign up

Export Citation Format

Share Document