One of the fundamental problems in robotics is determining an optimal path involving all points of a given area of interest while avoiding sub-areas with specific characteristics (e.g., obstacles, no-fly zones, etc.). In the literature, this problem is often referred to as coverage path planning (CPP), but can also be…