On determining optimal strategies in pursuit games in the plane
From MaRDI portal
Publication:1269731
DOI10.1016/S0304-3975(97)00229-6zbMATH Open0911.90376OpenAlexW2027960530MaRDI QIDQ1269731FDOQ1269731
Authors: Ngoc-Minh Lê 
Publication date: 28 October 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00229-6
Recommendations
- On determining optimal strategies in pursuit games in the plane
- Optimal strategies in pursuit games with limited maneuverability
- scientific article; zbMATH DE number 1099551
- Primary strategies of simple pursuit in differential games on two-sided plane figures
- On a game of optimal pursuit of an object by two others
- An optimal guidance law for a planar pursuit-evasion game of kind
- scientific article; zbMATH DE number 3943595
- Stochastic pursuit-evasion differential games in the plane
- scientific article; zbMATH DE number 2097250
- scientific article; zbMATH DE number 1148316
Differential games (aspects of game theory) (91A23) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algorithm for determining the separation of convex polyhedra
- Alternation
- Title not available (Why is that?)
- Finding the upper envelope of n line segments in O(n log n) time
- Almost tight upper bounds for lower envelopes in higher dimensions
- Spatial Planning: A Configuration Space Approach
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Decomposition and intersection of simple splinegons
- Computational geometry in a curved world
- A linear algorithm for computing the visibility polygon from a point
- Computing the extreme distances between two convex polygons
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- DETERMINING THE SEPARATION OF SIMPLE POLYGONS
- Generation of configuration space obstacles: The case of moving algebraic curves
- Title not available (Why is that?)
- Continuous alternation: the complexity of pursuit in continuous domains
- Convex hulls of objects bounded by algebraic curves
- Computing convolutions by reciprocal search
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
Cited In (13)
- A new class of pursuer strategies for the discrete-time lion and man problem
- A differential pursuit/evasion game of capture between an omnidirectional agent and a differential drive robot, and their winning roles
- Title not available (Why is that?)
- On determining optimal strategies in pursuit games in the plane
- Guarding a line segment
- Optimal strategies in a pursuit problem with incomplete information
- A pursuit-evasion game between two identical differential drive robots
- An optimal guidance law for a planar pursuit-evasion game of kind
- Title not available (Why is that?)
- Optimal strategies in pursuit games with limited maneuverability
- Image feedback based optimal control and the value of information in a differential game
- An elementary game of pursuit with positions separated by an obstacle
- Title not available (Why is that?)
This page was built for publication: On determining optimal strategies in pursuit games in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269731)
