Abstract

Path planning is one of the most important issues in the robotics field, being applied in many domains ranging from aerospace technology and military tasks to manufacturing and agriculture. Path planning is a branch of autonomous navigation. In autonomous navigation, dynamic decisions about the path have to be taken while the robot moves towards its goal. Among the navigation area, an important class of problems is Coverage Path Planning (CPP). The CPP technique is associated with determining a collision-free path that passes through all viewpoints in a specific area. This paper presents a method to perform CPP in 3D environment for Unmanned Aerial Vehicles (UAVs) applications, namely 3D dynamic for CPP applications (3DD-CPP). The proposed method can be deployed in an unknown environment through a combination of linear optimization and heuristics. A model to estimate cost matrices accounting for UAV power usage is proposed and evaluated for a few different flight speeds. As linear optimization methods can be computationally demanding to be used on-board a UAV, this work also proposes a distributed execution of the algorithm through fog-edge computing. Results showed that 3DD-CPP had a good performance in both local execution and fog-edge for different simulated scenarios. The proposed heuristic is capable of re-optimization, enabling execution in environments with local knowledge of the environments.

Highlights

  • Path planning is one of the essential issues in the robotics field

  • Path planning is a branch of autonomous navigation problem

  • Dynamic decisions about the path have to be taken simultaneously while the robot moves towards its goal [5]

Read more

Summary

Introduction

Path planning is one of the essential issues in the robotics field. According to Reference [1], it refers to find an optimal route for an object that moves from a start point to a final one. Three-dimensional path planning techniques are crucial for the navigation of UAVs in complex and highly dynamic environments It is not possible to use the linear optimization model directly in an unknown environment This is related to the fact that the linear model has no way of performing planning for the unknown parts of the space [21], requiring additional mechanisms to deal with the addition or removal of nodes to be visited, avoiding a full optimization of point set from scratch. This opens a space for the combination of optimization methods with heuristics to search for sub-optimal paths online while the task is performed. Some applications may require the shortest path, while others may require less energy consumption

Consider local conditions
Space Representation
Optimization Methodology
Energy Cost Estimation
Heuristics Update
Results and Discussions
Methods
Optimization
Method
Conclusions and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call