Abstract
Set approximation problems play an important role in many areas of mathematics and mechanics. For example, approximation problems for solvability sets and reachable sets of control systems are intensively studied in differential game theory and optimal control theory. In N.N. Krasovskii and A.I. Subbotin’s investigations devoted to positional differential games, one of the key problems was the problem of identification of solvability sets, which are maximal stable bridges. Since this problem can be solved exactly in rare cases only, the question of the approximate calculation of solvability sets arises. In papers by A.B. Kurzhanskii and F.L. Chernous’ko and their colleagues, reachable sets were approximated by ellipsoids and parallelepipeds.
In the present paper, we consider problems in which it is required to approximate a given set by arbitrary polytopes. Two sets, polytopes A and B, are given in Euclidean space. It is required to find a position of the polytopes that provides a minimum Hausdorff distance between them. Though the statement of the problem is geometric, methods of convex and nonsmooth analysis are used for its investigation.
One of the approaches to dealing with planar sets in control theory is their approximation by families of disks of equal radii. A basic component of constructing such families is best n-nets and their generalizations, which were described, in particular, by A.L. Garkavi. The authors designed an algorithm for constructing best nets based on decomposing a given set into subsets and calculating their Chebyshev centers. Qualitative estimates for the deviation of sets from their best n-nets as n grows to infinity were given in the general case by A.N. Kolmogorov. We derive a numerical estimate for the Hausdorff deviation of one class of sets. Examples of constructing best n-nets are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].
A. B. Kurzhanskii and T. F. Filippova, “Description of a set of viable trajectories of a differential inclusion,” Dokl. Akad. Nauk SSSR 289 (1), 38–41 (1986).
A. B. Kurzhanski and T. F. Filippova, “On the theory of trajectory tubes — a mathematical formalism for uncertain dynamics, viability and control,” in Advances in Nonlinear Dynamics and Control: A Report from Russia, Ed. by A. B. Kurzhanski (Birkhäuser, Boston, 1993), Ser. Progress in Systems and Control Theory, Vol. 17, pp. 122–188.
A. B. Kurzhanski and I. Valyi, Ellipsoidal Calculus for Estimation and Control (Birkhäuser, Boston, 1997).
F. L. Chernous’ko, Estimation of the Phase State of Dynamical Systems (Nauka, Moscow, 1988) [in Russian].
F. L. Chernous’ko, “Ellipsoidal estimates of a controlled system’s attainability domain,” J. Appl. Math. Mech. 45 (1), 7–12 (1981).
F. L. Chernousko and A. I. Ovseevich, “Properties of the optimal ellipsoids approximating the reachable sets of uncertain systems,” J. Optimiz. Theory Appl. 120 (2), 223–246 (2004).
V. N. Ushakov, A. R. Matviichuk, and P. D. Lebedev, “Stability defect in a game problem of approach at a fixed time,” Vestn. Udmurt. Univ., Ser. Mat. Mekh. Komp. Nauki, No. 3, 87–103 (2010).
V. N. Ushakov, P. D. Lebedev, A. R. Matviychuk, and A. G. Malev, “Differential games with fixed terminal time and estimation of the instability degree of sets in these games,” Proc. Steklov Inst. Math. 277, 266–277 (2012).
F. Hausdorff, Set Theory (Amer. Math. Soc., Providence, RI, 1957; Komkniga, Moscow, 2006).
A. S. Lakhtin and V. N. Ushakov, “The problem of minimization of the Hausdorff distance between two convex polyhedra,” Sovrem. Mat. Prilozh. 9, 60–67 (2003).
A. S. Lakhtin and V. N. Ushakov, “Minimization of Hausdorff distance between convex polyhedrons,” J. Math. Sci. (N.Y.) 126 (6), 1553–1560 (2005).
R. Rockafellar, Convex Analysis (Princeton Univ., Princeton, 1970; Moscow, Mir, 1973).
A. G. Sukharev, A. V. Timokhov, and V. V. Fedorov, A Course in Optimization Methods (Nauka, Moscow, 1986) [in Russian].
N. Z. Shor, Minimization Methods for Non-Differentiable Functions and Applications (Naukova Dumka, Kiev, 1979; Springer, Berlin, 1985).
B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).
P. D. Lebedev and A. V. Ushakov, “Approximating sets on a plane with optimal sets of circles,” Autom. Remote Control 73 (3), 485–493 (2012).
P. D. Lebedev and D. S. Bukharov, “Approximation of polyhedra by optimal sets of disks,” Izv. Irkutsk. Gos. Univ., Ser. Mat., No. 3, 72–87 (2013).
P. D. Lebedev, A. A. Uspenskii, and V. N. Ushakov, “Algorithms for best approximation of sets on a plane by sets of disks,” Vestn. Udmurt. Univ., Ser. Mat. Mekh. Komp. Nauki, No. 4, 88–99 (2013).
A. L. Garkavi, “Existence of the best net and the best width for a set in a Banach space,” Uspekhi Mat. Nauk 15 (2), 210–211 (1960).
A. L. Garkavi, “On the optimal net and best cross-section of a set in a normed space,” Izv. Akad. Nauk SSSR, Ser. Mat. 26 (1), 87–106 (1962).
A. L. Garkavi, “On the Chebyshev center and convex hull of a set,” Uspekhi Mat. Nauk 19 (6), 139–145 (1964).
E. N. Sosov, “The metric space of all N-nets in a geodesic space,” Uchen. Zap. Kazansk. Gos. Univ., Ser. Fiz.-Mat. Nauk 15 (4), 136–149 (2009).
A. N. Kolmogorov, “On certain asymptotic characteristics of completely bounded metric spaces,” Dokl. Akad. Nauk SSSR 108 (3), 385–388 (1956).
A. N. Kolmogorov and V. M. Tikhomirov, “The e-entropy and e-capacity of sets in function spaces,” Uspekhi Mat. Nauk, No. 2 (86), 3–86 (1959).
K. Leichtweiss, Konvexe Mengen (Springer, Berlin, 1980; Nauka, Moscow, 1985).
S. A. Piyavskii, “On the optimization of nets,” Izv. Akad. Nauk SSSR, Ser. Tekhn. Kibernet., No. 1, 68–80 (1968).
V. S. Brusov and S. L. Piyavskii, “A computational algorithm for optimally covering a plane region,” USSR Comp. Math. Math. Phys. 11 (2), 17–27 (1971).
F. Preparata and M. Shamos, Computational Geometry (Springer, New York, 1985; Mir, Moscow, 1989).
Sh. I. Galiev and M. A. Karpova, “Optimization of multiple covering of a bounded set with circles,” Comp. Math. Math. Phys. 50 (4), 721–732 (2010).
Erich’s Packing Center. http://www2.stetson.edu/~efriedma/packing.html
I. V. Bychkov, N. N. Maksimkin, I. S. Khozyainov, and L. V. Kiselev, “On the problem of patrolling the boundary of a water zone guarded by a group of underwater vehicles,” in Technical Problems of Exploring the Global Ocean: Proceedings of the Fifth All-Russia Research and Technology Conference, Vladivostok, Russia, 2013 (IPMT, Vladivostok, 2013), pp. 424–429.
N. N. Stepanov, Spherical Trigonometry (OGIZ, Moscow, 1948) [in Russian].
A. L. Kazakov and A. A. Lempert, “An approach to optimization in transport logistics,” Autom. Remote Control 72 (7), 1398–1404 (2011).
A. L. Kazakov, A. A. Lempert, and D. S. Bukharov, “On segmenting logistical zones for servicing continuously developed consumers,” Autom. Remote Control 74 (6), 968–977 (2013).
A. A. Lempert, A. L. Kazakov, and D. S. Bukharov, “A mathematical model and a software system for a problem of logistic object arrangement,” Upravl. Bol’shimi Sist., No. 41, 270–284 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.N. Ushakov, A.S. Lakhtin, P.D. Lebedev, 2014, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2014, Vol. 20, No. 3.
Rights and permissions
About this article
Cite this article
Ushakov, V.N., Lakhtin, A.S. & Lebedev, P.D. Optimization of the Hausdorff distance between sets in Euclidean space. Proc. Steklov Inst. Math. 291 (Suppl 1), 222–238 (2015). https://doi.org/10.1134/S0081543815090151
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543815090151