Measurement Testbed for Radar and Emitter Localization of UAV at 3.75 GHz

This paper presents an experimental measurement platform for the research and development of unmanned aerial vehicles (UAVs) localization algorithms using radio emission and reflectivity. We propose a cost-effective, flexible testbed made from commercial off-the-shelf (COTS) devices to allow academic research regarding the upcoming integration of UAV surveillance in existing mobile radio networks in terms of integrated sensing and communication (ISAC). The system enables nanosecond-level synchronization accuracy and centimeter-level positioning accuracy for multiple distributed sensor nodes and a mobile UAV-mounted node. Results from a real-world measurement in a 16 km2 urban area demonstrate the system's performance with both emitter localization as well as with the radar setup

Towards 6G IoT : tracing mobile sensor nodes with deep learning clustering in UAV networks

Unmanned aerial vehicles (UAVs) in the role of flying anchor nodes have been proposed to assist the localisation of terrestrial Internet of Things (IoT) sensors and provide relay services in the context of the upcoming 6G networks. This paper considered the objective of tracing a mobile IoT device of unknown location, using a group of UAVs that were equipped with received signal strength indicator (RSSI) sensors. The UAVs employed measurements of the target’s radio frequency (RF) signal power to approach the target as quickly as possible. A deep learning model performed clustering in the UAV network at regular intervals, based on a graph convolutional network (GCN) architecture, which utilised information about the RSSI and the UAV positions. The number of clusters was determined dynamically at each instant using a heuristic method, and the partitions were determined by optimising an RSSI loss function. The proposed algorithm retained the clusters that approached the RF source more effectively, removing the rest of the UAVs, which returned to the base. Simulation experiments demonstrated the improvement of this method compared to a previous deterministic approach, in terms of the time required to reach the target and the total distance covered by the UAVs

Active Localization using Bernstein Distribution Functions

In this work, we present a framework that enables a vehicle to autonomously localize a target based on noisy range measurements computed from RSSI data. To achieve the mission objectives, we develop a control scheme composed of two main parts: an estimator and a motion planner. At each time step, new estimates of the target's position are computed and used to generate and update distribution functions using Bernstein polynomials. A metric of the efficiency of the estimator is derived based on the Fisher Information Matrix. Finally, the motion planning problem is formulated to react in real time to new information about the target and improve the estimator's performance.Comment: 6 page

Formation Control for Unmanned Aerial Vehicles with Directed and Switching Topologies

Formation control problems for unmanned aerial vehicle (UAV) swarm systems with directed and switching topologies are investigated. A general formation control protocol is proposed firstly. Then, by variable transformation, the formation problem is transformed into a consensus problem, which can be solved by a novel matrix decomposition method. Sufficient conditions to achieve formation with directed and switching topologies are provided and an explicit expression of the formation reference function is given. Furthermore, an algorithm to design the gain matrices of the protocol is presented. Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results

Unmanned vehicles formation control in 3D space and cooperative search

The first problem considered in this dissertation is the decentralized non-planar formation control of multiple unmanned vehicles using graph rigidity. The three-dimensional formation control problem consists of n vehicles operating in a plane Q and r vehicles that operate in an upper layer outside of the plane Q. This can be referred to as a layered formation control where the objective is for all vehicles to cooperatively acquire a predefined formation shape using a decentralized control law. The proposed control strategy is based on regulating the inter-vehicle distances and uses backstepping and Lyapunov approaches. Three different models, with increasing level of complexity are considered for the multi-vehicle system: the single integrator vehicle model, the double integrator vehicle model, and a model that represents the dynamics of a class of robotics vehicles including wheeled mobile robots, underwater vehicles with constant depth, aircraft with constant altitude, and marine vessels. A rigorous stability analysis is presented that guarantees convergence of the inter-vehicle distances to desired values. Additionally, a new Neural Network (NN)-based control algorithm that uses graph rigidity and relative positions of the vehicles is proposed to solve the formation control problem of unmanned vehicles in 3D space. The control law for each vehicle consists of a nonlinear component that is dependent on the closed-loop error dynamics plus a NN component that is linear in the output weights (a one-tunable layer NN is used). A Lyapunov analysis shows that the proposed distance-based control strategy achieves the uniformly ultimately bounded stability of the desired infinitesimally and minimally rigid formation and that NN weights remain bounded. Simulation results are included to demonstrate the performance of the proposed method. The second problem addressed in this dissertation is the cooperative unmanned vehicles search. In search and surveillance operations, deploying a team of unmanned vehicles provides a robust solution that has multiple advantages over using a single vehicle in efficiency and minimizing exploration time. The cooperative search problem addresses the challenge of identifying target(s) in a given environment when using a team of unmarried vehicles by proposing a novel method of mapping and movement of vehicle teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, the vehicles have an efficient travel path while performing searches due to this partitioning approach. Second, a team of unmanned vehicles that move in a cooperative manner and utilize the Tabu Random algorithm is used to search for target(s). Due to the ever-increasing use of robotics and unmanned systems, the field of cooperative multi-vehicle search has developed many applications recently that would benefit from the use of the approach presented in this dissertation, including: search and rescue operations, surveillance, data collection, and border patrol. Simulation results are presented that show the performance of the Tabu Random search algorithm method in combination with hexagonal partitioning

Swarm-inspired solution strategy for the search problem of unmanned aerial vehicles

Learning from the emergent behaviour of social insects, this research studies the influences of environment to collective problem-solving of insect behaviour and distributed intelligent systems. Literature research has been conducted to understand the emergent paradigms of social insects, and to investigate current research and development of distributed intelligent systems. On the basis of the literature investigation, the environment is considered to have significant impact on the effectiveness and efficiency of collective problem-solving. A framework of collective problem-solving is developed in an interdisciplinary context to describe the influences of the environment to insect behaviour and problem-solving of distributed intelligent systems. The environment roles and responsibilities are transformed into and deployed as a problem-solving mechanism for distributed intelligent systems. A swarm-inspired search strategy is proposed as a behaviour-based cooperative search solution. It is applied to the cooperative search problem of Unmanned Aerial Vehicles (UAVs) with a series of experiments implemented for evaluation. The search environment represents the specification and requirements of the search problem; defines tasks to be achieved and maintained; and it is where targets are locally observable and accessible to UAVs. Therefore, the information provided through the search environment is used to define rules of behaviour for UAVs. The initial detection of target signal refers to modified configurations of the search environment, which mediates local communications among UAVs and is used as a means of coordination. The experimental results indicate that, the swarm-inspired search strategy is a valuable alternative solution to current approaches of cooperative search problem of UAVs. In the proposed search solution, the diagonal formation of two UAVs is able to produce superior performance than the triangular formation of three UAVs for the average detection time and the number of targets located within the maximum time length

Communication Free Robot Swarming

As the military use of unmanned aerial vehicles increases, a growing need for novel strategies to control these systems exists. One such method for controlling many unmanned aerial vehicles simultaneously is the through the use of swarm algorithms. This research explores a swarm robotic algorithm developed by Kadrovach implemented on Pioneer Robots in a real-world environment. An adaptation of his visual sensor is implemented using stereo vision as the primary method of sensing the environment. The swarm members are prohibited from explicitly communicating other than passively through the environment. The resulting implementation produces a communication free swarming algorithm. The algorithm is tested for performance of the visual sensor, performance of the algorithm against stationary targets, and finally, performance against dynamic targets. The results show expected behavior of the swarm model as implemented on the Pioneer robots providing a foundation for future research in swarm algorithms