Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Solution of a Linear Pursuit-Evasion Differential Game with Closed and Convex Terminal Set

Journal of Mathematical and Fundamental Sciences · Vol. 44 No. 1 (2013) · hlm. 1–12

DOI
10.5614/itbj.sci.2012.44.1.1
ISSN
2338-5510, 2337-5760
Terbit
2013-07-21
Penerbit
Directorate for Research and Innovation (DRI) ITB
Bahasa
eng

Abstrak

A linear two-person zero-sum pursuit-evasion differential game is considered. Control functions of players are subject to integral constraints. Terminal set is a closed convex subset of The Pursuer tries to bring the state of the system to the terminal set and the Evader prevents bringing of the state to the terminal set where control resource of the Pursuer is greater than that of Evader. We obtain a formula for the optimal pursuit time and construct optimal strategies of the players in explicit form.

Jaringan kolaborasi para penulis

5 penulis · 6 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universiti Putra Malaysia
  • Academy of Sciences Republic of Uzbekistan
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Risman Mat HasimUniversiti Putra Malaysia1
Chika Samson OdiliobiUniversiti Putra Malaysia1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jmfs/oai, pertama di-harvest 9 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Solution of a Linear Pursuit-Evasion Differential Game with Closed and Convex Terminal Set</dc:title>
	<dc:creator>Ibragimov, Gafurjan I.</dc:creator>
	<dc:creator>Khakestari, Marzieh</dc:creator>
	<dc:creator>Kuchkarov, Atamurat Sh.</dc:creator>
	<dc:description xml:lang="en-US">A linear two-person zero-sum pursuit-evasion differential game is considered. Control functions of players are subject to integral constraints. Terminal set is a closed convex subset of  The Pursuer tries to bring the state of the system to the terminal set and the Evader  prevents bringing of the state to the terminal set where control resource of the Pursuer is greater than that of Evader.   We obtain a formula for the optimal pursuit time and construct optimal strategies of the players in explicit form.</dc:description>
	<dc:publisher xml:lang="en-US">Directorate for Research and Innovation (DRI) ITB</dc:publisher>
	<dc:date>2013-07-21</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jmfs/article/view/93</dc:identifier>
	<dc:identifier>10.5614/itbj.sci.2012.44.1.1</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Mathematical and Fundamental Sciences; Vol. 44 No. 1 (2012); 1-12</dc:source>
	<dc:source>2338-5510</dc:source>
	<dc:source>2337-5760</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jmfs/article/view/93/89</dc:relation>
</oai_dc:dc>