A review of artificial intelligence applied to path planning in UAV swarms

This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/ s00521-021-06569-4This is the accepted version of: A. Puente-Castro, D. Rivero, A. Pazos, and E. Fernández-Blanco, "A review of artificial intelligence applied to path planning in UAV swarms", Neural Computing and Applications, vol. 34, pp. 153–170, 2022. https://doi.org/10.1007/s00521-021-06569-4[Abstract]: Path Planning problems with Unmanned Aerial Vehicles (UAVs) are among the most studied knowledge areas in the related literature. However, few of them have been applied to groups of UAVs. The use of swarms allows to speed up the flight time and, thus, reducing the operational costs. When combined with Artificial Intelligence (AI) algorithms, a single system or operator can control all aircraft while optimal paths for each one can be computed. In order to introduce the current situation of these AI-based systems, a review of the most novel and relevant articles was carried out. This review was performed in two steps: first, a summary of the found articles; second, a quantitative analysis of the publications found based on different factors, such as the temporal evolution or the number of articles found based on different criteria. Therefore, this review provides not only a summary of the most recent work but it gives an overview of the trend in the use of AI algorithms in UAV swarms for Path Planning problems. The AI techniques of the articles found can be separated into four main groups based on their technique: reinforcement Learning techniques, Evolutive Computing techniques, Swarm Intelligence techniques, and, Graph Neural Networks. The final results show an increase in publications in recent years and that there is a change in the predominance of the most widely used techniques.This work is supported by Instituto de Salud Carlos III, grant number PI17/01826 (Collaborative Project in Genomic Data Integration (CICLOGEN) funded by the Instituto de Salud Carlos III from the Spanish National plan for Scientific and Technical Research and Innovation 2013–2016 and the European Regional Development Funds (FEDER)—“A way to build Europe.”. This project was also supported by the General Directorate of Culture, Education and University Management of Xunta de Galicia ED431D 2017/16 and “Drug Discovery Galician Network” Ref. ED431G/01 and the “Galician Network for Colorectal Cancer Research” (Ref. ED431D 2017/23). This work was also funded by the grant for the consolidation and structuring of competitive research units (ED431C 2018/49) from the General Directorate of Culture, Education and University Management of Xunta de Galicia, and the CYTED network (PCI2018_093284) funded by the Spanish Ministry of Ministry of Innovation and Science. This project was also supported by the General Directorate of Culture, Education and University Management of Xunta de Galicia “PRACTICUM DIRECT” Ref. IN845D-2020/03.Xunta de Galicia; ED431D 2017/16Xunta de Galicia; ED431G/01Xunta de Galicia; ED431D 2017/23Xunta de Galicia; ED431C 2018/49Xunta de Galicia; IN845D-2020/0

Content Caching and Delivery in Heterogeneous Vehicular Networks

