![]() ![]() The path planning for 3D multi-Unmanned Aerial Vehicle (UAV) is very difficult as the UAV has to find a viable path between start point and goal point with minimum complexity. Many researchers have proposed various deterministic and meta-heuristic algorithm to obtain better results for the path planning problem. This task is an NP-hard problem and can be modeled as an optimization problem. Robot path planning is essential to identify the most feasible path between a start point and goal point by avoiding any collision in the given environment.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |