مشروع البحث:
Social Graphs and Their Applications to Robotics

thumbnail.project.alt
المساهمين
الممولين
رقم التعريف
1302
الباحث
فاطمة علي سعد الوافي
المشرفين
منشورات
وحدات تنظيمية
الوصف
Therefore, we have developed algorithms based on VG called the Central algorithm (CA) and its associate, the Optimisation Central algorithm (OCA). Contrary to VG, CA selects a relatively smaller number of vertices using the so-called Central Baseline (CB), in which the obstacles that intersect with the baseline only are considered, and it generates waypoints, travelling, through which the robots can avoid obstacles to reach their targets. Both algorithms employ a smaller number of obstacles, and this reduces the computational complexity of finding the optimal paths. Thus, it can create paths relatively fast and is convenient for path planning applications in obstacle-rich environments, whilst retaining the advantages of the VG. CA and OCA have made finding the shortest paths simpler because the process of path planning is equipped with pre-calculated step-by-step instructions. All these features make it more efficient than the VG.
الكلمات الدالة
Applications to Robotics