772 research outputs found
Deep Drone Racing: From Simulation to Reality with Domain Randomization
Dynamically changing environments, unreliable state estimation, and operation
under severe resource constraints are fundamental challenges that limit the
deployment of small autonomous drones. We address these challenges in the
context of autonomous, vision-based drone racing in dynamic environments. A
racing drone must traverse a track with possibly moving gates at high speed. We
enable this functionality by combining the performance of a state-of-the-art
planning and control system with the perceptual awareness of a convolutional
neural network (CNN). The resulting modular system is both platform- and
domain-independent: it is trained in simulation and deployed on a physical
quadrotor without any fine-tuning. The abundance of simulated data, generated
via domain randomization, makes our system robust to changes of illumination
and gate appearance. To the best of our knowledge, our approach is the first to
demonstrate zero-shot sim-to-real transfer on the task of agile drone flight.
We extensively test the precision and robustness of our system, both in
simulation and on a physical platform, and show significant improvements over
the state of the art.Comment: Accepted as a Regular Paper to the IEEE Transactions on Robotics
Journal. arXiv admin note: substantial text overlap with arXiv:1806.0854
Towards parallelizable sampling-based Nonlinear Model Predictive Control
This paper proposes a new sampling-based nonlinear model predictive control
(MPC) algorithm, with a bound on complexity quadratic in the prediction horizon
N and linear in the number of samples. The idea of the proposed algorithm is to
use the sequence of predicted inputs from the previous time step as a warm
start, and to iteratively update this sequence by changing its elements one by
one, starting from the last predicted input and ending with the first predicted
input. This strategy, which resembles the dynamic programming principle, allows
for parallelization up to a certain level and yields a suboptimal nonlinear MPC
algorithm with guaranteed recursive feasibility, stability and improved cost
function at every iteration, which is suitable for real-time implementation.
The complexity of the algorithm per each time step in the prediction horizon
depends only on the horizon, the number of samples and parallel threads, and it
is independent of the measured system state. Comparisons with the fmincon
nonlinear optimization solver on benchmark examples indicate that as the
simulation time progresses, the proposed algorithm converges rapidly to the
"optimal" solution, even when using a small number of samples.Comment: 9 pages, 9 pictures, submitted to IFAC World Congress 201
Conflict-Based Model Predictive Control for Scalable Multi-Robot Motion Planning
This paper presents a scalable multi-robot motion planning algorithm called
Conflict-Based Model Predictive Control (CB-MPC). Inspired by Conflict-Based
Search (CBS), the planner leverages a similar high-level conflict tree to
efficiently resolve robot-robot conflicts in the continuous space, while
reasoning about each agent's kinematic and dynamic constraints and actuation
limits using MPC as the low-level planner. We show that tracking high-level
multi-robot plans with a vanilla MPC controller is insufficient, and results in
unexpected collisions in tight navigation scenarios. Compared to other
variations of multi-robot MPC like joint, prioritized, and distributed, we
demonstrate that CB-MPC improves the executability and success rate, allows for
closer robot-robot interactions, and reduces the computational cost
significantly without compromising the solution quality across a variety of
environments. Furthermore, we show that CB-MPC combined with a high-level path
planner can effectively substitute computationally expensive full-horizon
multi-robot kinodynamic planners
- …