Efficient path planning algorithms in reach-avoid problems
type: Item
instance of: scholarly article
title: Efficient path planning algorithms in reach-avoid problems
zbMATH Open document ID: 1387.49054
author: Zhengyuan Zhou
author: Jerry Ding
author: Haomiao Huang
author: Ryo Takei
author: Claire Tomlin
published in: Automatica
publication date: 2018-06-14T00:00:00Z
Mathematics Subject Classification ID: 49N75
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 6888459
zbMATH Keywords: reach-avoid games
zbMATH Keywords: fast marching methods
zbMATH Keywords: path planning
MaRDI profile type: Publication
full work available at URL: j.automatica.2017.11.035
OpenAlex ID: W2771197443
cites work: Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
cites work: Q4226167
cites work: Multiplayer Reach-Avoid Games via Pairwise Outcomes
cites work: Q3172532
cites work: Q5638153
cites work: Q3396313
cites work: Semi-Lagrangian schemes for Hamilton-Jacobi equations, discrete representation formulae and Godunov methods
cites work: Lion and Man: The General Case
cites work: Q5638152
cites work: Q5532185
cites work: Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
cites work: Guarding a line segment
cites work: The lion and man problem - revisited
cites work: A Problem of Guarding Line Segment
cites work: Q4265376
cites work: Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
cites work: Online solution of nonlinear two‐player zero‐sum games using synchronous policy iteration
cites work: On the Existence of Solutions to a Differential Game
cites work: Cooperative pursuit with Voronoi partitions
DOI: 10.1016/J.AUTOMATICA.2017.11.035
description: scientific article; zbMATH DE number 6888459