<?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">novtexmech</journal-id><journal-title-group><journal-title xml:lang="ru">Мехатроника, автоматизация, управление</journal-title><trans-title-group xml:lang="en"><trans-title>Mekhatronika, Avtomatizatsiya, Upravlenie</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1684-6427</issn><issn pub-type="epub">2619-1253</issn><publisher><publisher-name>Commercial Publisher «New Technologies»</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17587/mau.25.19-30</article-id><article-id custom-type="elpub" pub-id-type="custom">novtexmech-1486</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>ROBOT, MECHATRONICS AND ROBOTIC SYSTEMS</subject></subj-group></article-categories><title-group><article-title>Исследование возможностей использования метода поисковых случайных деревьев в решении задач планирования перемещений автономных роботов</article-title><trans-title-group xml:lang="en"><trans-title>Research of the Possibilities of Using a Rapidly Exploring Random Tree Algorithm in Solving Problems of Movement Planning of Autonomous Robots</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><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>Москва.</p></bio><bio xml:lang="en"><p>Golubov Vladimir V., Postgraduate Student, Senior Lecturer, </p><p>Moscow.</p></bio><email xlink:type="simple">golubov@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><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>С. В. Манько, д-р техн. наук, проф., </p><p>Москва.</p></bio><bio xml:lang="en"><p>Manko S. V., Dr. in Ciences (Engineering), Professor,</p><p>Moscow.</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>2024</year></pub-date><pub-date pub-type="epub"><day>10</day><month>01</month><year>2024</year></pub-date><volume>25</volume><issue>1</issue><fpage>19</fpage><lpage>30</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Commercial Publisher «New Technologies», 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Commercial Publisher «New Technologies»</copyright-holder><copyright-holder xml:lang="en">Commercial Publisher «New Technologies»</copyright-holder><license xlink:href="https://mech.novtex.ru/jour/about/submissions#copyrightNotice" xlink:type="simple"><license-p>https://mech.novtex.ru/jour/about/submissions#copyrightNotice</license-p></license></permissions><self-uri xlink:href="https://mech.novtex.ru/jour/article/view/1486">https://mech.novtex.ru/jour/article/view/1486</self-uri><abstract><p>Проанализированы особенности и дана оценка перспектив применения метода поисковых случайных деревьев для планирования перемещений автономных роботов. Отмечается, что расширение областей прикладного применения современной робототехники неразрывно сопряжено с повышением уровня функциональных возможностей и совершенствованием конструкций создаваемых образцов, для которых размещение манипулятора на мобильной платформе становится типовым вариантом компоновки. На основе обзора литературы и обобщения экспериментальных данных показано, что использование метода поисковых случайных деревьев и его базовых модификаций открывает принципиальную возможность разработки универсального планировщика движений для мобильных и манипуляционных роботов, включая робототехнические системы с размещением бортового манипулятора (в том числе с избыточной или реконфигурируемой структурой) на транспортной платформе. По итогам проведенного анализа установлено, что эффективность применения метода поисковых случайных деревьев во многом определяется задаваемым параметром фактора роста. Предложена децентрализованная версия метода поисковых деревьев со встречным ростом, позволяющая обеспечить планирование перемещений автономных мобильных роботов по ходу их взаимного сближения и последующей стыковки. Принципиальная реализуемость автоматической стыковки автономных роботов в среде с препятствиями подтверждается результатами тестовых натурных испытаний.</p></abstract><trans-abstract xml:lang="en"><p>The article is devoted to the analysis of features and evaluation of the prospects for using the RRT method in the problem of motion planning for autonomous robots. It is noted that the expansion of the areas of application of modern robotics is inextricably linked with an increase in the level of functionality and improvement of the designs of the created samples, for which the placement of a manipulator on a mobile platform becomes a typical layout. Based on a review of the literature and generalization of experimental data, it is shown that the use of the RRT method and its modifications opens up the fundamental possibility of developing a universal motion planner for mobile and manipulative robots, including systems with a manipulator on a mobile platform, as well as systems with a redundant or reconfigurable structure. Based on the results of the analysis, it was found that the effectiveness of the RRT method is largely determined by the declared parameter of the growth factor. A decentralized variant of the counter-growth RRT method is proposed, which makes it possible to plan the movements of autonomous mobile robots in the process of their mutual approach and subsequent docking. The fundamental possibility of automatic docking of autonomous robots in an environment with obstacles is confirmed by the results of a full-scale experiment.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>автономный робот</kwd><kwd>интеллектуальное управление</kwd><kwd>групповое управление</kwd><kwd>многоагентная робототехническая система</kwd><kwd>автоматическая стыковка</kwd><kwd>метод поисковых случайных деревьев со встречным ростом</kwd></kwd-group><kwd-group xml:lang="en"><kwd>autonomous robot</kwd><kwd>intelligent control</kwd><kwd>group control</kwd><kwd>multi-agent robotic system</kwd><kwd>automatic docking</kwd><kwd>counter-growth search in random exploring 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">LaValle S. M., Kuffner J. J. Rapidly-exploring random trees: Progress and prospects // 2000 Workshop on the Algorithmic Foundations of Robotics. 2000. P. 293—308.</mixed-citation><mixed-citation xml:lang="en">LaValle S. M., Kuffner J. J. Rapidly-exploring random trees: Progress and prospects, 2000 Workshop on the Algorithmic Foundations of Robotics, 2000, pp. 293—308.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">LaValle S. M., Kuffner J. J. Randomized Kinodynamic Planning // International Journal of Robotics Research. 2001. Vol. 20, N. 5. P. 378—400.</mixed-citation><mixed-citation xml:lang="en">LaValle S. M., Kuffner J. J. Randomized Kinodynamic Planning, International Journal of Robotics Research, 2001, vol. 20, no. 5, pp. 378—400.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Karaman S., Frazzoli E. Sampling-based algorithms for optimal motion planning // International Journal of Robotics Research. 2011. Vol. 30, N. 7. P. 846—894.</mixed-citation><mixed-citation xml:lang="en">Karaman S., Frazzoli E. Sampling-based algorithms for optimal motion planning, International Journal of Robotics Research, 2011, vol. 30, no. 7, pp. 846—894.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</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 IEEE International Conference on Robotics and Automation. 2020. P. 2189—2195.</mixed-citation><mixed-citation xml:lang="en">Solovey K., Janson L., Schmerling E., Frazzoli E., Pavone M. Revisiting the asymptotic optimality of RRT, 2020 IEEE International Conference on Robotics and Automation, 2020, pp. 2189—2195.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Adiyatov O., Varol H. A. A novel RRT-based algorithm for motion planning in Dynamic environments // 2017 IEEE International Conference on Mechatronics and Automation. 2017. P. 1416—1421.</mixed-citation><mixed-citation xml:lang="en">Adiyatov O., Varol H. A. A novel RRT-based algorithm for motion planning in Dynamic environments, 2017 IEEE International Conference on Mechatronics and Automation, 2017, pp. 1416—1421.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Chengren Y., Guifeng L., Wenqun Z., Xinglong P. An efficient RRT cache method in dynamic environments for path planning // Robotics and Autonomous Systems. 2020. Vol. 131.</mixed-citation><mixed-citation xml:lang="en">Chengren Y., Guifeng L., Wenqun Z., Xinglong P. An efficient RRT cache method in dynamic environments for path planning, Robotics and Autonomous Systems, 2020, vol. 131.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Qureshi A. Ayaz Y. Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments // Robotics and Autonomous Systems. 2015. Vol. 68. P. 1—11.</mixed-citation><mixed-citation xml:lang="en">Qureshi A., Ayaz Y. Intelligent bidirectional rapidlyexploring random trees for optimal motion planning in complex cluttered environments, Robotics and Autonomous Systems, 2015, vol. 68, pp. 1—11.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">LaValle S. M., Kuffner J. J. RRT-Connect: An Efficient Approach to Single-Query Path Planning // IEEE International Conference on Robotics and Automation. Vol. 2. P. 995—1001.</mixed-citation><mixed-citation xml:lang="en">LaValle S. M., Kuffner J. J. RRT-Connect: An Efficient Approach to Single-Query Path Planning, IEEE International Conference on Robotics and Automation, vol. 2, pp. 995—1001.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Manko S. V., Lokhin V. M., Diane S. K. Pototype multiagent robotic debris removal system: principles of development and experimental studies // Russian Technological Journal. 2022. Vol. 10(6). P. 28—41 (in Russian).</mixed-citation><mixed-citation xml:lang="en">Manko S. V., Lokhin V. M., Diane S. K. Pototype multiagent robotic debris removal system: principles of development and experimental studies, Russian Technological Journal, 2022, vol. 10(6), pp. 28—41 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Seo J., Paik J., Yim M. Modular reconfigurable robotics // Annual Review of Control, Robotics, and Autonomous Systems. 2019. Vol. 2. P. 63—88</mixed-citation><mixed-citation xml:lang="en">Seo J., Paik J., Yim M. Modular reconfigurable robotics. Annual Review of Control, Robotics, and Autonomous Systems, 2019, vol. 2, pp. 63—88</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Liu C., Lin Q., Kim H., Yim M. SMORES-EP, a modular robot with parallel self-assembly // Autonomous Robots. 2023. Vol. 47, N. 2. P. 211—228.</mixed-citation><mixed-citation xml:lang="en">Liu C., Lin Q., Kim H., Yim M. SMORES-EP, a modular robot with parallel self-assembly, Autonomous Robots, 2023, vol. 47, no. 2, pp. 211—228.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Vahrenkamp N., Kuhn E., Asfour T., Dillmann R. Planning Multi-Robot Grasping Motions // 2010 10th IEEE-RAS International Conference on Humanoid Robots. Humanoids, 2010. P. 593—600.</mixed-citation><mixed-citation xml:lang="en">Vahrenkamp N., Kuhn E., Asfour T., Dillmann R. Planning Multi-Robot Grasping Motions, 2010 10th IEEE-RAS International Conference on Humanoid Robots, Humanoids, 2010, pp. 593—600.</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>