Connected and automated vehicles (CAVs), which enable information exchange and content delivery in real time, are expected to revolutionize current transportation systems for better driving safety, traffic efficiency, and environmental sustainability. However, the emerging CAV applications such as content delivery pose stringent requirements on latency, throughput, reliability, and global connectivity. The current wireless networks face significant challenges to satisfy the requirements due to scarce radio spectrum resources, inflexibility to dynamic traffic demands, and geographic-constrained fixed infrastructure deployment. To empower multifarious CAV content delivery, heterogeneous vehicular networks (HetVNets), which integrate the terrestrial networks with aerial networks formed by unmanned aerial vehicles (UAVs) and space networks constituting of low Earth orbit (LEO) satellites, can guarantee reliable, flexible, cost-effective, and globally seamless service provisioning. In addition, edge caching is a promising solution to facilitate content delivery by caching popular files in the HetVNet access points (APs) to relieve the backhaul traffic with a lower delivery delay. The main technical issues are: 1) to fully reveal the potential of HetVNets for content delivery performance enhancement, content caching scheme design in HetVNets should jointly consider network characteristics, vehicle mobility patterns, content popularity, and APs’ caching capacities; 2) to fully exploit the controllable mobility and agility of UAVs to support dynamic vehicular content demands, the caching scheme and trajectory design for UAVs should be jointly optimized, which has not been well addressed due to their intricate inter-coupling relationships; and 3) for caching-based content delivery in HetVNets, a cooperative content delivery scheme should be designed to enable the cooperation among different network segments with ingenious utilization of heterogeneous network resources. In this thesis, we design the content caching and delivery schemes in the caching-enabled HetVNet to address the three technical issues. First, we study the content caching in HetVNets with fixed terrestrial APs including cellular base stations (CBSs), Wi-Fi roadside units (RSUs), and TV white space (TVWS) stations. To characterize the intermittent network connection caused by limited network coverage and high vehicle mobility, we establish an on-off model with service interruptions to describe the vehicular content delivery process. Content coding then is leveraged to resist the impact of unstable network connections and enhance caching efficiency. By jointly considering file characteristics and network conditions, the content placement is formulated as an integer linear programming (ILP) problem. Adopting the idea of the student admission model, the ILP problem is then transformed into a many-to-one matching problem between content files and HetVNet APs and solved by our proposed stable-matching-based caching scheme. Simulation results demonstrate that the proposed scheme can achieve near-optimal performances in terms of delivery delay and offloading ratio with a low complexity. Second, UAV-aided caching is considered to assist vehicular content delivery in aerial-ground vehicular networks (AGVN) and a joint caching and trajectory optimization (JCTO) problem is investigated to jointly optimize content caching, content delivery, and UAV trajectory. To enable real-time decision-making in highly dynamic vehicular networks, we propose a deep supervised learning scheme to solve the JCTO problem. Specifically, we first devise a clustering-based two-layered (CBTL) algorithm to solve the JCTO problem offline. With a given content caching policy, we design a time-based graph decomposition method to jointly optimize content delivery and UAV trajectory, with which we then leverage the particle swarm optimization algorithm to optimize the content caching. We then design a deep supervised learning architecture of the convolutional neural network (CNN) to make online decisions. With the CNN-based model, a function mapping the input network information to output decisions can be intelligently learnt to make timely inferences. Extensive trace-driven experiments are conducted to demonstrate the efficiency of CBTL in solving the JCTO problem and the superior learning performance with the CNN-based model. Third, we investigate caching-assisted cooperative content delivery in space-air-ground integrated vehicular networks (SAGVNs), where vehicular content requests can be cooperatively served by multiple APs in space, aerial, and terrestrial networks. In specific, a joint optimization problem of vehicle-to-AP association, bandwidth allocation, and content delivery ratio, referred to as the ABC problem, is formulated to minimize the overall content delivery delay while satisfying vehicular quality-of-service (QoS) requirements. To address the tightly-coupled optimization variables, we propose a load- and mobility-aware ABC (LMA-ABC) scheme to solve the joint optimization problem as follows. We first decompose the ABC problem to optimize the content delivery ratio. Then the impact of bandwidth allocation on the achievable delay performance is analyzed, and an effect of diminishing delay performance gain is revealed. Based on the analysis results, the LMA-ABC scheme is designed with the consideration of user fairness, load balancing, and vehicle mobility. Simulation results demonstrate that the proposed LMA-ABC scheme can significantly reduce the cooperative content delivery delay compared to the benchmark schemes. In summary, we have investigated the content caching in terrestrial networks with fixed APs, joint caching and trajectory optimization in the AGVN, and caching-assisted cooperative content delivery in the SAGVN. The proposed schemes and theoretical results should provide useful guidelines for future research in the caching scheme design and efficient utilization of network resources in caching-enabled heterogeneous wireless networks

Distributed management and coordination of UAV swarms based on infrastructureless wireless networks

