24877nam#a2201789#i#4500001000500000005001700005008004000022020002300062044000900085072002500094080003000119084006700149084008900216084006800305100007200373245009000445260004400535300001200579500073800591510011601329510021301445510025201658510028301910510023402193510018702427510025602614510023702870510025503107510029003362510021903652510025703871510018204128510016404310510019004474510020704664510016804871510020105039510019105240510028305431510028505714510016705999510018706166510024006353510026206593510015006855510015207005510016507157510015607322510016107478510015607639510020507795510018708000510018108187510022508368510016008593510018408753510024708937510016509184510018109349510019909530510019709729510013109926510016410057510016710221510015510388510013710543510013910680510018610819510018711005510016111192510015511353510020011508510014711708510016611855510015812021510018412179510016512363510017212528510015912700510020812859510022613067510015013293510011213443510013613555510009313691510044413784510013114228510018014359510034814539510007614887510009514963510012515058510013015183510017115313510007915484510010615563510007915669510009615748510008515844510009415929510009516023510008316118510010516201510013816306510007716444510013516521510014516656510016916801510019216970510008517162510010917247510014217356510009317498510007917591510017717670510016517847510015718012510016018169510012618329510011618455510015318571510015018724510012218874510012818996510012119124510009819245510009019343510009219433510010019525510015719625510023719782510020520019510016820224510011220392510016620504510021520670510023820885510013221123510016921255510013721424510021321561510008921774510011521863510017321978510033822151510019422489510014422683510008022827510013022907533003323037856001723070218620241203205354.2  20210820d2021####ek#y0engy0150####ca##$a978-5-369-02071-5##$axxu#7$aCalculus. MAT005000##$aМатематика. 51##$aФизико-математические науки. 222bbk##$aКомпьютерные и информационные науки. 02.07.012okso##$aОбщие вопросы информатики. 20.012grnti#1$aDubanov, Aleksandr Anatol'evich$aBanzarov Buryat State University00$aSimulation of pursuit and parallel approach methods in pursuit problems$cMonography1#$aMoscow$bPublishing Center RIOR$c2021##$a213 p.##$aThis monograph publishes a description of methods and algorithms for pursuit problems on surfaces. Simulation of tasks in the Mathcad programming environment was made. The development of digital technologies makes it possible to simulate a variety of problems from the theory of differential games. As a result of computer modeling, a lot of animation videos were obtained, which allow you to see the algorithmic solutions proposed by the author in pursuit problems.
The monograph can be useful for students of technical universities, graduate students and developers of robotic systems with elements of artificial intelligence.$aapproach, chase, projection, plane, projection, iteration, algorithm, parallelism$a10.29039/02071-50#$aDubanov A.A. Geometricheskoe modelirovanie zadach presledovaniya v srede Mathcad: monografiya. M.: RIOR, 2020.0#$aDubanov A.A. Modelirovanie traektoriy ot presledovatelya do celi s ogranicheniyami na kriviznu i s zadannymi kraevymi usloviyami. Svidetel'stvo o registracii programmy dlya EVM № 2020614336, ot 20.03.2020.0#$aDubanov A.A., Ayusheev T.V. Geometricheskaya model' presledovaniya gruppoy odinochnoy celi // V sbornike: problemy mashinovedeniya. Materialy IV mezhdunarodnoy nauchno-tehnicheskoy konferencii / Nauchnyy redaktor P.D. Balakin. 2020. S. 432–437.0#$aDubanov A.A., Ayusheev T.V. Algoritmy sledovaniya po predpolagaemym traektoriyam ot presledovatelya do dinamicheskoy celi // V sbornike: problemy mashinovedeniya. Materialy IV mezhdunarodnoy nauchno-tehnicheskoy konferencii / Nauchnyy redaktor P.D. Balakin. 2020. S. 437–442.0#$aNefedov Yu.Yu, Dubanov A.A. O postroenii traektorii obhoda prepyatstviya // V sbornike: problemy mashinovedeniya. Materialy IV mezhdunarodnoy nauchno-tehnicheskoy konferencii / Nauchnyy redaktor P.D. Balakin. 2020. S. 443–446.0#$aDubanov A.A. Model' gruppovogo presledovaniya odinochnoy celi na osnove sledovaniya ranee prognoziruemym traektoriyam // Informacionnye tehnologii. 2020. T. 26. № 6. S. 334–341.0#$aVizualizaciya okruzhnostey Apolloniya pri geometricheskom modelirovanii metoda parallel'nogo sblizheniya na ploskosti / A.A. Dubanov, A.V. Urbahanov, N.B. Cyrenzhapov, A.E. Seveen // Nauchno-tehnicheskiy vestnik Povolzh'ya. 2020. № 6. S. 105–109.0#$aTrajectory modelling when bypassing obstacles. A.A. Dubanov, T.V. Ausheev. Journal of physics: conference series. XIII international scientific and technical conference “Applied Mechanics and Systems Dynamics”. 2020. P. 012057.0#$aDubanov A.A., Ausheev T.V. Geometric model of persecution by a group of one goal. Journal of physics: conference series. IV international scientific and technical conference “Mechanical Science and Technology Update”, MSTU 2020. 2020. P. 012036.0#$aDubanov A.A., Ausheev T.V. A geometric model for following the intended trajectories from the pursuer to the target. Journal of physics: conference series. IV international scientific and technical conference “Mechanical Science and Technology Update”, MSTU 2020. 2020. P. 012035.0#$aNefedova V.A., Dubanov A.A. Vizualizaciya okruzhnostey Apolloniya pri geometricheskom modelirovanii metoda parallel'nogo sblizheniya na ploskosti // Nauchnoe obozrenie. Tehnicheskie nauki. 2020. № 4. C. 70–75.0#$aGeometricheskaya kvazidiskretnaya model' gruppovogo presledovaniya odinochnoy celi/ Dubanov A.A., Ayusheev T.V., Seveen A.O., Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya: Stroitel'stvo i Arhitektura. 2020. T. 20. № 4. S. 65–72.0#$aDubanov A.A., Ayusheev T.V. Kinematicheskaya model' zadachi presledovaniya na ploskosti metodom pogoni // Dinamika sistem, mehanizmov i mashin. 2020. T. 8. № 1. S. 154–160.0#$aDubanov A.A., Ayusheev T.V. Kinematicheskaya model' metoda parallel'nogo sblizheniya // Dinamika sistem, mehanizmov i mashin. 2020. T. 8. № 1. S. 160–165.0#$aGeometricheskaya model' metoda parallel'nogo sblizheniya / A.A. Dubanov, B.V. Zayatuev, A.V. Badeev, A.E. Seveen // Nauchno-tehnicheskiy vestnik Povolzh'ya. 2020. № 12. S. 187–189.0#$aGeometricheskaya model' zadachi presledovaniya na ploskosti metodom pogoni / A.A. Dubanov, B.V. Zayatuev, A.V. Badeev, A.E. Sveen // Nauchno-tehnicheskiy vestnik Povolzh'ya. 2020. № 12. S. 190–192.0#$aDubanov A.A., Seveen A.E. Kinematicheskaya model' metoda parallel'nogo sblizheniya // Svidetel'stvo o registracii programmy dlya EVM № 2020664886 ot 20.11.2020.0#$aDubanov A.A., Seveen A.E. Modelirovanie traektorii presledovatelya na poverhnosti metodom parallel'nogo sblizheniya // Svidetel'stvo o registracii programmy dlya EVM № 2020664893 ot 20.11.2020.0#$aDubanov A.A. Model of group pursuit of a single target based on following previously predicted trajectories. Advances in intelligent systems and computing, 2020. Vol. 1295. Pp. 36–49.0#$aDubanov A.A., Seveen A.E., Tsyrenzhapov N.B. Geometric modeling of the parallel approach method in some transport problems. IOP conference series: materials science and engineering. 8 T. “VIII International Scientific Conference Transport of Siberia 2020”. 2020. P. 012088.0#$aDubanov A.A., Nefedova V.A., Tashkane A.S. Numerical and analytical building surface crossing lines in some transport tasks. IOP conference series: materials science and engineering. 8. T. “VIII International Scientific Conference Transport of Siberia 2020”. 2020. P. 012018.0#$aDubanov A.A. Trajectory modeling in a pursuit problem with curvature restrictions. Advances in intelligent systems and computing, 2020. Vol. 1224. Pp. 226–232.0#$aDubanov A.A. Postroenie modeley dvizheniya ob'ektov v zadache presledovaniya. reshenie v sisteme vychislitel'noy matematiki Mathcad. Cloud of Science. 2019. T. 6. № 1. S. 48–62.0#$aDubanov A.A. Zadacha presledovaniya ob'ekta s poverhnosti, raspolozhennoy nad poverhnost'yu presleduemogo // Vestnik Yuzhno-Ural'skogo gosudarstvennogo universiteta. Seriya: Stroitel'stvo i Arhitektura. 2019. T. 19. № 2. S. 67–72.0#$aPostroenie modeley dvizheniya ob'ektov v zadache presledovaniya. reshenie v sisteme vychislitel'noy matematiki “MathCAD” / I.T. Bubeev, A.A. Dubanov, T.V. Ayusheev, P.V. Motoshkin // Programmnye sistemy i vychislitel'nye metody. 2019. № 1. S. 1–11.0#$aDubanov A.A. Zadacha presledovaniya ob'ektov, peredvigayuschihsya po raznym poverhnostyam // Vestnik kibernetiki. 2019. № 1(33). S. 100–105.0#$aDubanov A.A. Modeling the behavior of objects in the pursuit problem. Advances in intelligent systems and computing 2019. Vol. 984. Pp. 259–274.0#$aDubanov A.A. Modeli povedeniya ob'ektov v zadache presledovaniya na poverhnosti // Svidetel'stvo o registracii programmy dlya EVM № 2019618234 ot 08.07.2019.0#$aDubanov A.A., Ayusheev T.V. Modelirovanie traektoriy pri obhode prepyatstviy // Dinamika sistem, mehanizmov i mashin. 2019. T. 7. № 4. S. 110–117.0#$aDubanov A.A., Semenov D.A., Ausheev T.V. The task of pursuing objects moving on different surfaces. Journal of physics: Conference series. 2019. P. 072004.0#$aNefedova V.A., Dubanov A.A. Modelirovanie traektorii s ogranicheniyami na kriviznu // Nauchnoe obozrenie. Tehnicheskie nauki. 2019. № 6. C. 38–43.0#$aDubanov A.A., Ayusheev T.V., Urbahanov A.V. Konstruirovanie traektoriy s zadannymi ogranicheniyami po krivizne // Prikladnaya matematika i fundamental'naya informatika. 2019. T. 6. № 2. S. 12–21.0#$aDubanov A.A., Ayusheev T.V., Urbahanov A.V. Modelirovanie traektoriy pri obhode prepyatstviy // Prikladnaya matematika i fundamental'naya informatika. 2019. T. 6. № 2. S. 22–33.0#$aDubanov A.A., Nefedov Yu.Yu. Konstruirovanie traektoriy obhoda neskol'kih prepyatstviy // Prikladnaya matematika i fundamental'naya informatika. 2019. T. 6. № 4. S. 18–22.0#$aDubanov A.A. Vizualizaciya okruzhnostey Apolloniya pri geometricheskom modelirovanii metoda parallel'nogo sblizheniya na ploskosti // Prikladnaya matematika i fundamental'naya informatika. 2019. T. 6. № 4. S. 23–31.0#$aDubanov A.A. Zadacha presledovaniya. reshenie v sisteme vychislitel'noy matematiki MathCAD // Informacionnye tehnologii. 2018. T. 24. № 4. S. 251–255.0#$aDubanov A.A., Bildushkina M.N. Postroenie geodezicheskih liniy v sisteme komp'yuternoy matematiki MathCAD // T-Comm: Telekommunikacii i transport. 2018. T. 12. № 7. S. 37–41.0#$aDubanov A.A., Bildushkina M.N. Postroenie geodezicheskih liniy primenitel'no k zadache presledovaniya v sisteme komp'yuternoy matematiki MathCAD // Modelirovanie, optimizaciya i informacionnye tehnologii. 2018. T. 6. № 3(22). S. 121–131.0#$aDubanov A.A., Bildushkina M.N. Postroenie geodezicheskih liniy v sisteme komp'yuternoy matematiki MathCAD // Cloud of Science. 2018. T. 5. № 4. S. 599–607.0#$aDubanov A.A., Bildushkina M.N. Postroenie geodezicheskih liniy v sisteme komp'yuternoy matematiki MathCAD // Neyrokomp'yutery: razrabotka, primenenie. 2018. № 9. S. 61–66.0#$aDubanov A.A., Erdyneeva L.I. Zadacha presledovaniya v sisteme vychislitel'noy matematiki MathCAD // V sbornike: Sovremennye problemy telekommunikaciy. materialy konferencii. 2016. C. 129–133.0#$aDubanov A.A., Erdyneeva L.I. Zadacha presledovaniya v sisteme vychislitel'noy matematiki MathCAD // Mezhdunarodnyy zhurnal prikladnyh i fundamental'nyh issledovaniy. 2016. № 9-1. C. 7–11.0#$aAnimirovannoe izobrazhenie, Perehvat celi. URL:  https://www.youtube.com/watch?v=rsMGA1ICo7M (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Modelirovanie ubeganiya celi ot presledovatelya. URL: https://www.youtube.com/watch?v=hGieKXNiuz8 (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Kinematicheskaya model' parallel'nogo sblizheniya. URL: https://www.youtube.com/watch?v=qNXdykK21Z8  (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Proekciya pryamoy linii na poverhnost'. URL: https://www.youtube.com/watch?v=06qgINE4j8U (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Sfera na poverhnosti. URL: https://www.youtube.com/watch?v=xszwIyTHUec (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Vizualizaciya okruzhnostey Apolloniya. URL: https://youtu.be/rsMGA1ICo7M (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Vizualizaciya zadachi presledovaniya metodom parallel'nogo sblizheniya na ploskosti. URL:  https://youtu.be/qNXdykK21Z8 (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Vizualizaciya metoda pogoni, kogda skorost' presledovatelya vsegda napravlena na cel'. URL: https://youtu.be/PAu9Qg1dySM (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Iteracionnyy process zadachi presledovaniya metodom pogoni. URL: https://youtu.be/UQ5bVKjVqZ4  (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Korrektirovka napravleniya dvizheniya presledovatelya. URL: https://youtu.be/XubnxJfk-Lc (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Rezul'tat modelirovaniya gruppovogo presledovaniya odinochnoy celi. URL: https://www.youtube.com/watch?v=aC4PuXTgVS0&feature=youtu.be (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Gruppovoe presledovanie s zhestkimi svyazyami. URL: https://youtu.be/sLy7Jvppf4A (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Presledovanie odnoy celi dvumya presledovatelyami. URL: https://www.youtube.com/watch?v=7VNHNwCbWrg (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Presledovanie dvuh celey gruppoy iz treh presledovateley. URL: https://youtu.be/NNJDJOJT34I (data obrascheniya: 20.04.2021).0#$aAnimirovannoe izobrazhenie, Presledovanie dvuh celey gruppoy iz treh presledovateley bez vspomogatel'nyh liniy. URL: https://youtu.be/tdbgoNoby3A (data obrascheniya: 20.04.2021).0#$aVagin D.A., Petrov N.N. Zadacha presledovaniya zhestko skoordinirovannyh ubegayuschih // Izvestiya RAN. Teoriya i sistemy upravleniya. 2001. № 5. S. 75–79.0#$aVagin D.A., Petrov N.N. Ob odnoy zadache gruppovogo presledovaniya s fazovymi ogranicheniyami // Prikladnaya matematika i mehanika. 2002. T. 66. Vyp. 2. S. 234–241.0#$aBannikov A.C. Nekotorye nestacionarnye zadachi gruppovogo presledovaniya, Izvestiya Instituta matematiki i informatiki UdGU. 2013. Vyp. 1(41). C. 3–46.0#$aBannikov A.S. Nestacionarnaya zadacha gruppovogo presledovaniya // Trudy Matematicheskogo centra imeni N.I. Lobachevskogo. Kazan': Izd-vo Kazanskogo matematicheskogo obschestva, 2006. T. 34. S. 26–28.0#$aBannikov A.S. Nestacionarnaya zadacha gruppovogo presledovaniya // Problemy teoreticheskoy i prikladnoy matematiki: tr. 39-y Vseros. molodezh. konf., 28 yanv. — 1 fev. 2008 g. Ekaterinburg: UrO RAN, 2008. S. 221–223.0#$aBardadym T.A. Zadacha presledovaniya s prostym dvizheniem i raznotipnymi ogranicheniyami na upravleniya // Kibernetika. 1982. № 2. S. 80–84.0#$aBlagodatskih V.I. Vvedenie v optimal'noe upravlenie (lineynaya teoriya). M.: Vysshaya shkola, 2001. 240 s.0#$aBlagodatskih A.I., Petrov N.N. Konfliktnoe vzaimodeystvie grupp upravlyaemyh ob'ektov. Izhevsk: Izd-vo Udmurt. un-ta, 2009. 266 s.0#$aGubarev E.V. Ubeganie ot gruppy presledovateley // Avtomatika. 1992. № 5. S. 66–70.0#$aIzmest'ev I.V., Uhobotov V.I. Zadacha presledovaniya malomanevrennyh ob'ektov s terminal'nym mnozhestvom v forme kol'ca. Materialy mezhdunarodnoy konferencii «Geometricheskie metody v teorii upravleniya i matematicheskoy fizike: differencial'nye uravneniya, integriruemost', kachestvennaya teoriya» Ryazan', 15–18 sentyabrya 2016 g., Itogi nauki i tehn. Ser. Sovrem. mat. i ee pril. Temat. obz., 148, VINITI RAN, M., 2018. C. 25–31.0#$aKovshov A.M. Parallel'nye strategii v igrah presledovaniya na sfere: avtoref. dis.  kand. fiz.-matem. nauk. SPb., 1996. 12 s.0#$aKonstantinov R.V. O kvazilineynoy differencial'noy igre s prostoy dinamikoy pri nalichii fazovogo ogranicheniya // Matematicheskie zametki. 2001. T. 69. Vyp. 4. S. 581–590.0#$aKotov I.I. Novyy metod postroeniya poverhnostey, udovletvoryayuschih nekotorym napered zadannym trebovaniyam // Voprosy teorii, prilozheniy i metodiki prepodavaniya nachertatel'noy geometrii (trudy Rizhskoy nauchno-metodicheskoy konferencii, iyun' 1957). Riga: Rizhskiy institut inzhenerov grazhdanskogo vozdushnogo flota, 1960. S. 143–161.0#$aKrasovskiy N.N. Igrovye zadachi o vstreche dvizheniy. M.: Nauka, 1970.0#$aKrasovskiy N.N., Subbotin A.I. Pozicionnye differencial'nye igry. M.: Nauka, 1974. 456 s.0#$aKumkov S.I., Packo V.S. Zadacha presledovaniya s nepolnoy informaciey: Preprint. Ekaterinburg; IMM UrO RAN, 1993. 64 s.0#$aMakarov I.M., Lohin V.M. Man'ko S.V. Iskusstvennyy intellekt i intellektual'nye sistemy upravleniya. M.: Nauka, 2006. 333 s.0#$aPankratova Ya.B. Reshenie kooperativnoy differencial'noy igry gruppovogo presledovaniya // Diskretnyy analiz i issledovanie operaciy. 2010. T. 17. № 2. S. 57–78.0#$aPetrosyan L.A., Rihsiev B.B. Presledovanie na ploskosti. M.: Nauka, 1961.0#$aPetrosyan L.A., Zenkevich N.A., Shevkoplyas E.V. Teoriya Igr. Izd-vo «BHV-Peterburg», 2012. 424 s.0#$aPetrosyan L.A., Zenkevich N.A., Semina E.A. Teoriya igr. M., 1998. 300 c.0#$aPetrosyan L.A., Zaharov V.V. Matematicheskie modeli v ekologii. Izd-vo SPbGU, 1997. 254 c.0#$aPetrosyan L.A., Rihsiev B.B. Presledovanie na ploskosti. M.: Nauka, 1991. 94 c.0#$aPetrosyan L.A., Tomskiy G.V. Geometriya prostogo presledovaniya. M.: Nauka, 1983. 143 c.0#$aPetrosyan L.A., Zubov V.I. Matematicheskie metody v planirovanii. Izd-vo LGU, 1982. 96 c.0#$aPetrosyan L.A. Differencial'nye igry presledovaniya. Izd-vo LGU, 1977. 222 c.0#$aPontryagii L.S. K teorii differencial'nyh igr // Uspehi matematicheskih nauk. T. XXI. Vyp. 4, 1966.0#$aPontryagin L.S., Boltyanskiy V.G., Gamkrelidze R.V., Mischenko E.F. Matematicheskaya teoriya optimal'nyh processov. M.: Nauka, 1976.0#$aPontryagin L.S. Izbrannye nauchnye trudy. T. 2. M.: Nauka, 1988. 576 c.0#$aPontryagin L.S. Lineynaya differencial'naya igra ubeganiya // Trudy Matematicheskogo instituta AN SSSR. 1971. T. 112. S. 30–63.0#$aPontryagin L.S., Mischenko E.F. Zadacha ob ubeganii odnogo upravlyaemogo ob'ekta ot drugogo // DAN SSSR. 1969. T. 189. № 4. S. 721–723.0#$aPontryagin L.S., Mischenko E.F. Zadacha ob uklonenii ot vstrechi v lineynyh differencial'nyh igrah // Differencial'nye uravneniya. 1971. T. 7. № 3. S. 436–445.0#$aPshenichnyy B.N., Chikriy A.A. Zadacha ob uklonenii ot vstrechi v differencial'nyh igrah // Zhurnal vychislitel'noy matematiki i matematicheskoy fiziki. 1974. T. 14. № 6. S. 416–427.0#$aPshenichnyy B.N. O zadache ubeganiya // Kibernetika. 1975. № 4. S. 120–127.0#$aPshenichnyy B.N. Prostoe presledovanie neskol'kimi ob'ektami // Kibernetika. 1976. № 3. S. 145–146.0#$aPshenichnyy B.N., Chikriy A.A. Differencial'naya igra ukloneniya // Izvestiya AN SSSR. Tehnicheskaya kibernetika. 1977. № 1. S. 3–9.0#$aPshenichnyy B.N., Ostapenko V.V. Differencial'nye igry. Kiev: Nauk. dumka, 1992. 260 s.0#$aSavelov A.A. Ploskie krivye. M.: Knizhnyy dom «Lib-rokom», 2009. 296 s.0#$aSamatov B.T. Zadacha presledovaniya-ubeganiya pri integral'no-geometricheskih ogranicheniyah na upravleniya presledovatelya // Avtomat. i telemeh. 2013. № 7. S. 17–28.0#$aHachumov M.V. Reshenie zadachi sledovaniya za cel'yu avtonomnym letatel'nym apparatom // Iskusstvennyy intellekt i prinyatie resheniy. 2015. № 2. S. 45–52.0#$aHachumov M.V. Zadachi gruppovogo presledovaniya celi v usloviyah vozmuscheniy // Iskusstvennyy intellekt i prinyatie resheniy. 2016. № 2. S. 46–54.0#$aIsaacs R. Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization. New York: John Wiley & Sons, 1965.0#$aTorrence D. Parsons. Pursuit-evasion in a graph. Theory and Applications of Graphs. Springer-Verlag, 1976. S. 426–441.0#$aRichard Borie, Craig Tovey, Sven Koenig. Algorithms and Complexity Results for Pursuit-Evasion Problems. 2009.0#$aEllis J., Sudborough I., Turner J. The vertex separation and search number of a graph. Information and Computation. 1994. Vol. 113 (1). S. 50–79.0#$aFomin F.V., Thilikos D. An annotated bibliography on guaranteed graph searching. Theoretical Computer Science. 2008. Vol. 399 (3). S. 236–245.0#$aKirousis M. Papadimitriou C. Searching and pebbling. Theoretical Computer Science. 1986. Vol. 42 (2). Pp. 205–218.0#$aNowakowski R., Winkler P. Vertex-to-vertex pursuit in a graph. Discrete Mathematics. 1983. Vol. 43 (2–3). Pp. 235–239.0#$aPetrosjan L.A. Differential Games of Pursuit. World Scientific Pub Co Inc., 1993. Vol. 2. (Series on Optimization).0#$aPetrosyan L.A. Yeung D.W.K. Subgame-consistent Economic Optimization. Springer, 2012. 396 p.0#$aPetrosjan L.A., Zenkevich N.A. Game Theory. World Scientific Publisher, 1996. 350 p.0#$aPetrosjan L.A. Differential Games of Pursuit. World Scientific Publisher, 1993. 326 p.0#$aYeung D.W.K., Petrosyan L.A. Cooperative Stochastic Differential Games. Springer, 2006. 242 p.0#$aSeymour P., Thomas R. Graph searching, and a min-max theorem for tree-width. Journal of Combinatorial Theory, Series B. 1993. Vol. 58 (1). Pp. 22–33.0#$aRene Vidal, Omid Shakernia, H. Jin Kim, David Hyunchul Shim, Shankar Sastry. Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE Transactions on Robotics and Automation. 2002. Vol. 18 (5).0#$aMarcos A.M. Vieira, Ramesh Govindan, Gaurav S. Sukhatme. Scalable and Practical Pursuit-Evasion with Networked Robots. Journal of Intelligent Service Robotics Special Issue on Networked Robots. 2009.0#$aChern F. Chung, Tomonari Furukawa. A Reachability-Based Strategy for the Time-Optimal Control of Autonomous Pursuers. Engineering Optimization. 2008. Vol. 40 (1).0#$aJoao P. Hespanha, Hyoun Jin Kim, Shankar Sastry. Multiple-agent probabilistic pursuit-evasion games. 1999.0#$aAshkenazi V.O. Primenenie teorii igr v voennom dele// Sbornik perevodov s angliyskogo pod redakciey Ashkenazi V.O.// Izdatel'stvo «Sovetskoe Radio», M., 1961.0#$aKuz'mina L.I., Osipov Yu.V. Raschet dliny traektorii dlya zadachi presledovaniya // Vestnik MGSU.  Recenziruemyy nauchno-tehnicheskiy zhurnal po stroitel'stvu i arhitekture. NIU MGSU. 2013. № 12. C. 20–26.0#$aMamatov M.Sh. Igrovaya zadacha presledovaniya i ubeganiya s upravleniem, zadannym raznostnymi uravneniyami vtorogo poryadka // Izvestiya Instituta matematiki i informatiki Udmurtskogo gosudarstvennogo universiteta. 2006. C. 95–96.0#$aPacko V.S., Turova V.L. Igra «shofer-ubiyca» i ee modifikacii // Vestnik Udmurtskogo universiteta. Matematika. 2008. Vyp. 2.0#$aRomannikov D.O. Primer resheniya minimaksnoy zadachi presledovaniya s ispol'zovaniem neyronnyh setey // Sbornik nauchnyh trudov NGTU. 2018. № (92). S. 108–116.0#$aKelendzheridze D.L. Ob odnoy zadache optimal'nogo presledovaniya // Avtomatika i telemehanika. 1962. T. 23. Vyp. 8. S. 1008–1013.0#$aBreakwell J.V., Merz A.W. Toward a complete solution of the homicidal chaueur game. Proc. of the 1st Int. Conf. on the Theory and Application of Dierential Games, Amherst, Massachusetts, 1969. P. III-1III-5.0#$aLewin J. Decoy in pursuit-evasion games: PhD Thesis. Stanford University, 1973. 17.0#$aLewin J., Olsder G.J. Conic surveillance evasion // J. Opt. Theory Appl. 1979. Vol. 27, no, 1. Pp. 107–125.0#$aCardaliaguet P., Quincampoix M., Saint-Pierre P. Numerical methods for optimal control and dierential games. Ceremade CNRS URA 749. University of Paris Dauphine, 1995.0#$aCardaliaguet P., Quincampoix M., Saint-Pierre P. Set-valued numerical analysis for optimal control and dierential games. In M. Bardi, T.E.S. Raghavan and T. Parthasarathy (eds.), Stochastic and Dierential Games: Theory and Numerical Methods, Annals of the Int. Soc. of Dynamic Games. Boston: Birkhauser. 1999. Vol. 4. Pp. 177–247.0#$aDubins L.E. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math. 1957. Vol. 79. Pp. 497–516.0#$aReeds J.A., Shepp L.A. Optimal paths for a car that goes both forwards and backwards. Pacic J. Math. 1990. Vol. 145, no. 2. Pp. 367–393.0#$aGeometricheskoe modelirovanie v MathCAD. URL: http://dubanov.exponenta.ru.0#$aLewin J., Breakwell J.V. The surveillance-evasion game of degree. J. Opt. Theory Appl. 1975. Vol. 16, no. 34. Pp. 339–353.##$aThere is an electronic copy4#$ariorpub.com