Cyclic-routing of Unmanned Aerial Vehicles

© 2019 Various missions carried out by Unmanned Aerial Vehicles (UAVs) are concerned with permanent monitoring of a predefined set of ground targets under relative deadline constraints, i.e., the targets have to be revisited ‘indefinitely’ and there is an upper bound on the time between two consecutive successful scans of each target. A solution to the problem is a set of routes—one for each UAV—that jointly satisfy these constraints. Our goal is to find a solution with the least number of UAVs. We show that the decision version of the problem (given k, is there a solution with k UAVs?) is PSPACE-complete. On the practical side, we propose a portfolio approach that combines the strengths of constraint solving and model checking. We present an empirical evaluation of the different solution methods on several hundred randomly generated instances

Advancing the Standards for Unmanned Air System Communications, Navigation and Surveillance

Under NASA program NNA16BD84C, new architectures were identified and developed for supporting reliable and secure Communications, Navigation and Surveillance (CNS) needs for Unmanned Air Systems (UAS) operating in both controlled and uncontrolled airspace. An analysis of architectures for the two categories of airspace and an implementation technology readiness analysis were performed. These studies produced NASA reports that have been made available in the public domain and have been briefed in previous conferences. We now consider how the products of the study are influencing emerging directions in the aviation standards communities. The International Civil Aviation Organization (ICAO) Communications Panel (CP), Working Group I (WG-I) is currently developing a communications network architecture known as the Aeronautical Telecommunications Network with Internet Protocol Services (ATN/IPS). The target use case for this service is secure and reliable Air Traffic Management (ATM) for manned aircraft operating in controlled airspace. However, the work is more and more also considering the emerging class of airspace users known as Remotely Piloted Aircraft Systems (RPAS), which refers to certain UAS classes. In addition, two Special Committees (SCs) in the Radio Technical Commission for Aeronautics (RTCA) are developing Minimum Aviation System Performance Standards (MASPS) and Minimum Operational Performance Standards (MOPS) for UAS. RTCA SC-223 is investigating an Internet Protocol Suite (IPS) and AeroMACS aviation data link for interoperable (INTEROP) UAS communications. Meanwhile, RTCA SC-228 is working to develop Detect And Avoid (DAA) equipment and a Command and Control (C2) Data Link MOPS establishing LBand and C-Band solutions. These RTCA Special Committees along with ICAO CP WG/I are therefore overlapping in terms of the Communication, Navigation and Surveillance (CNS) alternatives they are seeking to provide for an integrated manned- and unmanned air traffic management service as well as remote pilot command and control. This paper presents UAS CNS architecture concepts developed under the NASA program that apply to all three of the aforementioned committees. It discusses the similarities and differences in the problem spaces under consideration in each committee, and considers the application of a common set of CNS alternatives that can be widely applied. As the works of these committees progress, it is clear that the overlap will need to be addressed to ensure a consistent and safe framework for worldwide aviation. In this study, we discuss similarities and differences in the various operational models and show how the CNS architectures developed under the NASA program apply

UAVS FLIGHT ROUTES OPTIMIZATION IN CHANGING WEATHER CONDITIONS – CONSTRAINT PROGRAMMING APPROACH

The problem of delivering goods in a distribution network is considered in which a fleet of Unmanned Aerial Vehicles (UAV) carries out transport operations. The changing weather conditions in which the transport operations take place and the UAVs energy capacity levels influenced by the weather conditions are taken into account as factors that affect the determination of a collision-free route. The goods must be delivered to the customers in a given time window. Establishing the routes are the focus of this study. Solutions maximizing the level of customer satisfaction are focused and the computational experiments presented in the study show the impact of weather conditions on route determination

Decentralized Control of an Energy Constrained Heterogeneous Swarm for Persistent Surveillance

Robot swarms are envisioned in applications such as surveillance, agriculture, search-and-rescue operations, and construction. The decentralized nature of swarm intelligence has three key advantages over traditional multi-robot control algorithms: it is scalable, it is fault tolerant, and it is not susceptible to a single point of failure. These advantages are critical to the task of persistent surveillance - where a number of target locations need to be visited as frequently as possible. Unfortunately, in the real world, the autonomous robots that can be used for persistent surveillance have a limited battery life (or fuel capacity). Thus, they need to abandon their surveillance duties to visit a battery swapping station (or refueling depot) a.k.a. €˜depots€™. This €˜down time€™ reduces the frequency of visitation. This problem can be eliminated if the depots themselves were autonomous vehicles that could meet the (surveillance) robots at some point along their path from one target to another. Thus, the robots would spend less time on the \u27charging\u27 (or refueling) task. In this thesis we present decentralized control algorithms, and their results, for three stages of the persistent surveillance problem. First, we consider the case where the robots have no energy constraints, and use a decentralized approach to allow the robots choose the €˜best€™ target that they should visit next. While the selection process is decentralized, the robots can communicate with all the other robots in the swarm, and let them know which is their chosen target. We then consider the energy constraints of the robots, and slightly modify the algorithm, so that the robots visit a depot before they run out of energy. Lastly, we consider the case where the depots themselves can move, and communicate with the robots to pick a location and time to meet, to be able to swap the empty battery of a robot, with a fresh one. The goal of persistent surveillance is to visit target locations as frequently as possible, and thus, the performance measurement parameter is chosen to be the median frequency of visitation for all target locations. We evaluate the performance of the three algorithms in an extensive set of simulated experiments