Initial and Target Nodes Planning for Multi Mobile Robots
الكلمات المفتاحية:
multi mobile robots، target nodeالملخص
A novel algorithm for planning initial and target nodes for multi mobile robots in complex environment where all robots have the same functionality is presented. The algorithm assigns an initial node to each target node based on a ranking method. The ranking method takes into consideration the path length between the two nodes, the effort of the robot while moving between the two nodes, and the possibility to block other robots movements while moving between the two nodes. The algorithm also tries to solve collision between robots using the proposed ranking method and taking robots performance into consideration.
التنزيلات
Key Dates
منشور
2011-12-01
إصدار
القسم
Articles
الرخصة
هذا العمل مرخص بموجب Creative Commons Attribution 4.0 International License.
The Journal of Engineering and Sustainable Development is an open-access journal that all contents are free of charge. Articles of this journal are licensed under the terms of the Creative Commons Attribution International Public License CC-BY 4.0 (https://creativecommons.org/licenses/by/4.0/legalcode) that licensees are unrestrictly allowed to search, download, share, distribute, print, or link to the full texts of the articles, crawl them for indexing and reproduce any medium of the articles provided that they give the author(s) proper credits (citation). The journal allows the author(s) to retain the copyright of their published article.
Creative Commons-Attribution (BY) 
كيفية الاقتباس
Initial and Target Nodes Planning for Multi Mobile Robots. (2011). مجلة الهندسة والتنمية المستدامة, 15(4), 61-76. https://jeasd.uomustansiriyah.edu.iq/index.php/jeasd/article/view/1308
