Simultaneous orthogonal collocation decomposition method for extended \textit{Lion and Man} problems
From MaRDI portal
Publication:2218878
Recommendations
Cites work
- A cooperative homicidal Chauffeur game
- A differential game related to terrorism: Nash and Stackelberg strategies
- Complex differential games of pursuit-evasion type with state constraints. II: Numerical computation of optimal open-loop strategies
- scientific article; zbMATH DE number 706270 (Why is no real title available?)
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- scientific article; zbMATH DE number 1507318 (Why is no real title available?)
- scientific article; zbMATH DE number 3245077 (Why is no real title available?)
- scientific article; zbMATH DE number 3365084 (Why is no real title available?)
- scientific article; zbMATH DE number 3080510 (Why is no real title available?)
- Incremental sampling-based algorithms for a class of pursuit-evasion games
- Lion and Man: The Boundary Constraint
- Lion and Man: The General Case
- Nonlinear Programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
- Relay pursuit of a maneuvering target using dynamic Voronoi diagrams
- Some Results on Max-Min Pursuit
- The lion and man problem - revisited
- The Robot and the Rabbit--A Pursuit Problem
- To pursue or to evade - That is the question
- Two-target pursuit-evasion differential games in the plane
- “Lion and Man”: A Postscript
This page was built for publication: Simultaneous orthogonal collocation decomposition method for extended \textit{Lion and Man} problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218878)