<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mireabulletin</journal-id><journal-title-group><journal-title xml:lang="ru">Russian Technological Journal</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Technological Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-3210</issn><issn pub-type="epub">2500-316X</issn><publisher><publisher-name>RTU MIREA</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32362/2500-316X-2023-11-6-16-27</article-id><article-id custom-type="elpub" pub-id-type="custom">mireabulletin-793</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>РОБОТИЗИРОВАННЫЕ КОМПЛЕКСЫ И СИСТЕМЫ. ТЕХНОЛОГИИ ДИСТАНЦИОННОГО ЗОНДИРОВАНИЯ НЕРАЗРУШАЮЩЕГО КОНТРОЛЯ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MULTIPLE ROBOTS (ROBOTIC CENTERS) AND SYSTEMS. REMOTE SENSING AND NON-DESTRUCTIVE TESTING</subject></subj-group></article-categories><title-group><article-title>Особенности и перспективы применения метода поисковых случайных деревьев для планирования перемещений автономных роботов</article-title><trans-title-group xml:lang="en"><trans-title>Features and perspectives of application of the rapidly exploring random tree method for motion planning of autonomous robotic manipulators</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0007-9227-6184</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Голубов</surname><given-names>В. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Golubov</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Голубов Владимир Васильевич, аспирант, кафедра проблем управления Института искусственного интеллекта </p><p>119454, Москва, пр-т Вернадского, д. 78</p></bio><bio xml:lang="en"><p>Vladimir V. Golubov, Postgraduate Student, Department of Problems Control, Institute of Artificial Intelligence </p><p>78, Vernadskogo pr., Moscow, 119454</p></bio><email xlink:type="simple">golubov@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6297-8894</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Манько</surname><given-names>С. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Manko</surname><given-names>S. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Манько Сергей Викторович, д.т.н., профессор, кафедра проблем управления Института искусственного интеллекта. Лауреат премии Правительства Российской Федерации в области образования, Член научного Совета по робототехнике и мехатронике Российской академии наук. Scopus Author ID 55761014700 </p><p>119454, Москва, пр-т Вернадского, д. 78</p></bio><bio xml:lang="en"><p>Sergey V. Manko, Dr. Sci. (Eng.), Professor, Department of Problems Control, Institute of Artificial Intelligence. Laureate of the Government Prize of the Russian Federation in the field of education, Member of the Scientific Council on Robotics and Mechatronics of the Russian Academy of Sciences. Scopus Author ID 55761014700 </p><p>78, Vernadskogo pr., Moscow, 119454</p></bio><email xlink:type="simple">manko@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>МИРЭА – Российский технологический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>MIREA – Russian Technological University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>13</day><month>12</month><year>2023</year></pub-date><volume>11</volume><issue>6</issue><fpage>16</fpage><lpage>27</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Голубов В.В., Манько С.В., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Голубов В.В., Манько С.В.</copyright-holder><copyright-holder xml:lang="en">Golubov V.V., Manko S.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rtj-mirea.ru/jour/article/view/793">https://www.rtj-mirea.ru/jour/article/view/793</self-uri><abstract><sec><title>Цели</title><p>Цели. Статья посвящена анализу особенностей одного из наиболее многообещающих подходов к решению задач планирования перемещений автономных роботов различных типов и назначения с помощью метода поисковых случайных деревьев. Показано, что развитие современной робототехники неразрывно сопряжено с совершенствованием конструкций создаваемых образцов, для которых размещение манипулятора на подвижной платформе становится типовым вариантом компоновки. Целью работы является оценка перспектив использования метода поисковых случайных деревьев в качестве конструктивной основы для создания универсального планировщика перемещений мобильных и манипуляционных роботов, включая автономные робототехнические системы с манипулятором на подвижной платформе.</p></sec><sec><title>Методы</title><p>Методы. Объектом проводимых исследований является метод поисковых случайных деревьев RRT (rapidly exploring random trees) и его известные модификации RRT* и RRT-Connect. Оценка эффективности их прикладного применения для решения задач планирования перемещений роботов различных типов проводилась с помощью методов компьютерного и натурного моделирования.</p></sec><sec><title>Результаты</title><p>Результаты. На основе обзора литературы и по итогам проведенных исследований показано, что широкие возможности метода поисковых случайных деревьев позволяют обеспечить решение задач планирования перемещений не только для мобильных и манипуляционных роботов, но и для робототехнических систем с размещением бортового манипулятора (в т.ч. с избыточной или реконфигурируемой структурой) на транспортной платформе. Эффективность прикладного применения метода поисковых случайных деревьев подтверждается примерами моделирования мобильной платформы с бортовым манипулятором и результатами натурных экспериментов с опытным образцом реконфигурируемого мехатронно-модульного робота «АРАКС» (РТУ МИРЭА, Россия). Экспериментально установлено и теоретически обосновано, что конечная размерность дерева поиска, а, следовательно, и время его построения, вплоть до достижения заданного целевого состояния, во многом определяются величиной фактора роста.</p></sec><sec><title>Выводы</title><p>Выводы. Обобщение полученных результатов открывает реальные перспективы использования метода поисковых случайных деревьев в качестве конструктивной основы не только для создания универсальных средств планирования перемещений мобильных робототехнических систем с бортовым манипулятором, но и для решения задач автоматизации стыковки автономных подвижных платформ.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The work analyzes features of one of the most promising approaches to solve the problems for motion planning of autonomous robotic manipulators of various types and purposes using the rapidly exploring random tree (RRT) method. The development of modern robotics is shown to be inextricably linked with the improvement of the designs of the created samples, for which the placement of a manipulator on platform becomes a typical layout option. Prospects for using the RRT method as a constructive basis for creating a universal motion planner are evaluated for mobile and robotic manipulators, including autonomous robotic systems with a manipulator on a moving platform.</p></sec><sec><title>Methods</title><p>Methods. The object of the research is the RRT method and its well-known modifications RRT* and RRT-Connect. The effectiveness of applying such methods for solving problems associated with planning the motions of robotic manipulators of various types was evaluated using computer and natural simulation methods.</p></sec><sec><title>Results</title><p>Results. Based on a review of the literature and the results of the research, the wide possibilities of the RRT method can be used for solving motion planning problems not only for mobile and robotic manipulators, but also for robotic systems on whose transport platform an onboard manipulator has been installed (including those having a redundant or reconfigurable structure). The effectiveness of the applied application of the RRT method is confirmed by examples of modeling a mobile platform with an onboard manipulator and the results of full-scale experiments with a prototype of the ARAKS reconfigurable mechatronic-modular robotic manipulators (RTU MIREA, Russia). It can be experimentally demonstrated and theoretically substantiated that the final dimension of the exploring tree, and hence the time of its construction up to reaching a given target state, is largely determined by the value of the growth factor.</p></sec><sec><title>Conclusions</title><p>Conclusions. The generalization of the results obtained opens up real prospects for using the RRT method as a constructive basis not only for creating universal means for motion planning mobile robotic systems with an onboard manipulator, but also for solving the problems of automating the docking of autonomous mobile platforms.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>автономный робот</kwd><kwd>интеллектуальное управление</kwd><kwd>реконфигурируемый робот</kwd><kwd>изменяемая кинематическая структура</kwd><kwd>метод поисковых случайных деревьев</kwd></kwd-group><kwd-group xml:lang="en"><kwd>autonomous robotic manipulator</kwd><kwd>intelligent control</kwd><kwd>reconfigurable robotic manipulator</kwd><kwd>variable kinematic structure</kwd><kwd>rapidly exploring random tree method</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Wang X., Luo X., Han B., Chen Y., Liang G., Zheng K. Collision-free path planning method for robots based on an improved rapidly-exploring random tree algorithm. Appl. Sci. 2020;10(4):1381. http://doi.org/10.3390/app10041381</mixed-citation><mixed-citation xml:lang="en">Wang X., Luo X., Han B., Chen Y., Liang G., Zheng K. Collision-free path planning method for robots based on an improved rapidly-exploring random tree algorithm. Appl. Sci. 2020;10(4):1381. http://doi.org/10.3390/app10041381</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Noreen I., Khan A., Habib Z. Optimal path planning using RRT* based approaches: a survey and future directions. Int. J. Adv. Computer Sci. Appl. 2016;7(11). https://dx.doi.org/10.14569/IJACSA.2016.071114</mixed-citation><mixed-citation xml:lang="en">Noreen I., Khan A., Habib Z. Optimal path planning using RRT* based approaches: a survey and future directions. Int. J. Adv. Computer Sci. Appl. 2016;7(11). https://dx.doi.org/10.14569/IJACSA.2016.071114</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">LaValle S.M., Kuffner J.J. Rapidly-exploring random trees: Progress and prospects. Workshop on the Algorithmic Foundations of Robotics. 2000;293–308. URL: http://lavalle.pl/papers/LavKuf01.pdf</mixed-citation><mixed-citation xml:lang="en">LaValle S.M., Kuffner J.J. Rapidly-exploring random trees: Progress and prospects. Workshop on the Algorithmic Foundations of Robotics. 2000;293–308. URL: http://lavalle.pl/papers/LavKuf01.pdf</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">LaValle S.M., Kuffner J.J. Randomized Kinodynamic Planning. Int. J. Rob. Res. 2001;20(5):378–400. https://doi.org/10.1177/02783640122067453</mixed-citation><mixed-citation xml:lang="en">LaValle S.M., Kuffner J.J. Randomized Kinodynamic Planning. Int. J. Rob. Res. 2001;20(5):378–400. https://doi.org/10.1177/02783640122067453</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cao X., Zou X., Jia Ch., Chen M., Zeng Z. RRT-based path planning for an intelligent litchi-picking manipulator. Computers and Electronics in Agriculture. 2019;156:105–118. https://doi.org/10.1016/j.compag.2018.10.031</mixed-citation><mixed-citation xml:lang="en">Cao X., Zou X., Jia Ch., Chen M., Zeng Z. RRT-based path planning for an intelligent litchi-picking manipulator. Computers and Electronics in Agriculture. 2019;156:105–118. https://doi.org/10.1016/j.compag.2018.10.031</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Rybus T. Point-to-Point Motion Planning of a Free-Floating Space Manipulator Using the Rapidly-Exploring Random Trees (RRT) Method. Robotica. 2020;38(6):957–982. https://doi.org/10.1017/S0263574719001176</mixed-citation><mixed-citation xml:lang="en">Rybus T. Point-to-Point Motion Planning of a Free-Floating Space Manipulator Using the Rapidly-Exploring Random Trees (RRT) Method. Robotica. 2020;38(6):957–982. https://doi.org/10.1017/S0263574719001176</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Karaman S., Frazzoli E. Sampling-based algorithms for optimal motion planning. Int. J. Robotics Res. 2011;30(7): 846–894. https://doi.org/10.1177/0278364911406761</mixed-citation><mixed-citation xml:lang="en">Karaman S., Frazzoli E. Sampling-based algorithms for optimal motion planning. Int. J. Robotics Res. 2011;30(7): 846–894. https://doi.org/10.1177/0278364911406761</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Solovey K., Janson L., Schmerling E., Frazzoli E., Pavone M. Revisiting the Asymptotic Optimality of RRT*. 2020. arXiv: 1909.09688v2. 13 p. https://doi.org/10.48550/arXiv.1909.09688</mixed-citation><mixed-citation xml:lang="en">Solovey K., Janson L., Schmerling E., Frazzoli E., Pavone M. Revisiting the Asymptotic Optimality of RRT*. 2020. arXiv: 1909.09688v2. 13 p. https://doi.org/10.48550/arXiv.1909.09688</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Noreen I., Khan A., Habib Z. Optimal path planning using RRT* based approaches: a survey and future directions. Int. J. Adv. Computer Sci. Appl. 2016;7(11):97–107. https://doi.org/10.14569/IJACSA.2016.071114</mixed-citation><mixed-citation xml:lang="en">Noreen I., Khan A., Habib Z. Optimal path planning using RRT* based approaches: a survey and future directions. Int. J. Adv. Computer Sci. Appl. 2016;7(11):97–107. https://doi.org/10.14569/IJACSA.2016.071114</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Adiyatov O., Varol H.A. A novel RRT*-based algorithm for motion planning in Dynamic environments. In: 2017 IEEE International Conference on Mechatronics and Automation (ICMA). 2017. P. 1416–1421. https://doi.org/10.1109/ICMA.2017.8016024</mixed-citation><mixed-citation xml:lang="en">Adiyatov O., Varol H.A. A novel RRT*-based algorithm for motion planning in Dynamic environments. In: 2017 IEEE International Conference on Mechatronics and Automation (ICMA). 2017. P. 1416–1421. https://doi.org/10.1109/ICMA.2017.8016024</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Yuan Ch., Liu G., Zhang W., Pan X. An efficient RRT cache method in dynamic environments for path planning. Rob. Auton. Syst. 2020;131(9):103595. https://doi.org/10.1016/j.robot.2020.103595</mixed-citation><mixed-citation xml:lang="en">Yuan Ch., Liu G., Zhang W., Pan X. An efficient RRT cache method in dynamic environments for path planning. Rob. Auton. Syst. 2020;131(9):103595. https://doi.org/10.1016/j.robot.2020.103595</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Khatib O. Real-time obstacle avoidance for manipulators and mobile robots. The Int. J. Rob. Res. 1986;5(1): 90–98.</mixed-citation><mixed-citation xml:lang="en">Khatib O. Real-time obstacle avoidance for manipulators and mobile robots. The Int. J. Rob. Res. 1986;5(1): 90–98.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Mashayekhi R., Idris M.Y.I., Anisi M.H., Ahmedy I., Ali I. Informed RRT*-Connect: An Asymptotically Optimal Single-Query Path Planning Method. IEEE Access. 2020;8:19842–19852. http://doi.org/10.1109/ACCESS.2020.2969316</mixed-citation><mixed-citation xml:lang="en">Mashayekhi R., Idris M.Y.I., Anisi M.H., Ahmedy I., Ali I. Informed RRT*-Connect: An Asymptotically Optimal Single-Query Path Planning Method. IEEE Access. 2020;8:19842–19852. http://doi.org/10.1109/ACCESS.2020.2969316</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
