1. Электронный научный архив УрФУ
  2. 00. Общеуниверситетские коллекции
  3. Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC
Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/92261
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorChentsov, A.en
dc.contributor.authorKhachay, D.en
dc.date.accessioned2020-10-20T16:35:03Z-
dc.date.available2020-10-20T16:35:03Z-
dc.date.issued2019-
dc.identifier.citationChentsov A. Towards a relaxation of the pursuit-evasion differential game / A. Chentsov, D. Khachay. — DOI 10.1016/j.ifacol.2019.11.549 // IFAC-PapersOnLine. — 2019. — Vol. 13. — Iss. 52. — P. 2303-2307.en
dc.identifier.issn2405-8963-
dc.identifier.otherhttps://doi.org/10.1016/j.ifacol.2019.11.549pdf
dc.identifier.other1good_DOI
dc.identifier.other8aa3bc5b-fa56-4d99-b958-29e4156b0332pure_uuid
dc.identifier.otherhttp://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85078952526m
dc.identifier.urihttp://elar.urfu.ru/handle/10995/92261-
dc.description.abstractWe consider a special case of the non-linear zero-sum pursuit-evasion differential game. The instance of this game is defined by two closed sets - target set and one specifying state constraints. We find an optimal non-anticipating strategy for player I (the pursuer). Namely, we construct his successful solvability set specified by limit function of the iterative procedure in space of positions. For positions located outside the successful solvability set, we provide a relaxation of our game by determining the smallest size of a neighborhoods of two mentioned sets, for which the pursuer can solve his problem successfully. Then, we construct his successful solvability set in terms of those neighborhoods. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherElsevier B.V.en
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceIFAC-PapersOnLineen
dc.subjectNON-ANTICIPATING STRATEGIESen
dc.subjectPROGRAM ITERATIONS METHODen
dc.subjectPURSUIT-EVASION DIFFERENTIAL GAMEen
dc.subjectITERATIVE METHODSen
dc.subjectCLOSED SETen
dc.subjectDIFFERENTIAL GAMESen
dc.subjectNON LINEARen
dc.subjectNON-ANTICIPATING STRATEGIESen
dc.subjectPROGRAM ITERATIONSen
dc.subjectPURSUIT EVASIONen
dc.subjectSTATE CONSTRAINTSen
dc.subjectZERO SUMSen
dc.subjectGAME THEORYen
dc.titleTowards a relaxation of the pursuit-evasion differential gameen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1016/j.ifacol.2019.11.549-
dc.identifier.scopus85078952526-
local.affiliationKrasovsky Institute of Mathematics and Mechanics, 16 S.Kovalevskoy str., Ekaterinburg, 620990, Russian Federation
local.affiliationUral Federal University, 51 Lenin ave, Ekaterinburg, 620002, Russian Federation
local.contributor.employeeChentsov, A., Krasovsky Institute of Mathematics and Mechanics, 16 S.Kovalevskoy str., Ekaterinburg, 620990, Russian Federation, Ural Federal University, 51 Lenin ave, Ekaterinburg, 620002, Russian Federation
local.contributor.employeeKhachay, D., Krasovsky Institute of Mathematics and Mechanics, 16 S.Kovalevskoy str., Ekaterinburg, 620990, Russian Federation, Ural Federal University, 51 Lenin ave, Ekaterinburg, 620002, Russian Federation
local.description.firstpage2303-
local.description.lastpage2307-
local.issue52-
local.volume13-
dc.identifier.wos000504282400390-
local.identifier.pure11785900-
local.identifier.eid2-s2.0-85078952526-
local.identifier.wosWOS:000504282400390-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
10.1016-j.ifacol.2019.11.549.pdf420,45 kBAdobe PDFПросмотреть/Открыть
Показать базовое описание ресурса Статистика


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.