This paper introduces a probabilistic risk assessment (PRA) framework for the path planning to quantify the risk of unmanned aircraft systems’ (UAS) operations to the ground over populated areas. The proposed framework is designed to be flexible enough to address multiple concerns and objectives by utilizing the probabilistic risk exposure map (PREM) of the area of operation and UAS failure mode analysis with corresponding impact probability distributions on the ground. PREM is defined to be the risk of exposure of people or property on the ground to the presence of UAS in the air as a function of position, and itis used to model the distribution of risk exposure over the map. In this study, PREM isconstructed for the impact related risk conditions where their distributions are modeled as a mixture of bivariate normal distributions over the discretized map of the area. Along with PREM, UAS failure modes with ground impact distributions are used in the derivation of the risk function to quantify the risk of being hit by the failing UAS platform for bystanders, properties and the traffic on the ground. Then, utilizing the derived risk function as a planning cost function, the path planner algorithm is used to plan a path that minimizes the risk according to the proposed risk assessment framework. As a pathplanner, optimal bidirectional rapidly-exploring random trees (RRT) is selected due to its fast convergence and optimality guarantee. Finally, the results of simulations for different scenarios are compared and discussed in detail.
more »
« less
A Utility-Based Path Planning for Safe UAS Operations with a Task-Level Decision-Making Capability
Unmanned aircraft systems (UAS) are being used more and more every day in almost any area to solve challenging real-life problems. Increased autonomy and advancements in low-cost high-computing technologies made these compact autonomous solutions accessible to any party with ease. However, this ease of use brings its own challenges that need to be addressed. In an autonomous flight scenario over a public space, an autonomous operation plan has to consider the public safety and regulations as well as the task specific objectives. In this work, we propose a generic utility function for the path planning of UAS operations that includes the benefits of accomplishing the goals as well as the safety risks incurred along the flight trajectories, with the purpose of making task-level decisions through the optimization of the carefully constructed utility function for a given scenario. As an optimizer, we benefited from a multi-tree variant of the optimal T-RRT * (Multi-T-RRT * path planning algorithm. To illustrate its operation, results of simulation of a UAS scenario are presented.
more »
« less
- Award ID(s):
- 1724248
- PAR ID:
- 10188673
- Date Published:
- Journal Name:
- 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)
- Page Range / eLocation ID:
- 1227 to 1233
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Safe path planning is critical for bipedal robots to operate in safety-critical environments. Common path planning algorithms, such as RRT or RRT*, typically use geometric or kinematic collision check algorithms to ensure collision-free paths toward the target position. However, such approaches may generate non-smooth paths that do not comply with the dynamics constraints of walking robots. It has been shown that the control barrier function (CBF) can be integrated with RRT/RRT* to synthesize dynamically feasible collision-free paths. Yet, existing work has been limited to simple circular or elliptical shape obstacles due to the challenging nature of constructing appropriate barrier functions to represent irregularly shaped obstacles. In this paper, we present a CBF-based RRT* algorithm for bipedal robots to generate a collision-free path through space with multiple polynomial-shaped obstacles. In particular, we used logistic regression to construct polynomial barrier functions from a grid map of the environment to represent irregularly shaped obstacles. Moreover, we developed a multi-step CBF steering controller to ensure the efficiency of free space exploration. The proposed approach was first validated in simulation for a differential drive model, and then experimentally evaluated with a 3D humanoid robot, Digit, in a lab setting with randomly placed obstacles.more » « less
-
Airspace geofencing is a key capability for low-altitude Unmanned Aircraft System (UAS) Traffic Management (UTM). Geofenced airspace volumes can be allocated to safely contain compatible UAS flight operations within a fly-zone (keep-in geofence) and ensure the avoidance of no-fly zones (keep-out geofences). This paper presents the application of three-dimensional flight volumization algorithms to support airspace geofence management for UTM. Layered polygon geofence volumes enclose user-input waypoint-based 3-D flight trajectories, and a family of flight trajectory solutions designed to avoid keep-out geofence volumes is proposed using computational geometry. Geofencing and path planning solutions are analyzed in an accurately mapped urban environment. Urban map data processing algorithms are presented. Monte Carlo simulations statistically validate our algorithms, and runtime statistics are tabulated. Benchmark evaluation results in a Manhattan, New York City low-altitude environment compare our geofenced dynamic path planning solutions against a fixed airway corridor design. A case study with UAS route deconfliction is presented, illustrating how the proposed geofencing pipeline supports multi-vehicle deconfliction. This paper contributes to the nascent theory and the practice of dynamic airspace geofencing in support of UTM.more » « less
-
Decentralized planning for multi-agent systems, such as fleets of robots in a search-and-rescue operation, is often constrained by limitations on how agents can communicate with each other. One such limitation is the case when agents can communicate with each other only when they are in line-of-sight (LOS). Developing decentralized planning methods that guarantee safety is difficult in this case, as agents that are occluded from each other might not be able to communicate until it’s too late to avoid a safety violation. In this paper, we develop a decentralized planning method that explicitly avoids situations where lack of visibility of other agents would lead to an unsafe situation. Building on top of an existing Rapidly exploring Random Tree (RRT)-based approach, our method guarantees safety at each iteration. Simulation studies show the effectiveness of our method and compare the degradation in performance with respect to a clairvoyant decentralized planning algorithm where agents can communicate despite not being in LOS of each other.more » « less
-
null (Ed.)Robot motion planning is one of the important elements in robotics. In environments full of obstacles, it is always challenging to find a collision-free and dynamically feasible path between the robot's initial configuration and goal configuration. While many motion planning algorithms have been proposed in the past, each of them has its pros and cons. This work presents a benchmark which implements and compares existing planning algorithms on a variety of problems with extensive simulation. Based on that, we also propose a hybrid planning algorithm, RRT*-CFS, that combines the merits of sampling-based planning methods and optimization-based planning methods. The first layer, RRT*, quickly samples a semi-optimal path. The second layer, CFS, performs sequential convex optimization given the reference path from RRT*. The proposed RRT*-CFS has feasibility and convergence guarantees. Simulation results show that RRT*-CFS benefits from the hybrid structure and performs robustly in various scenarios including the narrow passage problems.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/SMC.2019.8914226
