Michael Watterson

High speed navigation for quadrotors with limited onboard sensing

We address the problem of high speed autonomous navigation of quadrotor micro aerial vehicles with limited onboard sensing and computation. In particular, we propose a dual range planning horizon method to safely and quickly navigate quadrotors to specified goal locations in previously unknown and unstructured environments. In each planning epoch, a short-range planner uses a local map to generate a new trajectory. At the same time, a safe stopping policy is found. This allows the robot to come to an emergency halt when necessary. Our algorithm guarantees collision avoidance and demonstrates important advances in real-time planning. First, our novel short range planning method allows us to generate and re-plan trajectories that are dynamically feasible, comply with state and input constraints, and avoid obstacles in real-time. Further, previous planning algorithms abstract away the obstacle detection problem by assuming the instantaneous availability of geometric information about the environment. In contrast, our method addresses the challenge of using the raw sensor data to form a map and navigate in real-time. Finally, in addition to simulation examples, we provide physical experiments that demonstrate the entire algorithmic pipeline from obstacle detection to trajectory execution.

Visual inertial odometry for quadrotors on SE(3)

The combination of on-board sensors measurements with different statistical characteristics can be employed in robotics for localization and control, especially in GPS-denied environments. In particular, most aerial vehicles are packaged with low cost sensors, important for aerial robotics, such as camera, a gyroscope, and an accelerometer. In this work, we develop a visual inertial odometry system based on the Unscented Kalman Filter (UKF) acting on the Lie group SE(3), such to obtain an unique, singularity-free representation of a rigid body pose. We model this pose with the Lie group SE(3) and model the noise on the corresponding Lie algebra. Moreover, we extend the concepts used in the standard UKF formulation, such as state uncertainty and modeling, to correctly incorporate elements that do not belong to an Euclidean space such as the Lie group members. In this analysis, we use the parallel transport, which requires us to explicitly consider SE(3) as representing rigid bodies though the use of the affine connection. We present experimental results to show the effectiveness of the proposed approach for state estimation of a quadrotor platform.

Safe receding horizon control for aggressive MAV flight with limited range sensing

Micro Aerial Vehicles (MAVs) are becoming ubiquitous, but most experiments and demonstrations have been limited to slow flight except in open environments or in laboratories with motion capture systems. In this paper, we develop representations and algorithms for aggressive flight in cluttered environments. We incorporate the specific dynamics of the system and generate safe, feasible trajectories for fast navigation in real time. Specifically, we use a polyhedral decomposition of the visible free space and address the generation of safe trajectories that are within the space. Because of the limited field of view, we adopt a receding horizon control policy (RHCP) for planning over a finite time horizon, but with the guarantee that there exists a safe stopping control policy over a second time horizon from the planned state at the end of the horizon. Thus, the robot planning occurs over two horizons. While the robot executes the planned trajectory over the first time horizon, the map of obstacles is refreshed allowing the planner to generate a refined plan, once again over two time horizons. The key algorithmic contribution of the paper lies in the fast planning algorithm that is able to incorporate robot dynamics while guaranteeing safety. The algorithm is also optimal in the sense that the receding horizon control policy is based on minimizing the trajectory snap. Central to the algorithm is a novel polyhedral representation that allows us to abstract the trajectory planning problem as a problem of finding a path through a sequence of convex regions in configuration space.

Planning Dynamically Feasible Trajectories for Quadrotors Using Safe Flight Corridors in 3-D Complex Environments

There is extensive literature on using convex optimization to derive piece-wise polynomial trajectories for controlling differential flat systems with applications to three-dimensional flight for Micro Aerial Vehicles. In this work, we propose a method to formulate trajectory generation as a quadratic program (QP) using the concept of a Safe Flight Corridor (SFC). The SFC is a collection of convex overlapping polyhedra that models free space and provides a connected path from the robot to the goal position. We derive an efficient convex decomposition method that builds the SFC from a piece-wise linear skeleton obtained using a fast graph search technique. The SFC provides a set of linear inequality constraints in the QP allowing real-time motion planning. Because the range and field of view of the robots sensors are limited, we develop a framework of Receding Horizon Planning , which plans trajectories within a finite footprint in the local map, continuously updating the trajectory through a re-planning process. The re-planning process takes between 50 to 300 ms for a large and cluttered map. We show the feasibility of our approach, its completeness and performance, with applications to high-speed flight in both simulated and physical experiments using quadrotors.

Fast, Autonomous Flight in GPS-Denied and Cluttered Environments

One of the most challenging tasks for a flying robot is to autonomously navigate between target locations quickly and reliably while avoiding obstacles in its path, and with little to no a-priori knowledge of the operating environment. This challenge is addressed in the present paper. We describe the system design and software architecture of our proposed solution, and showcase how all the distinct components can be integrated to enable smooth robot operation. We provide critical insight on hardware and software component selection and development, and present results from extensive experimental testing in real-world warehouse environments. Experimental testing reveals that our proposed solution can deliver fast and robust aerial robot autonomous navigation in cluttered, GPS-denied environments.

Smooth trajectory generation on SE(3) for a free flying space robot

We propose a new optimal trajectory generation technique on SE(3) which avoids known obstacles. We leverage techniques from differential geometry and Lie algebra to formulate a cost functional which is intrinsic to the geometric structure of this space and makes physical sense. We propose an approximation technique to generate trajectories on the subgroup SO(3) and use Semidefinite Programming (SDP) to approximate an NP-Hard problem with one which is tractable to compute. From this trajectory on the subgroup, the trajectory generation on the other dimensions of the group becomes a Quadratic Program (QP). For obstacle avoidance, we use a computational geometric technique to decompose the environment into overlapping convex regions to confine the trajectory. We show how this motion planning technique can be used to generate feasible trajectories for a space robot in SE(3) and describe controllers that enable the execution of the generated trajectory. We compare our method to other geometric techniques for calculating trajectories on SO(3) and SE(3), but in an obstacle-free environment.