On determining optimal strategies in pursuit games in the plane

DOI10.1016/S0304-3975(97)00229-6MaRDI QIDQ1269731zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational geometryVoronoi diagramsroboticspursuit games

Mathematics Subject Classification ID

Differential games (aspects of game theory) (91A23) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)

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

Cites work

• scientific article; zbMATH DE number 4149601 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (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?)
• A linear algorithm for computing the visibility polygon from a point
• A linear algorithm for determining the separation of convex polyhedra
• Almost tight upper bounds for lower envelopes in higher dimensions
• Alternation
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Computational geometry in a curved world
• Computing convolutions by reciprocal search
• Computing the extreme distances between two convex polygons
• Continuous alternation: the complexity of pursuit in continuous domains
• Convex hulls of objects bounded by algebraic curves
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Decomposition and intersection of simple splinegons
• Finding the upper envelope of n line segments in O(n log n) time
• Generation of configuration space obstacles: The case of moving algebraic curves
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• On the geodesic Voronoi diagram of point sites in a simple polygon
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Spatial Planning: A Configuration Space Approach

Cited in

(13)

• Guarding a line segment
• On determining optimal strategies in pursuit games in the plane
• scientific article; zbMATH DE number 4179170 (Why is no real title available?)
• A pursuit-evasion game between two identical differential drive robots
• An optimal guidance law for a planar pursuit-evasion game of kind
• A differential pursuit/evasion game of capture between an omnidirectional agent and a differential drive robot, and their winning roles
• Image feedback based optimal control and the value of information in a differential game
• Optimal strategies in a pursuit problem with incomplete information
• scientific article; zbMATH DE number 1099551 (Why is no real title available?)
• An elementary game of pursuit with positions separated by an obstacle
• scientific article; zbMATH DE number 4095257 (Why is no real title available?)
• Optimal strategies in pursuit games with limited maneuverability
• A new class of pursuer strategies for the discrete-time lion and man problem

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)