[ES] Los Vehículos Aéreos no Tripulados (o drones) ya han demostrado su utilidad en una gran variedad de aplicaciones. Hoy en día, se utilizan para fotografía, cinematografía, inspecciones y vigilancia, entre otros. Sin embargo, en la mayoría de los casos todavía son controlados por un piloto, que como máximo suele estar volando un solo dron cada vez. En esta tesis, tratamos de avanzar en paso más allá en esta tecnología al permitir que múltiples drones con capacidad para despegue y aterrizaje vertical trabajen de forma sincronizada, como una sola entidad. La principal ventaja de realizar vuelos en grupo, comúnmente denominado enjambre, es que se pueden realizar tareas más complejas que utilizando un solo dron. De hecho, un enjambre permite cubrir más área en el mismo tiempo, ser más resistente, tener una capacidad de carga más alta, etc. Esto puede habilitar el uso de nuevas aplicaciones, o una mejor eficiencia para las aplicaciones existentes. Sin embargo, una parte clave es que los miembros del enjambre deben organizarse correctamente, ya que, durante el vuelo, diferentes perturbaciones pueden provocar que sea complicado mantener el enjambre como una unidad coherente. Una vez que se pierde esta coherencia, todos los beneficios previamente mencionados de un enjambre se pierden también. Incluso, aumenta el riesgo de colisiones entre los elementos del enjambre. Por lo tanto, esta tesis se centra en resolver algunos de estos problemas, proporcionando un conjunto de algoritmos que permitan a otros desarrolladores crear aplicaciones de enjambres de drones. Para desarrollar los algoritmos propuestos hemos incorporado mejoras al llamado ArduSim. Este simulador nos permite simular tanto la física de un dron como la comunicación entre drones con un alto grado de precisión. ArduSim nos permite implementar protocolos y algoritmos (bien probados) en drones reales con facilidad. Durante toda la tesis, ArduSim ha sido utilizado ampliamente. Su utilización ha permitido que las pruebas fueran seguras, y al mismo tiempo nos permitió ahorrar mucho tiempo, dinero y esfuerzo de investigación. Comenzamos nuestra investigación sobre enjambres asignando posiciones aéreas para cada dron en el suelo. Suponiendo que los drones están ubicados aleatoriamente en el suelo, y que necesitan alcanzar una formación aérea deseada, buscamos una solución que minimice la distancia total recorrida por todos los drones. Para ello se empezó con un método de fuerza bruta, pero rápidamente nos dimos cuenta de que, dada su alta complejidad, este método funciona mal cuando el número de drones aumenta. Por lo tanto, propusimos una heurística. Como en todas las heurísticas, se realizó un compromiso entre complejidad y precisión. Al simplificar el problema, encontramos que nuestra heurística era capaz de calcular una solución muy rápidamente sin aumentar sustancialmente la distancia total recorrida. Además, implementamos el algoritmo de Kuhn-Munkres (KMA), un algoritmo que ha demostrado proporcionar la respuesta exacta (es decir, reducir la distancia total recorrida) en el menor tiempo posible. Después de muchos experimentos, llegamos a la conclusión de que nuestra heurística es más rápida, pero que la solución proporcionada por el KMA es ligeramente más eficiente. En particular, aunque la diferencia en la distancia total recorrida es pequeña, el uso de KMA reduce el número de trayectorias de vuelo que se cruzan entre sí, lo cual es una métrica importante para las siguientes propuestas.[...][CA] Els vehicles aeris no tripulats (o drons) ja han demostrat la seua utilitat en una gran varietat d'aplicacions. Avui dia, s'utilitzen per a fotografia, cinematografia, inspeccions i vigilància, entre altres. No obstant això, en la majoria dels casos encara són controlats per un pilot, que com a màxim sol controlar el vol d'un sol dron cada vegada. En aquesta tesi, tractem d'avançar un pas més enllà en aquesta tecnologia, en permetre que múltiples drons amb capacitat per a l'enlairament i l'aterratge vertical treballen de forma sincronitzada, com una sola entitat. El principal avantatge de realitzar vols en grup, comunament denominats eixam, és que es poden fer tasques més complexes que utilitzant un sol dron. De fet, un eixam permet cobrir més àrea en el mateix temps, ser més resistent, tenir una capacitat de càrrega més alta, etc. Això pot habilitar l'ús de noves aplicacions, o una millor eficiència per a les aplicacions existents. No obstant això, una punt clau és que els membres de l'eixam han d'organitzar-se correctament, ja que, durant el vol, diferents pertorbacions poden provocar que siga complicat mantenir l'eixam com una unitat coherent. Una vegada que es perd aquesta coherència, tots els beneficis prèviament esmentats d'un eixam es perden també. Fins i tot, augmenta el risc de col·lisions entre els elements de l'eixam. Per tant, aquesta tesi se centra a resoldre alguns d'aquests problemes, proporcionant un conjunt d'algorismes que permeten a altres desenvolupadors crear aplicacions d'eixams de drons. Per a desenvolupar els algorismes proposats hem incorporat millores a l'anomenat ArduSim. Aquest simulador ens permet simular tant la física d'un dron com la comunicació entre drons amb un alt grau de precisió. ArduSim ens permet implementar protocols i algorismes (ben provats) en drons reals amb facilitat. Durant tota la tesi, ArduSim s'ha utilitzat àmpliament. El seu ús ha permès que les proves foren segures, i al mateix temps ens va permetre estalviar molt de temps, diners i esforç d'investigació. Per tant, es va utilitzar ArduSim per a cada bloc de construcció que vam desenvolupar. Comencem la nostra recerca sobre eixams assignant posicions aèries per a cada dron en terra. Suposant que els drons estan situats aleatòriament en terra i que necessiten assolir la formació aèria desitjada, cerquem una solució que minimitze la distància total recorreguda per tots els drons. Per a això, es va començar amb un mètode de força bruta, però ràpidament ens vam adonar que, atesa l'alta complexitat, aquest mètode funciona malament quan el nombre de drons augmenta. Per tant, vam proposar una heurística. Com en totes les heurístiques, es va fer un compromís entre complexitat i precisió. En simplificar el problema, trobem que la nostra heurística era capaç de calcular una solució molt ràpidament sense augmentar substancialment la distància total recorreguda. A més, vam implementar l'algorisme de Kuhn-Munkres (KMA), un algorisme que ha demostrat proporcionar la resposta exacta (és a dir, reduir la distància total recorreguda) en el menor temps possible. Després de molts experiments, arribem a la conclusió que la nostra heurística és més ràpida, però que la solució proporcionada pel KMA és lleugerament més eficient. En particular, encara que la diferència en la distància total recorreguda és xicoteta, l'ús de KMA redueix el nombre de trajectòries de vol que s'encreuen entre si, la qual cosa és una mètrica important per a les propostes següents.[...][EN] Unmanned Aerial Vehicles (UAVs) have already proven to be useful in many different applications. Nowadays, they are used for photography, cinematography, inspections, and surveillance. However, in most cases they are still controlled by a pilot, who at most is flying one UAV at a time. In this thesis, we try to take this technology one step further by allowing multiple Vertical Take-off and Landing (VTOL) UAVs to work together as one entity. The main advantage of this group, commonly referred to as a swarm, is that it can perform more complex tasks than a single UAV. When organized correctly, a swarm allows for: more area to be covered in the same time, more resilience, higher load capability, etc. A swarm can lead to new applications, or a better efficiency for existing applications. A key part, however, is that they should be organized correctly. During the flight, different disturbances will make it complicated to keep the swarm as one coherent unit. Once this coherency is lost, all the previously mentioned benefits of a swarm are lost as well. Even worse, the chance of a hazard increases. Therefore, this thesis focuses on solving some of these issues by providing a baseline of building blocks that enable other developers to create UAV swarm applications. In order to develop these building blocks, we improve a multi-UAV simulator called ArduSim. This simulator allows us to simulate both the physics of a UAV, and the communication between UAVs with a high degree of accuracy. This is a crucial part because it allows us to deploy (well tested) protocols and algorithms on real UAVs with ease. During the entirety of this thesis, ArduSim has been used extensively. It made testing safe, and allowed us to save a lot of time, money and research effort. We started by assigning airborne positions for each UAV on the ground. Assuming that the UAVs, are placed randomly on the ground, and that they need to reach a desired aerial formation, we searched for a solution that minimizes the total distance travelled by all the UAVs. We started with a brute-force method, but quickly realized that, given its high complexity, this method performs badly when the number of UAVs grows. Hence, we created a heuristic. As for all heuristics, a trade-off was made between complexity and accuracy. By simplifying the problem, we found that our heuristic was able to calculate a solution very quickly without increasing the total distance travelled substantially. Furthermore, we implemented the \ac{KMA}, an algorithm that has been proven to provide the exact answer (i.e. minimal total distance travelled) in the shortest time possible. After many experiments, we came to the conclusion that our heuristic is faster, but that the solution provided by the \ac{KMA} is slightly better. In particular, although the difference in total distance travelled is small, the \ac{KMA} reduces the numbers of flight paths crossing each other, which is an important metric in our next building block. Once we developed algorithms to assign airborne positions to each UAV on the ground, we started developing algorithms to take off all those UAVs. The objective of these algorithms is to reduce the time it takes for all the UAVs to reach their aerial position, while ensuring that all UAVs maintain a safe distance. The easiest solution is a sequential take-off procedure, but this is also the slowest approach. Hence, we improved it by first proposing a semi-sequential and later a semi-simultaneous take-off procedure. With this semi-simultaneous take-off procedure, we are able to reduce the takeoff time drastically without introducing any risk to the aircraft. [..]Wubben, J. (2023). Distributed management and coordination of UAV swarms based on infrastructureless wireless networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/19888

