SearcharxivSearch

arXiv subjects

Andreas Willig

Publications and source records attributed to Andreas Willig.

5 recordsLinked to original sources

A Time-efficient Prioritised Scheduling Algorithm to Optimise Initial Flock Formation of Drones

Drone applications continue to expand across various domains, with flocking offering enhanced cooperative capabilities but introducing significant challenges during initial formation. Existing flocking algorithms often struggle with efficiency and scalability, particularly when potential collisions force drones into suboptimal trajectories. This paper presents a time-efficient prioritised scheduling algorithm that improves the initial formation process of drone flocks. The method assigns each drone a priority based on its number of potential collisions and its likelihood of reaching its target position without permanently obstructing other drones. Using this hierarchy, each drone computes an appropriate delay to ensure a collision-free path. Simulation results show that the proposed algorithm successfully generates collision-free trajectories for flocks of up to 5000 drones and outperforms the coupling-degree-based heuristic prioritised planning method (CDH-PP) in both performance and computational efficiency.

cs.RO

Distributed Self-allocated Time Slot Reuse: Multi-hop Communication in Rigid UAV Formations

Deployment of Unmanned Aerial Vehicles (UAVs) in autonomous formations necessitates accurate and timely communication of safety information. A communication protocol that supports timely and successful transfer of safety information between UAVs is therefore needed. This paper presents Distributed Self-allocated Time slot Reuse (D-STR). Our D-STR protocol addresses the essential task of communicating safety information in rigid Unmanned Aerial Vehicle (UAV) formations with different network topologies, enabling collision-free deployment of the formation. This is an important step for improving the safety and practicality of UAV formations in application scenarios that span a range of industries.

cs.NI

Short-Term Guidance Algorithm on a Drone Road System

Unmanned Aerial Vehicles (UAVs), commonly known as drones, have experienced expanding use in urban environments in recent years. However, the growing density of drones raises significant challenges, such as avoiding collisions and managing air traffic efficiently, especially in congested areas. To address these issues, a structured road system and an effective guidance algorithm are essential. In this paper, we introduce a markup language allowing to describe drone road systems (DRS), in which a road system is given by a set of individual roads, each of which can have a varying number of lanes. Roads can be linked through connecting lanes. Furthermore, we propose a novel short-term decentralized greedy (STDG) guidance algorithm that uses only the position and speed information of nearby drones -- communicated via periodically transmitted beacons -- to make real-time decisions such as stopping, changing lanes, or adjusting speed for the next few seconds. Unlike existing methods that rely on centralized coordination, our algorithm enables drones to operate independently while ensuring safety and efficiency. We present simulation results showing the impact of key wireless and algorithm parameters on performance metrics like the drone collision rate, average speed and throughput of the drone road system.

cs.NI

DCP and VarDis: An Ad-Hoc Protocol Stack for Dynamic Swarms and Formations of Drones -- Extended Version

Recently, swarms or formations of drones have received increased interest both in the literature and in applications. To dynamically adapt to their operating environment, swarm members need to communicate wirelessly for control and coordination tasks. One fundamental communication pattern required for basic safety purposes, such as collision avoidance, is beaconing, where drones frequently transmit information about their position, speed, heading, and other operational data to a local neighbourhood, using a local broadcast service. In this paper, we propose and analyse a protocol stack which allows to use the recurring-beaconing primitive for additional purposes. In particular, we propose the VarDis (Variable Dissemination) protocol, which creates the abstraction of variables to which all members of a drone swarm have (read) access, and which can naturally be used for centralized control of a swarm, amongst other applications. We describe the involved protocols and provide a mainly simulation-based performance analysis of VarDis.

cs.NI

Reliability Analysis of Monitoring System for Extraterrestrial Habitat using CTMC and Empirical Evaluation

Among the various required resources for this civilization, the habitat is one of the crucial resources to live on Mars. Such an extraterrestrial habitat is designed to provide a safe place to live during the initial missions. It is equipped with monitoring and life support systems to ensure the astronauts' safety. In this work, we present a robust monitoring system with a use case for extraterrestrial habitats. Similar to a typical monitoring system, it consists of sensor nodes and a gateway connected through a wireless communication channel. In our system, we introduce robustness to various failures that can occur after deployment, namely, board, sensor and gateway failure, in the form of redundancy. For each failure, the problem is tackled differently. For the first two types, we use additional hardware as backup, while for the last type, we use neighbouring devices as backups. The backup devices function as replacements for the failed component, which helps the system to collect the data which would otherwise be lost. We evaluate how much the performance of the system improves by using backup devices. We use a Continuous-Time Markov chain for the theoretical evaluation and an experimental setup that includes the hardware prototype for the empirical evaluation. We also analyze the effect of a simple medium access mechanism on the system's performance in the presence of heavy noise on the channel. Based on our requirements, we use a simple custom medium access control (MAC) algorithm called Slotted-ALOHA with Random Back-off (SARB) to make communication reliable. We demonstrate that around $30-34\%$ of the packets are recovered, with the use of backup devices (redundancy), which would otherwise be lost in case of failures. We also demonstrate that the system's performance improves by $3.8-13.2\%$ with the use of a simple medium access technique (SARB).

eess.SY