Efficient Trajectory Library Filtering for Quadrotor Flight in Unknown Environments
Abstract
Quadrotor flight in cluttered, unknown environments is challenging due to the limited range of perception sensors, challenging obstacles, and limited onboard computation. In this work, we directly address these challenges by proposing an efficient, reactive planning approach. We introduce the Bitwise Trajectory Elimination (BiTE) algorithm for efficiently filtering out in-collision trajectories from a trajectory library by using bitwise operations. Then, we outline a full receding-horizon planning approach for quadrotor flight in unknown environments demonstrated at up to 50 Hz on an onboard computer. This approach is evaluated extensively in simulation and shown to collision check up to 4896 trajectories in under 20μs, which is the fastest collision checking time for a MAV planner, to the best of the authors' knowledge. Finally, we validate our planner in over 120 minutes of flights in forest-like and urban subterranean environments.
BibTeX
@conference{Viswanathan-2020-127282,author = {Vaibhav K. Viswanathan and Eric Dexheimer and Guanrui Li and Giuseppe Loianno and Michael Kaess and Sebastian Scherer},
title = {Efficient Trajectory Library Filtering for Quadrotor Flight in Unknown Environments},
booktitle = {Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2020},
month = {October},
pages = {2510 - 2517},
}