• coverage path planning for uavs based on enhanced exact cellular decomposition method

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1362
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
       in this paper, an enhanced exact cellular decomposition method to plan the coverage path of uavs in a polygon area is proposed. to be more specific, the contributions of the paper ar: firstly, the turning motion of uavs is shown to be less efficient from the viewpoints of route length, duration and energy. secondly, the problem of coverage path planning (cpp) in a convex polygon area is transformed to width calculation of the convex polygon, and a novel algorithm to calculate the widths of convex polygons with time complexity of o(n) is developed. the path of the least number of turns for an uav based on the widths of convex polygons is devised. thirdly, a convex decomposition algorithm for minimum width sum based on the greedy recursive method which revolves around decomposing the concave area into convex subregions is developed. it is proved that the algorithm is a polynomial time algorithm. to avoid unnecessary back and forth motion, some entirely adjacent subregions are combined. finally, comparing different weights of two joint-points, a subregion connection algorithm based on minimum traversal of weighted undirected graph is proposed to connect the coverage paths of the subregions. simulation results show that the proposed method is feasible and effective.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها