Adversarial Attacks on Optimization based Planners

  title={Adversarial Attacks on Optimization based Planners},
  author={Sai Vemprala and Ashish Kapoor},
  journal={2021 IEEE International Conference on Robotics and Automation (ICRA)},
  • Sai VempralaAshish Kapoor
  • Published 30 October 2020
  • Computer Science
  • 2021 IEEE International Conference on Robotics and Automation (ICRA)
Trajectory planning is a key piece in the algorithmic architecture of a robot. Trajectory planners typically use iterative optimization schemes for generating smooth trajectories that avoid collisions and are optimal for tracking given the robot’s physical specifications. Starting from an initial estimate, the planners iteratively refine the solution so as to satisfy the desired constraints. In this paper, we show that such iterative optimization based planners can be vulnerable to adversarial… 

Figures and Tables from this paper

Learning-based attacks in Cyber-Physical Systems: Exploration, Detection, and Control Cost trade-offs

The problem of learning-based attacks in linear systems, where the communication channel between the controller and the plant can be hijacked by a malicious attacker, is studied and a probabilistic lower bound on the time that must be spent by the attacker learning the system is shown.

Generating Useful Accident-Prone Driving Scenarios via a Learned Traffic Prior

This work introduces STRIVE, a method to automatically generate challenging scenarios that cause a given planner to produce undesirable behavior, like collisions, in the form of a graph-based conditional VAE.

Towards Resilient Artificial Intelligence: Survey and Research Issues

An overview of the emerging field of resilient AI is provided and research issues the authors identify as potential future work are presented.



Funnel libraries for real-time robust feedback motion planning

By explicitly taking into account the effect of uncertainty, the robot can evaluate motion plans based on how vulnerable they are to disturbances, and constitute one of the first examples of provably safe and robust control for robotic systems with complex nonlinear dynamics that need to plan in real time in environments with complex geometric constraints.

Fast Safe Mission Plans for Autonomous Vehicles

This work proposes a novel combination of sampling-based motion planning with safe control synthesis methods for generating safe high-level plans in real-time for guaranteeing safety in the real-world deployment of robots and autonomous cyber-physical systems.

FASTER: Fast and Safe Trajectory Planner for Flights in Unknown Environments

FASTER (Fast and Safe Trajectory Planner) obtains high-speed trajectories by enabling the local planner to optimize in both the free-known and unknown spaces by way of a Mixed Integer Quadratic Program formulation.

Safe Local Exploration for Replanning in Cluttered Unknown Environments for Microaerial Vehicles

This work presents a conservative trajectory-optimization-based local planner, coupled with a local exploration strategy that selects intermediate goals that performs better than the standard approach of using an optimistic global planner and also outperforms doing a single exploration step when the local planner is stuck.

CHOMP: Gradient optimization techniques for efficient motion planning

This paper presents CHOMP, a novel method for continuous path refinement that uses covariant gradient techniques to improve the quality of sampled trajectories and relax the collision-free feasibility prerequisite on input paths required by those strategies.

An Efficient Reachability-Based Framework for Provably Safe Autonomous Navigation in Unknown Environments

This work proposes a novel, real-time safety analysis method based on Hamilton-Jacobi reachability that provides strong safety guarantees despite the unknown parts of the environment and demonstrates the approach in simulation and in hardware to provide safety guarantees around a state-of-the-art vision-based, learning-based planner.

Provably safe robot navigation with obstacle uncertainty

This work presents efficient algorithms that use shadows to prove that trajectories or policies are safe with much tighter bounds than in previous work, and designs a safe variant of the rapidly exploring random tree (RRT) planning algorithm.

Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments

This work presents a method of jointly optimizing polynomial path segments in an unconstrained quadratic program that is numerically stable for high-order polynomials and large numbers of segments, and is easily formulated for efficient sparse computation.

FaSTrack: A modular framework for fast and guaranteed safe motion planning

A path or trajectory planner using simplified dynamics to plan quickly can be incorporated into the FaSTrack framework, which provides a safety controller for the vehicle along with a guaranteed tracking error bound.

STOMP: Stochastic trajectory optimization for motion planning

It is experimentally show that the stochastic nature of STOMP allows it to overcome local minima that gradient-based methods like CHOMP can get stuck in.