A Scalable Low-Cost-UAV Traffic Network (uNet)

This article proposes a new Unmanned Aerial Vehicle (UAV) operation paradigm to enable a large number of relatively low-cost UAVs to fly beyond-line-of-sight without costly sensing and communication systems or substantial human intervention in individual UAV control. Under current free-flight-like paradigm, wherein a UAV can travel along any route as long as it avoids restricted airspace and altitudes. However, this requires expensive on-board sensing and communication as well as substantial human effort in order to ensure avoidance of obstacles and collisions. The increased cost serves as an impediment to the emergence and development of broader UAV applications. The main contribution of this work is to propose the use of pre-established route network for UAV traffic management, which allows: (i) pre- mapping of obstacles along the route network to reduce the onboard sensing requirements and the associated costs for avoiding such obstacles; and (ii) use of well-developed routing algorithms to select UAV schedules that avoid conflicts. Available GPS-based navigation can be used to fly the UAV along the selected route and time schedule with relatively low added cost, which therefore, reduces the barrier to entry into new UAV-applications market. Finally, this article proposes a new decoupling scheme for conflict-free transitions between edges of the route network at each node of the route network to reduce potential conflicts between UAVs and ensuing delays. A simulation example is used to illustrate the proposed uNet approach.Comment: To be submitted to journal, 21 pages, 9 figure

UAV as a Reliable Wingman: A Flight Demonstration

In this brief, we present the results from a flight experiment demonstrating two significant advances in software enabled control: optimization-based control using real-time trajectory generation and logical programming environments for formal analysis of control software. Our demonstration platform consisted of a human-piloted F-15 jet flying together with an autonomous T-33 jet. We describe the behavior of the system in two scenarios. In the first, nominal state communications were present and the autonomous aircraft maintained formation as the human pilot flew maneuvers. In the second, we imposed the loss of high-rate communications and demonstrated an autonomous safe “lost wingman” procedure to increase separation and reacquire contact. The flight demonstration included both a nominal formation flight component and an execution of the lost wingman scenario

Safety Barrier Certificates for Heterogeneous Multi-Robot Systems

This paper presents a formal framework for collision avoidance in multi-robot systems, wherein an existing controller is modified in a minimally invasive fashion to ensure safety. We build this framework through the use of control barrier functions (CBFs) which guarantee forward invariance of a safe set; these yield safety barrier certificates in the context of heterogeneous robot dynamics subject to acceleration bounds. Moreover, safety barrier certificates are extended to a distributed control framework, wherein neighboring agent dynamics are unknown, through local parameter identification. The end result is an optimization-based controller that formally guarantees collision free behavior in heterogeneous multi-agent systems by minimally modifying the desired controller via safety barrier constraints. This formal result is verified in simulation on a multi-robot system consisting of both cumbersome and agile robots, is demonstrated experimentally on a system with a Magellan Pro robot and three Khepera III robots.Comment: 8 pages version of 2016ACC conference paper, experimental results adde

Multi-objective Compositions for Collision-Free Connectivity Maintenance in Teams of Mobile Robots

Compositional barrier functions are proposed in this paper to systematically compose multiple objectives for teams of mobile robots. The objectives are first encoded as barrier functions, and then composed using AND and OR logical operators. The advantage of this approach is that compositional barrier functions can provably guarantee the simultaneous satisfaction of all composed objectives. The compositional barrier functions are applied to the example of ensuring collision avoidance and static/dynamical graph connectivity of teams of mobile robots. The resulting composite safety and connectivity barrier certificates are verified experimentally on a team of four mobile robots.Comment: To appear in 55th IEEE Conference on Decision and Control, December 12-14, 2016, Las Vegas, NV, US

Verification of an Autonomous Reliable Wingman using CCL

We present a system of two aircraft, one human-piloted and one autonomous, that must coordinate to achieve tasks. The vehicles communicate over two data channels, one high rate link for state data transfer and one low rate link for command messages. We analyze the operation of the system when the high rate link fails and the aircraft must use the low rate link to execute a safe "lost wingman" procedure to increase separation and re-acquire contact. In particular, the protocol is encoded in CCL, the Computation and Control Language, and analyzed using temporal logic. A portion of the verified code is then used to command the unmanned aircraft, while on the human-piloted craft the protocol takes the form of detailed flight procedures. An overview of the implementation for a June, 2004 flight test is also presented

On Provably Safe and Live Multirobot Coordination With Online Goal Posting

A standing challenge in multirobot systems is to realize safe and efficient motion planning and coordination methods that are capable of accounting for uncertainties and contingencies. The challenge is rendered harder by the fact that robots may be heterogeneous and that their plans may be posted asynchronously. Most existing approaches require constraints on the infrastructure or unrealistic assumptions on robot models. In this article, we propose a centralized, loosely-coupled supervisory controller that overcomes these limitations. The approach responds to newly posed constraints and uncertainties during trajectory execution, ensuring at all times that planned robot trajectories remain kinodynamically feasible, that the fleet is in a safe state, and that there are no deadlocks or livelocks. This is achieved without the need for hand-coded rules, fixed robot priorities, or environment modification. We formally state all relevant properties of robot behavior in the most general terms possible, without assuming particular robot models or environments, and provide both formal and empirical proof that the proposed fleet control algorithms guarantee safety and liveness