Modeling of optimal networks in Manhattan Geometry by means of linkages
https://doi.org/10.22405/2226-8383-2025-26-2-71-89
Abstract
In a broad sense, linkages are constructions made of rigid elements connected in such a way that some of their pairs can rotate around a common point. One of the main tasks related to the study of linkages is the description of possible hinge positions. Important results in this
area are provided by the theorems of King [7], [8] and Kempe [2]. The main result of this paper is the constructive proof of the existence of a linkage that solves the optimization problem, namely the search for the shortest network connecting the boundary of 𝑚 ⩾ 1 points in a space
of dimension 𝑛 ⩾ 2 with the Manhattan metric. This work is a continuation of the author’s previous works[3],[4], which described mechanisms for constructing the shortest network in the Euclidean plane, as well as the minimal parametric network in Euclidean space of dimension 𝑘 ⩾ 2.
References
1. MachineLearningMastery.com, 2020, “4 Distance Measures for Machine Learning”, [Online]. Available: https://machinelearningmastery.com/distance-measures-for-machine-learning/[Accessed: Jan. 1, 2025].
2. Kempe, A.B., 1876, “On a General Method of Describing Plane Curves of the nth Degree by Linkwork”, Proceedings of the London Mathematical Society, vol. 7, pp. 213-216.
3. Zhitnaya, M.Y., 2019, “Modeling of optimal networks by means of linkages”, Fundamental and Applied Mathematics, vol. 22, no. 6, pp. 95-122.
4. Zhitnaya, M.Y., 2022, “Modeling minimal parametric networks in Euclidean spaces using linkages”, Chebyshev Collection, vol. 23, no. 2, pp. 74-87.
5. Ivanov, A.O., Tuzhilin, A.A., 2001, Theory of Extreme Networks, Moscow: Nauka.
6. Hanan, M., 1966, “On Steiner’s problem with rectilinear distance”, SIAM Journal on Applied Mathematics, vol. 14, pp. 255-265.
7. King, R., 1998, The Robotic Revolution, Oxford: Oxford University Press.
8. King, R., 2005, Advanced Robotics: Theory and Application, Cambridge: MIT Press.
9. Dorna Robotics, 2023, “Revolute Joints”, [Online]. Available: https://dorna.ai/blog/types-ofrobot-joints/ [Accessed: Jan. 1, 2025].
10. Zachariasen, M., 2000, “A Catalog of Hanan Grid Problems”, Networks, vol. 38, pp. 200-221.
11. Snyder, T.L., 1992, “On Minimal Rectilinear Steiner Trees in All Dimensions”, Discrete and Computational Geometry, vol. 7, pp. 221-261. DOI: 10.1145/98524.98596.
12. Leverenz, C.R., Truszczynski, M., 1999, “The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the Terminal Set”, in Proceedings of the ACM Southeast Regional Conference, pp. 1-10. DOI: 10.1145/306363.306402.
13. Hartenberg, R.S., Denavit, J., 1964, Kinematic Synthesis of Linkages, New York: McGraw-Hill.
14. Kapovich, M., Millson, J.J., 2002, “Universality theorems for configurations of planar linkages”, Topology, vol. 41, no. 6, pp. 1051-1107.
15. Kovalev, M.D., 2019, Geometric Questions of Kinematics and Statics, Moscow: URSS Lenand.
16. Kovalev, M.D., 2020, “What is a linkage mechanism? And what did Kempe prove?”, Results of Science and Technology. Modern Mathematics and Its Applications, vol. 179, pp. 16-28.
17. Oshemkov, A.A., Popelensky, F.Yu., Tuzhilin, A.A., Fomenko, A.T., Shafarevich, A.I., 2014, Course of Visual Geometry and Topology, Moscow: URSS.
18. Sosinsky, A.B., 2007, “Two-dimensional surfaces and configuration spaces of articulated mechanisms. Lecture one”, in Summer School "Modern Mathematics", Dubna: JINR. [Online]. Available: http://www.mathnet.ru/php/presentation.phtml?option_lang=rus&presentid=130.
19. Sosinsky, A.B., 2007, “Two-dimensional surfaces and configuration spaces of articulated mechanisms. Lecture two”, in Summer School “Modern Mathematics”, Dubna: JINR. [Online]. Available: http://www.mathnet.ru/php/presentation.phtml?presentid=131&option_lang=rus.
Review
For citations:
Zhitnaia M.Yu. Modeling of optimal networks in Manhattan Geometry by means of linkages. Chebyshevskii Sbornik. 2025;26(2):71-89. (In Russ.) https://doi.org/10.22405/2226-8383-2025-26-2-71-89