Communication Efficient Decentralized Information Fusion in Sensor Networks

Many physical, geological and environmental phenomena are spread over large spatio-temporal scales and require robust sensor network systems to gather data, collaborate and monitor the area for anomaly detection. In decentralized sensor networks, deployed in monitoring such events, agents are constrained to monitor localized regions and collaborate with other agents to obtain a common global model. While such sensor networks yield significant benefits such as endurance and scalability, they are constrained in amount of on-board resources available such as computational ability, communication bandwidth and fuel. In this work the problem of decentralized functional inference over a spatially separated sensor network with limited communication capability is studied. Gaussian Processes (GPs) have been studied as priors over spatially distributed functions. The key benefit of GPs is that the number and location of regression kernels, and the numerical values of associated weights, are simultaneously inferred from the underlying data. While this enables the model to adapt its structure based on the data, it also makes decentralized inference using Consensus type algorithms difficult if agents do not know each-other's kernel selection a-priori, and traditional sample based inference is communication-inefficient if all of the data is shared between agents. A new decentralized communication-efficient algorithm for decentralized information fusion over GPs is presented of which the key contribution is that agents do not have to a-priori know each-other's kernel selections. Instead, our algorithm enables agent's to build a global GP model by fusing together local compressed GPs. To further prevent unnecessary communication, the presented algorithm can utilize information theoretic measures on value-of-information to initiate broadcasts only when agents have sufficient new information. The algorithm is compared with several state of the art methods on real-world and synthetic datasets, and is shown to lead to efficient estimation accuracy with decreased communication cost, without having to assume that agents share a common set of kernels. To further evaluate the real time performance of the presented method, a multi-agent simulator system is developed as a test bench. Experiments for decentralized multi-agent planning, which use the described fusion algorithm, are conducted and the respective results are provided.Mechanical & Aerospace Engineerin

Machine Learning for Unmanned Aerial System (UAS) Networking

Fueled by the advancement of 5G new radio (5G NR), rapid development has occurred in many fields. Compared with the conventional approaches, beamforming and network slicing enable 5G NR to have ten times decrease in latency, connection density, and experienced throughput than 4G long term evolution (4G LTE). These advantages pave the way for the evolution of Cyber-physical Systems (CPS) on a large scale. The reduction of consumption, the advancement of control engineering, and the simplification of Unmanned Aircraft System (UAS) enable the UAS networking deployment on a large scale to become feasible. The UAS networking can finish multiple complex missions simultaneously. However, the limitations of the conventional approaches are still a big challenge to make a trade-off between the massive management and efficient networking on a large scale. With 5G NR and machine learning, in this dissertation, my contributions can be summarized as the following: I proposed a novel Optimized Ad-hoc On-demand Distance Vector (OAODV) routing protocol to improve the throughput of Intra UAS networking. The novel routing protocol can reduce the system overhead and be efficient. To improve the security, I proposed a blockchain scheme to mitigate the malicious basestations for cellular connected UAS networking and a proof-of-traffic (PoT) to improve the efficiency of blockchain for UAS networking on a large scale. Inspired by the biological cell paradigm, I proposed the cell wall routing protocols for heterogeneous UAS networking. With 5G NR, the inter connections between UAS networking can strengthen the throughput and elasticity of UAS networking. With machine learning, the routing schedulings for intra- and inter- UAS networking can enhance the throughput of UAS networking on a large scale. The inter UAS networking can achieve the max-min throughput globally edge coloring. I leveraged the upper and lower bound to accelerate the optimization of edge coloring. This dissertation paves a way regarding UAS networking in the integration of CPS and machine learning. The UAS networking can achieve outstanding performance in a decentralized architecture. Concurrently, this dissertation gives insights into UAS networking on a large scale. These are fundamental to integrating UAS and National Aerial System (NAS), critical to aviation in the operated and unmanned fields. The dissertation provides novel approaches for the promotion of UAS networking on a large scale. The proposed approaches extend the state-of-the-art of UAS networking in a decentralized architecture. All the alterations can contribute to the establishment of UAS networking with CPS

DECENTRALIZED ROBUST NONLINEAR MODEL PREDICTIVE CONTROLLER FOR UNMANNED AERIAL SYSTEMS

The nonlinear and unsteady nature of aircraft aerodynamics together with limited practical range of controls and state variables make the use of the linear control theory inadequate especially in the presence of external disturbances, such as wind. In the classical approach, aircraft are controlled by multiple inner and outer loops, designed separately and sequentially. For unmanned aerial systems in particular, control technology must evolve to a point where autonomy is extended to the entire mission flight envelope. This requires advanced controllers that have sufficient robustness, track complex trajectories, and use all the vehicles control capabilities at higher levels of accuracy. In this work, a robust nonlinear model predictive controller is designed to command and control an unmanned aerial system to track complex tight trajectories in the presence of internal and external perturbance. The Flight System developed in this work achieves the above performance by using: 1 A nonlinear guidance algorithm that enables the vehicle to follow an arbitrary trajectory shaped by moving points; 2 A formulation that embeds the guidance logic and trajectory information in the aircraft model, avoiding cross coupling and control degradation; 3 An artificial neural network, designed to adaptively estimate and provide aerodynamic and propulsive forces in real-time; and 4 A mixed sensitivity approach that enhances the robustness for a nonlinear model predictive controller overcoming the effect of un-modeled dynamics, external disturbances such as wind, and measurement additive perturbations, such as noise and biases. These elements have been integrated and tested in simulation and with previously stored flight test data and shown to be feasible

