{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:21:33Z","timestamp":1769185293646,"version":"3.49.0"},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"vor","delay-in-days":298,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>The reach\u2010avoid game theory is an ideal tool to handle the conflicts among intelligent agents and has been previously studied assuming full state information and no time limits on the players in the past decades. In this article, we extend the problem by requiring the defender to detect the attacker and adding maximum operation time constraints to the attacker. The attacker aims to reach the target region without being captured or reaching its time limit. The defender can employ strategies to intercept the attacker only when the attacker is detected. A geometric method is proposed to solve this game qualitatively. By analyzing the geometric property of the Apollonian circle and the detection range, we give the barrier under the condition that the attacker is initially detected and the attacker\u2019s shortest route which guarantees its arrival at the target region when it is initially outside the detection range. Then, a barrier that separates the game space into two respective winning regions of the players is constructed based on the shortest route and the time limit of the attacker. The main contributions of this work are that this paper provides the first attempt to introduce the abovementioned two concepts simultaneously, which makes the game more practical, and we provide the complete solution of the game in all possible situations.<\/jats:p>","DOI":"10.1155\/2022\/9954014","type":"journal-article","created":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T20:50:05Z","timestamp":1666817405000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reach\u2010Avoid Games with a Time Limit and Detection Range: A Geometric Approach"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8355-8952","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9352-9250","authenticated-orcid":false,"given":"Jianqiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7688-9043","authenticated-orcid":false,"given":"Kang","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6074-873X","authenticated-orcid":false,"given":"Di","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8831-7330","authenticated-orcid":false,"given":"Jiaxun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"key":"e_1_2_10_1_2","volume-title":"Differential Games","author":"Isaacs R.","year":"1967"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/taes.2017.2764269"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.2514\/1.g004068"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-018-0250-1"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2020.105715"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2021.106568"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2021.107112"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2022.107358"},{"key":"e_1_2_10_9_2","doi-asserted-by":"crossref","unstructured":"MylvaganamT. SassanoM. andAstolfiA. A constructive differential game approach to collision avoidance in multi-agent systems Proceedings of the 2014 American Control Conference; 2014 June 4-6 June 2014 Portland OR USA IEEE Press.","DOI":"10.1109\/ACC.2014.6859018"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"ChenM. ZhouZ. andTomlinC. A path defense approach to the multiplayer reach-avoid game Proceedings of the 53rd IEEE Conference on Decision and Control December 2014 Los Angeles LA USA IEEE Press.","DOI":"10.1109\/CDC.2014.7039758"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.2575"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2017.0302"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-017-0235-5"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.11.035"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejcon.2019.11.007"},{"key":"e_1_2_10_16_2","unstructured":"EsfahaniP. M. ChatterjeeD. andLygerosJ. On a problem of stochastic reach-avoid set characterization Proceedings of the 2011 50th IEEE Conference on Decision and Control and European Control Conference December 2011 Orlando FL USA IEEE Press."},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2011.2105730"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"BhattacharyaS. Ba\u015farT. andHovakimyanN. On the construction of barrier in a visibility-based pursuit evasion game Proceedings of the 2014 European Control Conference; 2014 Jun 24-27 June 2014 Strasbourg France IEEE Press.","DOI":"10.1109\/ECC.2014.6862391"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0996-9"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9408-6"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.05.007"},{"key":"e_1_2_10_22_2","doi-asserted-by":"crossref","unstructured":"SelvakumarJ.andBakolasE. Evasion with terminal constraints from a group of pursuers using a matrix game formulation Proceedings of the 2017 American Control Conference May 2017 Seattle WA USA IEEE Press.","DOI":"10.23919\/ACC.2017.7963182"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/17m1152589"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2020.2994023"},{"key":"e_1_2_10_25_2","doi-asserted-by":"crossref","unstructured":"ChenM. ZhouZ. andTomlinC. J. Multiplayer reach-avoid games via low dimensional solutions and maximum matching Proceedings of the 2014 American Control Conference; 2014 June 4-6 June 2014b Portland OR USA IEEE Press.","DOI":"10.1109\/ACC.2014.6859219"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2016.2577619"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2019.2914869"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2018.2794769"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/tro.2019.2935345"},{"key":"e_1_2_10_30_2","doi-asserted-by":"crossref","unstructured":"ShishikaD.andKumarV. Local-game decomposition for multiplayer perimeter-defense problem Proceedings of the 2018 IEEE Conference on Decision and Control December 2018 Miami Beach FL USA IEEE Press.","DOI":"10.1109\/CDC.2018.8618879"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2972818"},{"key":"e_1_2_10_32_2","doi-asserted-by":"crossref","unstructured":"FisacJ. F.andSastryS. S. The pursuit-evasion-defense differential game in dynamic constrained environments Proceedings of the 54th IEEE Conference on Decision and Control December 2015 Osaka Japan IEEE Press 4549\u20134556.","DOI":"10.1109\/CDC.2015.7402930"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.11.018"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.12.034"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2020.2987701"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2019.1698770"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1049\/cth2.12226"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/9954014","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/2022\/9954014","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/9954014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:07:33Z","timestamp":1769116053000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/9954014"}},"subtitle":[],"editor":[{"given":"Hiroki","family":"Sayama","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/9954014"],"URL":"https:\/\/doi.org\/10.1155\/2022\/9954014","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-08-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9954014"}}