On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games
In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, under the assumption that the fundamental matrix of the homogeneous system is a recurrent functio...
Gespeichert in:
| Veröffentlicht in: | Journal of optimization theory and applications 2023-06, Vol.197 (3), p.1011-1023 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1023 |
|---|---|
| container_issue | 3 |
| container_start_page | 1011 |
| container_title | Journal of optimization theory and applications |
| container_volume | 197 |
| creator | Petrov, Nikolay N. |
| description | In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, under the assumption that the fundamental matrix of the homogeneous system is a recurrent function. It is assumed that the evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and the prehistory of the control of the evaders. The set of admissible controls is a strictly convex compact with a smooth boundary, and the goal sets are the origin of coordinates. The goal of the group of pursuers is the capture of at least one evader by two pursuers or the capture of two evaders. In terms of the initial positions and parameters of the game, a sufficient condition for capture is obtained. This study is based on the method of resolving functions, which makes it possible to obtain sufficient conditions for solvability of the problem of pursuit in some guaranteed time. |
| doi_str_mv | 10.1007/s10957-023-02230-3 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2819764035</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2819764035</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-8a799d463a993f7d15e64053387fc8545a1778a581da9c2a54219925923126ff3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKt_wFPA82qS2TTJUWqtwkKL1IOnEHeTuqVNarKr-O9NXcGbh2GG4f2AB6FLSq4pIeImUaK4KAiDPAxIAUdoRLmAgkkhj9GI5HcBDNQpOktpQwhRUpQj9LLwuHuzeBnD69bucHB42cfUt36NV58BT0OITetNZxs8-zCNjQm3HlettybiJ1v3MVrf4bvWOXu4WrPFc7Oz6RydOLNN9uJ3j9Hz_Ww1fSiqxfxxelsVNROkK6QRSjXlBIxS4ERDuZ2UhANI4WrJS26oENJwSRujamZ4yahSjCsGlE2cgzG6GnL3Mbz3NnV6E_roc6VmkiqR04BnFRtUdQwpRev0PrY7E780JfqAUA8IdUaofxBqyCYYTCmL_drGv-h_XN8MbHIk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2819764035</pqid></control><display><type>article</type><title>On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games</title><source>SpringerLink Journals - AutoHoldings</source><creator>Petrov, Nikolay N.</creator><creatorcontrib>Petrov, Nikolay N.</creatorcontrib><description>In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, under the assumption that the fundamental matrix of the homogeneous system is a recurrent function. It is assumed that the evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and the prehistory of the control of the evaders. The set of admissible controls is a strictly convex compact with a smooth boundary, and the goal sets are the origin of coordinates. The goal of the group of pursuers is the capture of at least one evader by two pursuers or the capture of two evaders. In terms of the initial positions and parameters of the game, a sufficient condition for capture is obtained. This study is based on the method of resolving functions, which makes it possible to obtain sufficient conditions for solvability of the problem of pursuit in some guaranteed time.</description><identifier>ISSN: 0022-3239</identifier><identifier>EISSN: 1573-2878</identifier><identifier>DOI: 10.1007/s10957-023-02230-3</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Applications of Mathematics ; Calculus of Variations and Optimal Control; Optimization ; Differential equations ; Differential games ; Dimensional analysis ; Engineering ; Euclidean geometry ; Euclidean space ; Mathematics ; Mathematics and Statistics ; Operations Research/Decision Theory ; Optimization ; Pursuit-evasion games ; Smooth boundaries ; Theory of Computation</subject><ispartof>Journal of optimization theory and applications, 2023-06, Vol.197 (3), p.1011-1023</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-8a799d463a993f7d15e64053387fc8545a1778a581da9c2a54219925923126ff3</cites><orcidid>0000-0002-0303-3559</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10957-023-02230-3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10957-023-02230-3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Petrov, Nikolay N.</creatorcontrib><title>On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games</title><title>Journal of optimization theory and applications</title><addtitle>J Optim Theory Appl</addtitle><description>In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, under the assumption that the fundamental matrix of the homogeneous system is a recurrent function. It is assumed that the evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and the prehistory of the control of the evaders. The set of admissible controls is a strictly convex compact with a smooth boundary, and the goal sets are the origin of coordinates. The goal of the group of pursuers is the capture of at least one evader by two pursuers or the capture of two evaders. In terms of the initial positions and parameters of the game, a sufficient condition for capture is obtained. This study is based on the method of resolving functions, which makes it possible to obtain sufficient conditions for solvability of the problem of pursuit in some guaranteed time.</description><subject>Applications of Mathematics</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Differential equations</subject><subject>Differential games</subject><subject>Dimensional analysis</subject><subject>Engineering</subject><subject>Euclidean geometry</subject><subject>Euclidean space</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Pursuit-evasion games</subject><subject>Smooth boundaries</subject><subject>Theory of Computation</subject><issn>0022-3239</issn><issn>1573-2878</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp9kE1LAzEQhoMoWKt_wFPA82qS2TTJUWqtwkKL1IOnEHeTuqVNarKr-O9NXcGbh2GG4f2AB6FLSq4pIeImUaK4KAiDPAxIAUdoRLmAgkkhj9GI5HcBDNQpOktpQwhRUpQj9LLwuHuzeBnD69bucHB42cfUt36NV58BT0OITetNZxs8-zCNjQm3HlettybiJ1v3MVrf4bvWOXu4WrPFc7Oz6RydOLNN9uJ3j9Hz_Ww1fSiqxfxxelsVNROkK6QRSjXlBIxS4ERDuZ2UhANI4WrJS26oENJwSRujamZ4yahSjCsGlE2cgzG6GnL3Mbz3NnV6E_roc6VmkiqR04BnFRtUdQwpRev0PrY7E780JfqAUA8IdUaofxBqyCYYTCmL_drGv-h_XN8MbHIk</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Petrov, Nikolay N.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-0303-3559</orcidid></search><sort><creationdate>20230601</creationdate><title>On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games</title><author>Petrov, Nikolay N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-8a799d463a993f7d15e64053387fc8545a1778a581da9c2a54219925923126ff3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Applications of Mathematics</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Differential equations</topic><topic>Differential games</topic><topic>Dimensional analysis</topic><topic>Engineering</topic><topic>Euclidean geometry</topic><topic>Euclidean space</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Pursuit-evasion games</topic><topic>Smooth boundaries</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Petrov, Nikolay N.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of optimization theory and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Petrov, Nikolay N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games</atitle><jtitle>Journal of optimization theory and applications</jtitle><stitle>J Optim Theory Appl</stitle><date>2023-06-01</date><risdate>2023</risdate><volume>197</volume><issue>3</issue><spage>1011</spage><epage>1023</epage><pages>1011-1023</pages><issn>0022-3239</issn><eissn>1573-2878</eissn><abstract>In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, under the assumption that the fundamental matrix of the homogeneous system is a recurrent function. It is assumed that the evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and the prehistory of the control of the evaders. The set of admissible controls is a strictly convex compact with a smooth boundary, and the goal sets are the origin of coordinates. The goal of the group of pursuers is the capture of at least one evader by two pursuers or the capture of two evaders. In terms of the initial positions and parameters of the game, a sufficient condition for capture is obtained. This study is based on the method of resolving functions, which makes it possible to obtain sufficient conditions for solvability of the problem of pursuit in some guaranteed time.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10957-023-02230-3</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-0303-3559</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0022-3239 |
| ispartof | Journal of optimization theory and applications, 2023-06, Vol.197 (3), p.1011-1023 |
| issn | 0022-3239 1573-2878 |
| language | eng |
| recordid | cdi_proquest_journals_2819764035 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Applications of Mathematics Calculus of Variations and Optimal Control Optimization Differential equations Differential games Dimensional analysis Engineering Euclidean geometry Euclidean space Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Pursuit-evasion games Smooth boundaries Theory of Computation |
| title | On the Problem of Pursuing Two Coordinated Evaders in Linear Recurrent Differential Games |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A11%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Problem%20of%20Pursuing%20Two%20Coordinated%20Evaders%20in%20Linear%20Recurrent%20Differential%20Games&rft.jtitle=Journal%20of%20optimization%20theory%20and%20applications&rft.au=Petrov,%20Nikolay%20N.&rft.date=2023-06-01&rft.volume=197&rft.issue=3&rft.spage=1011&rft.epage=1023&rft.pages=1011-1023&rft.issn=0022-3239&rft.eissn=1573-2878&rft_id=info:doi/10.1007/s10957-023-02230-3&rft_dat=%3Cproquest_cross%3E2819764035%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2819764035&rft_id=info:pmid/&rfr_iscdi=true |