Ten years of cooperation between mobile robots and sensor networks

This paper presents an overview of the work carried out by the Group of Robotics, Vision and Control (GRVC) at the University of Seville on the cooperation between mobile robots and sensor networks. The GRVC, led by Professor Anibal Ollero, has been working over the last ten years on techniques where robots and sensor networks exploit synergies and collaborate tightly, developing numerous research projects on the topic. In this paper, based on our research, we introduce what we consider some relevant challenges when combining sensor networks with mobile robots. Then, we describe our developed techniques and main results for these challenges. In particular, the paper focuses on autonomous self-deployment of sensor networks; cooperative localization and tracking; self-localization and mapping; and large-scale scenarios. Extensive experimental results and lessons learnt are also discussed in the paper

Communication-based UAV Swarm Missions

Unmanned aerial vehicles have developed rapidly in recent years due to technological advances. UAV technology can be applied to a wide range of applications in surveillance, rescue, agriculture and transport. The problems that can exist in these areas can be mitigated by combining clusters of drones with several technologies. For example, when a swarm of drones is under attack, it may not be able to obtain the position feedback provided by the Global Positioning System (GPS). This poses a new challenge for the UAV swarm to fulfill a specific mission. This thesis intends to use as few sensors as possible on the UAVs and to design the smallest possible information transfer between the UAVs to maintain the shape of the UAV formation in flight and to follow a predetermined trajectory. This thesis presents Extended Kalman Filter methods to navigate autonomously in a GPS-denied environment. The UAV formation control and distributed communication methods are also discussed and given in detail

UAV Path Planning in Search Operations

QC 2011120

Distributed approaches for coverage missions with multiple heterogeneous UAVs for coastal areas.

This Thesis focuses on a high-level framework proposal for heterogeneous aerial, fixed wing teams of robots, which operate in complex coastal areas. Recent advances in the computational capabilities of modern processors along with the decrement of small scale aerial platform manufacturing costs, have given researchers the opportunity to propose efficient and low-cost solutions to a wide variety of problems. Regarding marine sciences and more generally coastal or sea operations, the use of aerial robots brings forth a number of advantages, including information redundancy and operator safety. This Thesis initially deals with complex coastal decomposition in relation with a vehicles’ on-board sensor. This decomposition decreases the computational complexity of planning a flight path, while respecting various aerial or ground restrictions. The sensor-based area decomposition also facilitates a team-wide heterogeneous solution for any team of aerial vehicles. Then, it proposes a novel algorithmic approach of partitioning any given complex area, for an arbitrary number of Unmanned Aerial Vehicles (UAV). This partitioning schema, respects the relative flight autonomy capabilities of the robots, providing them a corresponding region of interest. In addition, a set of algorithms is proposed for obtaining coverage waypoint plans for those areas. These algorithms are designed to afford the non-holonomic nature of fixed-wing vehicles and the restrictions their dynamics impose. Moreover, this Thesis also proposes a variation of a well-known path tracking algorithm, in order to further reduce the flight error of waypoint following, by introducing intermediate waypoints and providing an autopilot parametrisation. Finally, a marine studies test case of buoy information extraction is presented, demonstrating in that manner the flexibility and modular nature of the proposed framework.Esta tesis se centra en la propuesta de un marco de alto nivel para equipos heterogéneos de robots de ala fija que operan en áreas costeras complejas. Los avances recientes en las capacidades computacionales de los procesadores modernos, junto con la disminución de los costes de fabricación de plataformas aéreas a pequeña escala, han brindado a los investigadores la oportunidad de proponer soluciones eficientes y de bajo coste para enfrentar un amplio abanico de cuestiones. Con respecto a las ciencias marinas y, en términos más generales, a las operaciones costeras o marítimas, el uso de robots aéreos conlleva una serie de ventajas, incluidas la redundancia de la información y la seguridad del operador. Esta tesis trata inicialmente con la descomposición de áreas costeras complejas en relación con el sensor a bordo de un vehículo. Esta descomposición disminuye la complejidad computacional de la planificación de una trayectoria de vuelo, al tiempo que respeta varias restricciones aéreas o terrestres. La descomposición del área basada en sensores también facilita una solución heterogénea para todo el equipo para cualquier equipo de vehículos aéreos. Luego, propone un novedoso enfoque algorítmico de partición de cualquier área compleja dada, para un número arbitrario de vehículos aéreos no tripulados (UAV). Este esquema de partición respeta las capacidades relativas de autonomía de vuelo de los robots, proporcionándoles una región de interés correspondiente. Además, se propone un conjunto de algoritmos para obtener planes de puntos de cobertura para esas áreas. Estos algoritmos están diseñados teniendo en cuenta la naturaleza no holonómica de los vehículos de ala fija y las restricciones que impone su dinámica. En ese sentido, esta Tesis también ofrece una variación de un algoritmo de seguimiento de rutas bien conocido, con el fin de reducir aún más el error de vuelo del siguiente punto de recorrido, introduciendo puntos intermedios y proporcionando una parametrización del piloto automático. Finalmente, se presenta un caso de prueba de estudios marinos de extracción de información de boyas, que demuestra de esa manera la flexibilidad y el carácter modular del marco propuesto