Coverage Path Planning (CPP) is a problem of path computation with minimal length that guarantees to scan the entire area of interest. CPP finds its application in diverse fields like cartography, inspection, precision agriculture, milling, and demining. However, this thesis is a prominent step to solve CPP for real-world problems where environment poses multiple challenges. At first, four significant and pressing challenges for CPP in extreme environment are identified. Each challenge is formulated as a problem and its solution has been presented as a dedicated chapter in this thesis. The first problem, Goal-Oriented Sensor based CPP, focuses on cumbersome tasks like Nuclear Decommissioning, where the robot covers an abandoned site in tandem with the goal to reach a static target in minimal time. To meet the grave speeding-up challenge, a novel offline-online strategy is proposed that efficiently models the site using floor plans and grid maps as a priori information. The proposed strategy outperforms the two baseline approaches with reduction in coverage time by 45%- 82%. The second problem explores CPP of distributed regions, applicable in post-disaster scenarios like Fukushima Daiichi.
Experiments are conducted at radiation laboratory to identify the constraints robot would be subjected to. The thesis is successfully able to diagnose transient damage in the robot’s sensor after 3 Gy of gamma radiation exposure. Therefore, a region order travel constraint known as Precedence Provision is imposed for successful coverage. The region order constraint allows the coverage length to be minimised by 65% in comparison to state-of-the-art techniques. The third problem identifies the major bottleneck of limited on-board energy that inhibits complete coverage of distributed regions. The existing approaches allow robots to undertake multiple tours for complete coverage which is impractical in many scenarios. To this end, a novel algorithm is proposed that solves a variant of CPP where the robot aims to achieve near-optimal area coverage due to path length limitation caused by the energy constraint. The proposed algorithm covers 23% - 35% more area in comparison to the state-of-the-art approaches. Finally, the last problem, an extension of the second and third problems, deals with the problem of CPP over a set of disjoint regions using a fleet of heterogeneous aerial robots. A heuristic is proposed to deliver solutions within acceptable time limits. The experiments demonstrate that the proposed heuristic solution reduces the energy cost by 15-40% in comparison to the state-of-the art solutions
