<?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.21.420-427</article-id><article-id custom-type="elpub" pub-id-type="custom">novtexmech-843</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>Collision Avoidance System Synthesis for a Group of Robots in Unsupervised Learning Paradigm</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>Dotsenko</surname><given-names>A. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Аспирант</p><p>Департамент механики и мехатроники Инженерной академии РУДН</p></bio><bio xml:lang="en"/><email xlink:type="simple">anton.dozenko@gmail.com</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>People’s Friendship University of Russia</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>07</day><month>07</month><year>2020</year></pub-date><volume>21</volume><issue>7</issue><fpage>420</fpage><lpage>427</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Commercial Publisher «New Technologies», 2020</copyright-statement><copyright-year>2020</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/843">https://mech.novtex.ru/jour/article/view/843</self-uri><abstract><p>Групповое взаимодействие роботов без коллизий является актуальной задачей в области робототехники и интеллектуальных систем управления. Предлагается новый подход к решению проблемы избегания коллизий в постановке задачи синтеза оптимальной системы управления с минимально доступной информацией. Предполагается, что роботы имеют некоторую область видимости. Если статические или динамические фазовые ограничения находятся в области видимости робота, то он может реагировать на них. По условию считается, что группа гомогенная, а система управления для достижения терминального состояния уже находится на борту роботов. Искомая система управления для разрешения коллизий отвечает за управление роботом во время нахождения ближайшего соседа в области видимости робота. В данной работе рассматривается совместное решение задачи уклонения от столкновения для двух роботов посредством одного блока управления без назначения приоритетов. Задача решается в условиях полного отсутствия информации о среде и текущем состоянии других роботов в каждый момент времени. Роботы способны лишь определить координаты ближайших соседей, за исключением угла поворота, если те находятся в области видимости рассматриваемого робота.</p><p>Описан вычислительный эксперимент с группой мобильных роботов в качестве объектов управления. В качестве аппроксиматора функции управления по состоянию была взята полносвязная искусственная нейронная сеть типа многослойный персептрон. Оптимизация весов персептрона осуществлялась в парадигме обучения без учителя, методом эволюционных стратегий. Выборка сценариев, на которой проводилась оптимизация, генерировалась случайно, в начале итерации по поколениям, в то время как качество полученных весов оценивалось на фиксированной тестовой выборке сценариев.</p><p>Результаты эксперимента подтверждают способность найденного персептрона отображать относительное состояние двух мобильных роботов в оптимальное управление, которое позволяет уйти от столкновения, что подтверждают приведенные графики из экспериментальной части.</p></abstract><trans-abstract xml:lang="en"><p>Collision avoidance is very important problem in the domain of multi-robot interaction. In this paper we propose a new approach of collision avoidance in the context of the optimal control system synthesis problem definition with minimal information available. It is assumed that robots have a certain scope within which they can interact with static and dynamic phase constraints. A group of robots is considered to be homogeneous, and control system unit for reaching terminal states already available to robots. The control system which is responsible for collision avoidance is only activated when the nearest neighbor is located in the scope of the considered robot. The first important feature of this work is the fact that the collision avoidance between two robots is reciprocal with joint control system, without assigning priorities. Another key feature of this work is the complete absence of information about the environment and the current state of other robots at given time. Robots only share information with nearest neighbors if they locate in the scope of each other. We also present a computational experiment with mobile robots as control objects. A multilayer perceptron was used to approximate the control function. Weights of the perceptron were optimized in unsupervised paradigm by an algorithm belonging to the evolutionary strategies class. At the beginning of each epoch we generate a sample of collision scenarios for optimization, while the quality criterion of the achieved weights at the end of epoch is evaluated on a fixed test sample. Experimental results demonstrate strong ability of the optimized multilayer perceptron to map the relative state of two mobile robots to controls in order to avoid collisions.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>синтез системы управления</kwd><kwd>нейронные сети</kwd><kwd>управление группой роботов</kwd><kwd>разрешение коллизий</kwd></kwd-group><kwd-group xml:lang="en"><kwd>control system synthesis</kwd><kwd>neural networks</kwd><kwd>control of a group of robots</kwd><kwd>collision avoidance</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., Hutchinson S. A. Optimal Motion Planning for Multiple Robots Having Independent Goals // IEEETrans. on Robotics and Automation. 1998. 14(6). P. 912—925.</mixed-citation><mixed-citation xml:lang="en">LaValle S. M., Hutchinson S. A. Optimal Motion Planning for Multiple Robots Having Independent Goals, IEEETrans. on Robotics and Automation, 1998, vol. 14, no. 6, pp. 912—925.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Barraquand J., Latombe J. C. Robot motion planning: A distributed representation approach // The International Journal of Robotics Research. 1991. Vol. 10, N. 6. P. 628—649.</mixed-citation><mixed-citation xml:lang="en">Barraquand J., Latombe J. C. Robot motion planning: A distributed representation approach, The International Journal of Robotics Research, 1991, vol. 10, no. 6, pp. 628—649.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Barraquand J., Latombe J. C. Controllability of Mobile Robots with Kinematic Constraints // STANFORD UNIV CA DEPT OF COMPUTER SCIENCE. 1990. N. STAN-CS-90-1317.</mixed-citation><mixed-citation xml:lang="en">Barraquand J., Latombe J. C. Controllability of Mobile Robots with Kinematic Constraints, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1990, no. STAN-CS-90-1317.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Brooks R. A., Lozano-Perez T. A subdivision algorithm in configuration space for findpath with rotation // IEEE Transactions on Systems, Man, and Cybernetics. 1985. N. 2. P. 224—233.</mixed-citation><mixed-citation xml:lang="en">Brooks R. A., Lozano-Perez T. A subdivision algorithm in configuration space for findpath with rotation, IEEE Transactions on Systems, Man, and Cybernetics, 1985, no. 2, pp. 224—233.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Faverjon B. Object level programming of industrial robots // Proceedings, 1986 IEEE International Conference on Robotics and Automation, IEEE. 1986. Vol. 3. P. 1406—1412.</mixed-citation><mixed-citation xml:lang="en">Faverjon B. Object level programming of industrial robots, Proceedings, 1986 IEEE International Conference on Robotics and Automation, IEEE, 1986, vol. 3, pp. 1406—1412.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Faverjon B., Tournassoud P. A local based approach for path planning of manipulators with a high number of degrees of freedom //Proceedings. 1987 IEEE International Conference on Robotics and Automation, IEEE. 1987. Vol. 4. P. 1152—1159.</mixed-citation><mixed-citation xml:lang="en">Faverjon B., Tournassoud P. A local based approach for path planning of manipulators with a high number of degrees of freedom, Proceedings. 1987 IEEE International Conference on Robotics and Automation, IEEE, 1987, vol. 4, pp. 1152—1159.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Barraquand J., Langlois B., Latombe J. C. Robot motion planning with many degrees of freedom and dynamic constraints // The fifth international symposium on Robotics research. 1991. P. 435—444.</mixed-citation><mixed-citation xml:lang="en">Barraquand J., Langlois B., Latombe J. C. Robot motion planning with many degrees of freedom and dynamic constraints, The Fifth International Symposium On Robotics Research, 1991, pp. 435—444.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Zhu D., Latombe J. C. New heuristic algorithms for efficient hierarchical path planning // STANFORD UNIV CA DEPT OF COMPUTER SCIENCE. 1989. N. STAN-CS-89-1279.</mixed-citation><mixed-citation xml:lang="en">Zhu D., Latombe J. C. New heuristic algorithms for efficient hierarchical path planning, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1989, no. STAN-CS-89-1279.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Parsons D., Canny J. A motion planner for multiple mobile robots // Proceedings., IEEE International Conference on Robotics and Automation, IEEE. 1990. P. 8—13.</mixed-citation><mixed-citation xml:lang="en">Parsons D., Canny J. A motion planner for multiple mobile robots, Proceedings., IEEE International Conference on Robotics and Automation, IEEE, 1990, pp. 8—13.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">LaValle S. M. Planning algorithms. Cambridge university press, 2006.</mixed-citation><mixed-citation xml:lang="en">LaValle S. M. Planning algorithms, Cambridge university press, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Sanchez G., Latombe J. C. Using a PRM planner to compare centralized and decoupled planning for multi-robot systems // Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292), IEEE. 2002. Vol. 2. P. 2112—2119.</mixed-citation><mixed-citation xml:lang="en">Sanchez G., Latombe J. C. Using a PRM planner to compare centralized and decoupled planning for multi-robot systems, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292), IEEE, 2002, vol. 2, pp. 2112—2119.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Oh J. H., Park J. H., Lim J. T. Centralized decoupled path planning algorithm for multiple robots using the temporary goal configurations // 2011 Third International Conference on Computational Intelligence, Modelling and Simulation. IEEE. 2011. P. 206—209.</mixed-citation><mixed-citation xml:lang="en">Oh J. H., Park J. H., Lim J. T. Centralized decoupled path planning algorithm for multiple robots using the temporary goal configurations //2011 Third International Conference on Computational Intelligence, Modelling and Simulation. IEEE, 2011, P. 206—209.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Van Den Berg J., Snoeyink J., Lin M. C., Manocha D. Centralized path planning for multiple robots: Optimal decoupling into sequential plans // Robotics: Science and systems. 2009. Vol. 2, N. 2(5). P. 2—3.</mixed-citation><mixed-citation xml:lang="en">Van Den Berg J., Snoeyink J., Lin M. C., Manocha D. Centralized path planning for multiple robots: Optimal decoupling into sequential plans, Robotics: Science and Systems, 2009, vol. 2, no. 2(5), P. 2—3.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Devasia S., Iamratanakul D., Chatterji G., Meyer G. Decoupled conflict-resolution procedures for decentralized air traffic control // IEEE Transactions on intelligent transportation systems. 2011. Vol. 12, N. 2. P. 422—437.</mixed-citation><mixed-citation xml:lang="en">Devasia S., Iamratanakul D., Chatterji G., Meyer G. Decoupled conflict-resolution procedures for decentralized air traffic control, IEEE Transactions on intelligent transportation systems, 2011, vol. 12, no. 2, pp. 422—437.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Ермолов И. Л., Илюхин Ю. В., Собольников С. А. Планирование траекторий движения в группе автономных мобильных коммуникационных роботов //Вестник МГТУ Станкин. 2012. № 4. С. 96—100.</mixed-citation><mixed-citation xml:lang="en">Ermolov I.L, Iljuchin Ju.V, Sobolnikov S. A. Trajectory planning for autonomous mobile communicational robots, Vestnik MGTU Stankin, 2012, no. 4, pp. 96—100 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">O’Donnell P. A., Lozano-Pérez T. Deadlock-free and collision-free coordination of two robot manipulators // ICRA. 1989. Vol. 89. P. 484—489.</mixed-citation><mixed-citation xml:lang="en">O’Donnell P. A., Lozano-Pérez T. Deadlock-free and collision-free coordination of two robot manipulators, ICRA, 1989, vol. 89, pp. 484—489.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Griswold N. C., Eem J. Control for mobile robots in the presence of moving objects //IEEE Transactions on Robotics and Automation. 1990. Vol. 6, N. 2. P. 263—268.</mixed-citation><mixed-citation xml:lang="en">Griswold N. C., Eem J. Control for mobile robots in the presence of moving objects, IEEE Transactions on Robotics and Automation, 1990, vol. 6, no. 2, pp. 263—268.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Pan T. J., Luo R. C. Motion planning for mobile robots in a dynamic environment with moving obstacles // Proceedings, IEEE International Conference on Robotics and Automation, IEEE. 1990. P. 578—583.</mixed-citation><mixed-citation xml:lang="en">Pan T. J., Luo R. C. Motion planning for mobile robots in a dynamic environment with moving obstacles, Proceedings, IEEE International Conference on Robotics and Automation, IEEE, 1990, pp. 578—583.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Rude M. Collision avoidance by using space-time representations of motion processes //Autonomous Robots. 1997, vol. 4, no. 1. P. 101—119.</mixed-citation><mixed-citation xml:lang="en">Rude M. Collision avoidance by using space-time representations of motion processes, Autonomous Robots, 1997, vol. 4, no. 1, pp. 101—119.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Erdmann M., Lozano-Perez T. On multiple moving objects //Algorithmica. 1987. Vol. 2, N. 1—4. P. 477.</mixed-citation><mixed-citation xml:lang="en">Erdmann M., Lozano-Perez T. On multiple moving objects, Algorithmica, 1987, vol. 2, no. 1—4, pp. 477.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Bennewitz M., Burgard W., Thrun S. Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots // Robotics and autonomous systems. 2002. Vol. 41, N. 2—3. P. 89—99.</mixed-citation><mixed-citation xml:lang="en">Bennewitz M., Burgard W., Thrun S. Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots, Robotics and autonomous systems, 2002, vol. 41, no. 2—3, pp. 89—99.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Clark C. M., Bretl T., Rock S. Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems // Proceedings, IEEE Aerospace Conference, IEEE. 2002. Vol. 7. P. 7.</mixed-citation><mixed-citation xml:lang="en">Clark C. M., Bretl T., Rock S. Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems, Proceedings, IEEE Aerospace Conference, IEEE, 2002, vol. 7, pp. 7.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Grossman D. D. Traffic control of multiple robot vehicles // IEEE Journal on Robotics and Automation. 1988. Vol. 4, N. 5. P. 491—497.</mixed-citation><mixed-citation xml:lang="en">Grossman D. D. Traffic control of multiple robot vehicles, IEEE Journal on Robotics and Automation, 1988, vol. 4, no. 5, pp. 491—497.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Lumelsky V. J., Harinarayan K. R. Decentralized motion planning for multiple mobile robots: The cocktail party model // Autonomous Robots. 1997. Vol. 4, N. 1. P. 121—135.</mixed-citation><mixed-citation xml:lang="en">Lumelsky V. J., Harinarayan K. R. Decentralized motion planning for multiple mobile robots: The cocktail party model, Autonomous Robots, 1997, vol. 4, no. 1, pp. 121—135.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Wang J., Beni G. Distributed computing problems in cellular robotic systems // EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications, IEEE. 1990. P. 819—826.</mixed-citation><mixed-citation xml:lang="en">Wang J., Beni G. Distributed computing problems in cellular robotic systems, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications, IEEE, 1990, pp. 819—826.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Kato S., Nishiyama S., Takeno J. Coordinating mobile robots by applying traffic rules // Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE. 1992. Vol. 3. P. 1535—1541.</mixed-citation><mixed-citation xml:lang="en">Kato S., Nishiyama S., Takeno J. Coordinating mobile robots by applying traffic rules, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, 1992, vol. 3, pp. 1535—1541.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Koren Y., Borenstein J. Potential field methods and their inherent limitations for mobile robot navigation // ICRA. 1991. Vol. 2. P. 1398—1404.</mixed-citation><mixed-citation xml:lang="en">Koren Y., Borenstein J. Potential field methods and their inherent limitations for mobile robot navigation, ICRA, 1991, vol. 2, pp. 1398—1404.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Kapadia M., Singh S., Hewlett W., Reinman G., Faloutsos P. Parallelized egocentric fields for autonomous navigation // The Visual Computer. 2012. Vol. 28, N. 12. P. 1209—1227.</mixed-citation><mixed-citation xml:lang="en">Kapadia M., Singh S., Hewlett W., Reinman G., Faloutsos P. Parallelized egocentric fields for autonomous navigation, The Visual Computer, 2012, vol. 28, no. 12, pp. 1209—1227.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Wang L., Li Z., Wen C., He R., Guo F. Reciprocal Collision Avoidance for Nonholonomic Mobile Robots // 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV). IEEE. 2018. P. 371—376.</mixed-citation><mixed-citation xml:lang="en">Wang L., Li Z., Wen C., He R., Guo F. Reciprocal Collision Avoidance for Nonholonomic Mobile Robots, 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV), IEEE, 2018, pp. 371—376.</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Huang X., Zhou L., Guan Z., Li Z., Wen C., He, R. Generalized Reciprocal Collision Avoidance for Non-holonomic Robots // 2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE. 2019. P. 1623—1628.</mixed-citation><mixed-citation xml:lang="en">Huang X., Zhou L., Guan Z., Li Z., Wen C., He R. Generalized Reciprocal Collision Avoidance for Non-holonomic Robots, 2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA), IEEE, 2019, pp. 1623—1628.</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Long P., Liu W., Pan J. Deep-learned collision avoidance policy for distributed multiagent navigation // IEEE Robotics and Automation Letters. 2017. Vol. 2, N. 2. P. 656—663.</mixed-citation><mixed-citation xml:lang="en">Long P., Liu W., Pan J. Deep-learned collision avoidance policy for distributed multiagent navigation, IEEE Robotics and Automation Letters, 2017, vol. 2, no. 2, pp. 656—663.</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">Matarić M. J. Reinforcement learning in the multi-robot domain // Robot colonies. Springer, Boston, MA, 1997.P. 73—83.</mixed-citation><mixed-citation xml:lang="en">Matarić M. J. Reinforcement learning in the multi-robot domain, Robot colonies, Springer, Boston, MA, 1997, pp. 73—83.</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">Stone P., Veloso M. Multiagent systems: A survey from a machine learning perspective // Autonomous Robots. 2000. Vol. 8, N. 3. P. 345—383.</mixed-citation><mixed-citation xml:lang="en">Stone P., Veloso M. Multiagent systems: A survey from a machine learning perspective, Autonomous Robots, 2000, vol. 8, no. 3, pp. 345—383.</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">Yang E., Gu D. Multiagent reinforcement learning for multi-robot systems: A survey. tech. rep, 2004.</mixed-citation><mixed-citation xml:lang="en">Yang E., Gu D. Multiagent reinforcement learning for multi-robot systems: A survey. tech. rep, 2004.</mixed-citation></citation-alternatives></ref><ref id="cit35"><label>35</label><citation-alternatives><mixed-citation xml:lang="ru">Panait L., Luke S. Cooperative multi-agent learning: The state of the art // Autonomous agents and multi-agent systems. 2005. Vol. 11, N. 3. P. 387—434.</mixed-citation><mixed-citation xml:lang="en">Panait L., Luke S. Cooperative multi-agent learning: The state of the art, Autonomous agents and multi-agent systems, 2005, vol. 11, no. 3, pp. 387—434.</mixed-citation></citation-alternatives></ref><ref id="cit36"><label>36</label><citation-alternatives><mixed-citation xml:lang="ru">Godoy J. E., Karamouzas I., Guy S. J., Gini M. Adaptive learning for multi-agent navigation // Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. 2015. P. 1577—1585.</mixed-citation><mixed-citation xml:lang="en">Godoy J. E., Karamouzas I., Guy S. J., Gini M. Adaptive learning for multi-agent navigation, Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015, pp. 1577—1585.</mixed-citation></citation-alternatives></ref><ref id="cit37"><label>37</label><citation-alternatives><mixed-citation xml:lang="ru">Kretzschmar H., Spies M., Sprunk C., Burgard W. Socially compliant mobile robot navigation via inverse reinforcement learning // The International Journal of Robotics Research. 2016. Vol. 35, N. 11. P. 1289—1307.</mixed-citation><mixed-citation xml:lang="en">Kretzschmar H., Spies M., Sprunk C., Burgard W. Socially compliant mobile robot navigation via inverse reinforcement learning, The International Journal of Robotics Research, 2016, vol. 35, no. 11, pp. 1289—1307.</mixed-citation></citation-alternatives></ref><ref id="cit38"><label>38</label><citation-alternatives><mixed-citation xml:lang="ru">Dotsenko A., Diveev A., Cevallos J. P. C. Collision avoidance at swarm regrouping using modified network operator method with various number of arguments // 2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA), IEEE. 2019. P. 768—773.</mixed-citation><mixed-citation xml:lang="en">Dotsenko A., Diveev A., Cevallos J. P. C. Collision avoidance at swarm regrouping using modified network operator method with various number of arguments, 2019 14th IEEE Conference on Industrial Electronics and Applications (ICIEA), IEEE, 2019, pp. 768—773.</mixed-citation></citation-alternatives></ref><ref id="cit39"><label>39</label><citation-alternatives><mixed-citation xml:lang="ru">Glorot X., Bengio Y. Understanding the difficulty of training deep feedforward neural networks // Proceedings of the thirteenth international conference on artificial intelligence and statistics. 2010. P. 249—256.</mixed-citation><mixed-citation xml:lang="en">Glorot X., Bengio Y. Understanding the difficulty of training deep feedforward neural networks, Proceedings of the thirteenth international conference on artificial intelligence and statistics, 2010, pp. 249—256.</mixed-citation></citation-alternatives></ref><ref id="cit40"><label>40</label><citation-alternatives><mixed-citation xml:lang="ru">Salimans T., Ho J., Chen X., Sidor, S., Sutskever I. Evolution strategies as a scalable alternative to reinforcement learning // arXiv preprint arXiv:1703.03864, 2017.</mixed-citation><mixed-citation xml:lang="en">Salimans T., Ho J., Chen X., Sidor S., Sutskever I. Evolution strategies as a scalable alternative to reinforcement learning, arXiv preprint arXiv:1703.03864, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit41"><label>41</label><citation-alternatives><mixed-citation xml:lang="ru">Brockhoff D., Auger A., Hansen N., Arnold D. V., Hohm T. Mirrored sampling and sequential selection for evolution strategies // International Conference on Parallel Problem Solving from Nature. Springer, Berlin, Heidelberg. 2010. P. 11—21.</mixed-citation><mixed-citation xml:lang="en">Brockhoff D., Auger A., Hansen N., Arnold D. V., Hohm T. Mirrored sampling and sequential selection for evolution strategies, International Conference on Parallel Problem Solving from Nature, Springer, Berlin, Heidelberg, 2010, pp. 11—21.</mixed-citation></citation-alternatives></ref><ref id="cit42"><label>42</label><citation-alternatives><mixed-citation xml:lang="ru">Wierstra D., Schaul T., Glasmachers T., Sun Y., Peters J., Schmidhuber J. Natural evolution strategies // The Journal of Machine Learning Research, 2014. Vol. 15, N. 1. P. 949—980.</mixed-citation><mixed-citation xml:lang="en">Wierstra D., Schaul T., Glasmachers T., Sun Y., Peters J., Schmidhuber J. Natural evolution strategies, The Journal of Machine Learning Research, 2014, vol. 15, no. 1, pp. 949—980.</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>
