Batch Informed Trees (BIT*)

Path planning through complex obstacle spaces is a fundamental requirement of many mobile robot applications. Recently a rapid convergence path planning algorithm, Batch Informed Trees (BIT*), was introduced. This work serves as a concise write-up and explanation of BIT*. This work includes a description of BIT* and how BIT* operates, a graphical demonstration of BIT*, and simulation results where BIT* is compared to Optimal Rapidly-exploring Random Trees (RRT*).

Fillet-based RRT*: A Rapid Convergence Implementation of RRT* for Curvature Constrained Vehicles

Rapidly exploring random trees (RRTs) have proven effective in quickly finding feasible solutions to complex motion planning problems. RRT* is an extension of the RRT algorithm that provides probabilistic asymptotic optimality guarantees when using straight-line motion primitives. This work provides extensions to RRT and RRT* that employ fillets as motion primitives, allowing path curvature constraints to be considered when planning. Two fillets are developed, an arc-based fillet that uses circular arcs to generate paths that respect maximum curvature constraints and a spline-based fillet that uses Bezier curves to additionally respect curvature continuity requirements. Planning with these fillets is shown to far exceed the performance of RRT* using Dubin's path motion primitives, approaching the performance of planning with straight-line path primitives. Path sampling heuristics are also introduced to accelerate convergence for nonholonomic motion planning. Comparisons to established RRT* approaches are made using the Open Motion Planning Library (OMPL).

A Closed-Loop Linear Covariance Framework for Vehicle Path Planning in an Uncertain Obstacle Field

Path planning in uncertain environments is a key enabler of true vehicle autonomy. Over the past two decades, numerous approaches have been developed to account for errors in the vehicle path while navigating complex and often uncertain environments. An important capability of such planning is the prediction of vehicle dispersion covariances about candidate paths. This work develops a new closed-loop linear covariance (CL-LinCov) framework applicable to wide range of autonomous system architectures. Extensions to current CL-LinCov frameworks are made to accommodate 1) the cascaded architecture typical of autonomous vehicles and 2) the dual-use of continuous sensor information for both navigation and control. The closed-loop nature of the framework preserves the important coupling between the system dynamics, exogenous disturbances, and the guidance, navigation, and control algorithms. The developed framework is applied to a simplified model of an unmanned aerial vehicle and validated by comparison via Monte Carlo analysis. The utility of the CL-LinCov information is illustrated by its application to path planning in an uncertain obstacle field via a modified version of the rapidly exploring random tree algorithm.

Zero-Error Tracking for Autonomous Vehicles through Epsilon-Trajectory Generation

This paper presents a control method and trajectory planner for vehicles with first-order nonholonomic constraints that guarantee asymptotic convergence to a time-indexed trajectory. To overcome the nonholonomic constraint, a fixed point in front of the vehicle can be controlled to track a desired trajectory, albeit with a steady-state error. To eliminate steady state error, a sufficiently smooth trajectory is reformulated for the new reference point such that, when tracking the new trajectory, the vehicle asymptotically converges to the original trajectory. The resulting zero-error tracking law is demonstrated through a novel framework for creating time-indexed Clothoids. The Clothoids can be planned to pass through arbitrary waypoints using traditional methods yet result in trajectories that can be followed with zero steady-state error. The results of the control method and planner are illustrated in simulation wherein zero-error tracking is demonstrated.