On determining optimal strategies in pursuit games in the plane

DOI10.1007/3-540-60084-1_100zbMath1412.68280OpenAlexW1499934865MaRDI QIDQ4645204

Ngoc-Minh Lê

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_100

zbMATH Keywords

convex polygondifferential gameVoronoi diagramalgebraic curvesimple polygon

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24) Artificial intelligence for robotics (68T40)

Related Items (1)

On non-smooth convex distance functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Continuous alternation: the complexity of pursuit in continuous domains
• Convex hulls of objects bounded by algebraic curves
• Computational geometry in a curved world
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Computing convolutions by reciprocal search
• Decomposition and intersection of simple splinegons
• Generation of configuration space obstacles: The case of moving algebraic curves
• Spatial Planning: A Configuration Space Approach

This page was built for publication: On determining optimal strategies in pursuit games in the plane