Advertisement

Doklady Mathematics

, Volume 98, Issue 3, pp 652–654 | Cite as

Class of Trajectories ℝ3 in Most Remote from Observers

  • V. I. BerdyshevEmail author
Control Theory
  • 2 Downloads

Abstract

The set of extremal trajectories is completely described. Their construction is reduced to finding the best routes on a directed graph whose vertices are subsets (boxes) of \(Y\backslash \mathop \cup \limits_S K\left( S \right)\) and whose edges are segments T(S) of the trajectory T that intersect the cones K(S) in the “best way.” The edge length is the deviation of S from T(S). The best routes are ones for which the length of the shortest edge is maximal.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. I. Berdyshev, Dokl. Math. 96 (2), 538–540 (2017).MathSciNetCrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Krasovskii Institute of Mathematics and Mechanics, Ural BranchRussian Academy of SciencesYekaterinburgRussia

Personalised recommendations