1-D broadside-radiating leaky-wave antenna based on a numerically synthesized impedance surface

A newly-developed deterministic numerical technique for the automated design of metasurface antennas is applied here for the first time to the design of a 1-D printed Leaky-Wave Antenna (LWA) for broadside radiation. The surface impedance synthesis process does not require any a priori knowledge on the impedance pattern, and starts from a mask constraint on the desired far-field and practical bounds on the unit cell impedance values. The designed reactance surface for broadside radiation exhibits a non conventional patterning; this highlights the merit of using an automated design process for a design well known to be challenging for analytical methods. The antenna is physically implemented with an array of metal strips with varying gap widths and simulation results show very good agreement with the predicted performance

Convergence of Intelligent Data Acquisition and Advanced Computing Systems

This book is a collection of published articles from the Sensors Special Issue on "Convergence of Intelligent Data Acquisition and Advanced Computing Systems". It includes extended versions of the conference contributions from the 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS’2019), Metz, France, as well as external contributions

Beam scanning by liquid-crystal biasing in a modified SIW structure

A fixed-frequency beam-scanning 1D antenna based on Liquid Crystals (LCs) is designed for application in 2D scanning with lateral alignment. The 2D array environment imposes full decoupling of adjacent 1D antennas, which often conflicts with the LC requirement of DC biasing: the proposed design accommodates both. The LC medium is placed inside a Substrate Integrated Waveguide (SIW) modified to work as a Groove Gap Waveguide, with radiating slots etched on the upper broad wall, that radiates as a Leaky-Wave Antenna (LWA). This allows effective application of the DC bias voltage needed for tuning the LCs. At the same time, the RF field remains laterally confined, enabling the possibility to lay several antennas in parallel and achieve 2D beam scanning. The design is validated by simulation employing the actual properties of a commercial LC medium

Recent Advances in Multi Robot Systems

To design a team of robots which is able to perform given tasks is a great concern of many members of robotics community. There are many problems left to be solved in order to have the fully functional robot team. Robotics community is trying hard to solve such problems (navigation, task allocation, communication, adaptation, control, ...). This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field. It is focused on the challenging issues of team architectures, vehicle learning and adaptation, heterogeneous group control and cooperation, task selection, dynamic autonomy, mixed initiative, and human and robot team interaction. The book consists of 16 chapters introducing both basic research and advanced developments. Topics covered include kinematics, dynamic analysis, accuracy, optimization design, modelling, simulation and control of multi robot systems