Corpus ID: 237532686

Back to the Future: Efficient, Time-Consistent Solutions in Reach-Avoid Games

  title={Back to the Future: Efficient, Time-Consistent Solutions in Reach-Avoid Games},
  author={Dennis R. Anthony and David Fridovich-Keil and Jaime F. Fisac},
We study the class of reach-avoid dynamic games in which multiple agents interact noncooperatively, and each wishes to satisfy a distinct target condition while avoiding a failure condition. Reach-avoid games are commonly used to express safety-critical optimal control problems found in mobile robot motion planning. While a wide variety of approaches exist for these motion planning problems, we focus on finding time-consistent solutions, in which planned future motion is still optimal despite… 

Figures from this paper


Reach-avoid problems with time-varying dynamics, targets and constraints
A modified Hamilton-Jacobi-Isaacs equation in the form of a double-obstacle variational inequality is proposed, and it is proved that the zero sublevel set of its viscosity solution characterizes the capture basin for the target under the state constraints.
Efficient Iterative Linear-Quadratic Approximations for Nonlinear Multi-Player General-Sum Differential Games
This work takes inspiration from the iterative linear-quadratic regulator (ILQR), which solves repeated approximations with linear dynamics and quadratic costs, and proposes an algorithm that solves repeated linear- quadratic games.
The Computation of Approximate Generalized Feedback Nash Equilibria
This work proposes a Newton-style method for finding game trajectories which satisfy the necessary conditions, which can then be checked against the sufficiency conditions, and develops a Sequential Linear-Quadratic Game approach, in which a locally approximate LQ game is solved at each iteration.
Newton’s Method and Differential Dynamic Programming for Unconstrained Nonlinear Dynamic Games
This paper shows how to extend a recursive Newton algorithm and differential dynamic programming to the case of full-information non-zero sum dynamic games and shows that the iterates of Newton’s method and DDP are sufficiently close for DDP to inherit the quadratic convergence rate of Newton's method.
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
A new continuous level-set approach for characterizing the optimal times and the backward-reachability sets is given, which leads to a characterization via a Hamilton-Jacobi equation, without assuming any controllability assumption.
Iterated LQR smoothing for locally-optimal feedback control of systems with non-linear dynamics and non-quadratic cost
  • J. V. D. Berg
  • Mathematics, Computer Science
    2014 American Control Conference
  • 2014
The novel concept of LQR smoothing, which analogous to Kalman smoothing consists of both a backward pass and a forward pass, is introduced, and it is shown that the states for which the total-cost function is minimal constitute the minimum-cost trajectory for the linear-quadratic optimal control problem.
Sampling-based algorithms for optimal motion planning
The main contribution of the paper is the introduction of new algorithms, namely, PRM and RRT*, which are provably asymptotically optimal, i.e. such that the cost of the returned solution converges almost surely to the optimum.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces
Real-time robot motion planning using rasterizing computer graphics hardware. In Proc. OY82] C. O'D unlaing and C.K. Yap. A retraction method for planning the motion of a disc. A local approach for
Rapidly-exploring random trees : a new tool for path planning
We introduce the concept of a Rapidly-exploring Random Tree (RRT) as a randomized data structure that is designed for a broad class of path planning problems. While they share many of the bene cial
Differential Games and Representation Formulas for Solutions of Hamilton-Jacobi-Isaacs Equations.
Abstract : Recent work by the authors and others has demonstrated the connections between the dynamic programming approach for two-person, zero-sum differential games and the new notion of viscosity