Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Pursuit Winning Strategies for Reach-Avoid Games with Polygonal Obstacles (2403.06202v2)

Published 10 Mar 2024 in eess.SY, cs.GT, and cs.SY

Abstract: This paper studies a multiplayer reach-avoid differential game in the presence of general polygonal obstacles that block the players' motions. The pursuers cooperate to protect a convex region from the evaders who try to reach the region. We propose a multiplayer onsite and close-to-goal (MOCG) pursuit strategy that can tell and achieve an increasing lower bound on the number of guaranteed defeated evaders. This pursuit strategy fuses the subgame outcomes for multiple pursuers against one evader with hierarchical optimal task allocation in the receding-horizon manner. To determine the qualitative subgame outcomes that who is the game winner, we construct three pursuit winning regions and strategies under which the pursuers guarantee to win against the evader, regardless of the unknown evader strategy. First, we utilize the expanded Apollonius circles and propose the onsite pursuit winning that achieves the capture in finite time. Second, we introduce convex goal-covering polygons (GCPs) and propose the close-to-goal pursuit winning for the pursuers whose visibility region contains the whole protected region, and the goal-visible property will be preserved afterwards. Third, we employ Euclidean shortest paths (ESPs) and construct a pursuit winning region and strategy for the non-goal-visible pursuers, where the pursuers are firstly steered to positions with goal visibility along ESPs. In each horizon, the hierarchical optimal task allocation maximizes the number of defeated evaders and consists of four sequential matchings: capture, enhanced, non-dominated and closest matchings. Numerical examples are presented to illustrate the results.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. Back to the future: Efficient, time-consistent solutions in reach-avoid games. In 2022 International Conference on Robotics and Automation (ICRA), pages 6830–6836, 2022.
  2. Perimeter defense using a turret with finite range and startup time. In 2023 American Control Conference (ACC), pages 3350–3355, 2023.
  3. T. Başar and G. J. Olsder. Dynamic Noncooperative Game Theory. 2 edition, 1999.
  4. P. Cardaliaguet. A differential game with two players and one target. SIAM Journal on Control and Optimization, 34(4):1441–1460, 1996.
  5. Decomposition of reachable sets and tubes for a class of nonlinear systems. IEEE Transactions on Automatic Control, 63(11):3675–3688, 2018.
  6. Multiplayer reach-avoid games via pairwise outcomes. IEEE Transactions on Automatic Control, 62(3):1451–1457, 2017.
  7. X. Chen and J. Yu. Reach-avoid games with two heterogeneous defenders and one attacker. IET Control Theory & Applications, 16(3):301–317, 2022.
  8. V. S. Chipade and D. Panagou. Multiagent planning and control for swarm herding in 2-D obstacle environments under bounded inputs. IEEE Transactions on Robotics, 37(6):1956–1972, 2021.
  9. One Apollonius circle is enough for many pursuit-evasion games. Automatica, 163:111587, 2024.
  10. Flows in networks, volume 56. Princeton university press, 2015.
  11. H. Fu and H. H-T Liu. Justification of the geometric solution of a target defense game with faster defenders and a convex target area using the HJI equation. Automatica, 149:110811, 2023.
  12. Optimal strategies for a class of multi-player reach-avoid differential games in 3D space. IEEE Robotics and Automation Letters, 5(3):4257–4264, 2020.
  13. Multiple pursuer multiple evader differential games. IEEE Transactions on Automatic Control, 66(5):2345–2350, 2020.
  14. W. M. Getz and M. Pachter. Two-target pursuit-evasion differential games in the plane. Journal of Optimization Theory and Applications, 34(3):383–403, 1981.
  15. S. Y. Hayoun and T. Shima. On guaranteeing point capture in linear n-on-1 endgame interception engagements with bounded controls. Automatica, 85:122–128, 2017.
  16. J. Hershberger and S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM Journal on Computing, 28(6):2215–2256, 1999.
  17. R. Isaacs. Differential Games. New York: Wiley, 1965.
  18. Safety-aware pursuit-evasion games in unknown environments using Gaussian processes and finite-time convergent reinforcement learning. IEEE Transactions on Neural Networks and Learning Systems, pages 1–14, 2022.
  19. Graph neural networks for decentralized multi-agent perimeter defense. Frontiers in Control Engineering, 4:1104745, 2023.
  20. Y. Lee and E. Bakolas. Two-player reconnaissance game with half-planar target and retreat regions. In 2023 American Control Conference (ACC), pages 3344–3349, 2023.
  21. Intelligent physical attack against mobile robots with obstacle-avoidance. IEEE Transactions on Robotics, 39(1):253–272, 2022.
  22. Analysis of role switch for cooperative target defense differential game. IEEE Transactions on Automatic Control, 66(2):902–909, 2021.
  23. A visibility-based pursuit-evasion game between two nonholonomic robots in environments with obstacles. Autonomous Robots, 46(2):349–371, 2022.
  24. K. Margellos and J. Lygeros. Hamilton–Jacobi formulation for reach–avoid differential games. IEEE Transactions on Automatic Control, 56(8):1849–1861, 2011.
  25. I. M. Mitchell. Application of level set methods to control and reachability problems in continuous and hybrid systems. Stanford University, 2002.
  26. A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Transactions on Automatic Control, 50(7):947–957, 2005.
  27. The target guarding problem: A real time solution for noise corrupted measurements. European Journal of Control, 54:111–118, 2020.
  28. Pursuit–evasion games in the presence of obstacles. Automatica, 65:1–11, 2016.
  29. Pursuer coordination against a fast evader via coverage control. IEEE Transactions on Automatic Control, pages 1–6, 2023.
  30. J. Selvakumar and E. Bakolas. Feedback strategies for a reach-avoid game with a single evader and multiple pursuers. IEEE transactions on cybernetics, 51(2):696–707, 2019.
  31. J. Selvakumar and E. Bakolas. Min–max Q-learning for multi-player pursuit-evasion games. Neurocomputing, 475:1–14, 2022.
  32. Reactive symbolic planning and control in dynamic adversarial environments. IEEE Transactions on Automatic Control, 68(6):3409–3424, 2023.
  33. D. Shishika and V. Kumar. A review of multi agent perimeter defense games. In International Conference on Decision and Game Theory for Security, pages 472–485, 2020.
  34. Partial information target defense game. In 2021 IEEE International Conference on Robotics and Automation (ICRA), pages 8111–8117, 2021.
  35. Deep reinforcement learning solution of reach-avoid games with superior evader in the context of unmanned aerial systems. In 2023 International Conference on Unmanned Aircraft Systems (ICUAS), pages 911–918, 2023.
  36. Circular target defense differential games. IEEE Transactions on Automatic Control, 68(7):4065–4078, 2023.
  37. A decentralized multirobot spatiotemporal multitask assignment approach for perimeter defense. IEEE Transactions on Robotics, 38(5):3085–3096, 2022.
  38. Two-an-one pursuit with a non-zero capture radius. In 2019 27th Mediterranean Conference on Control and Automation (MED), pages 577–582, 2019.
  39. Multiplayer reach-avoid differential games with simple motions: A review. Frontiers in Control Engineering, 3:1093186, 2023.
  40. Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games. Automatica, 140:110207, 2022.
  41. Reach-avoid games with two defenders and one attacker: An analytical approach. IEEE Transactions on Cybernetics, 49(3):1035–1046, 2019.
  42. Task assignment for multiplayer reach-avoid games in convex domains via analytical barriers. IEEE Transactions on Robotics, 36(1):107–124, 2020.
  43. Optimal strategies for the lifeline differential game with limited lifetime. International Journal of Control, 94(8):2238–2251, 2021.
  44. Two-phase jointly optimal strategies and winning regions of the capture-the-flag game. In 47th Annual Conference of the IEEE Industrial Electronics Society, pages 1–6, 2021.
  45. Smarter lions: Efficient cooperative pursuit in general bounded arenas. SIAM Journal on Control and Optimization, 58(2):1229–1256, 2020.
  46. A general, open-loop formulation for reach-avoid games. In 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pages 6501–6506, 2012.
  47. Cooperative pursuit with Voronoi partitions. Automatica, 72:64–72, 2016.
  48. R. Zou and S. Bhattacharya. On optimal pursuit trajectories for visibility-based target-tracking game. IEEE Transactions on Robotics, 35(2):449–465, 2018.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now