Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Minimum coverage paths"”.

  1. Towards a fully autonomous and cooperative deployment of multi-robot teams for exploration and coverage in unknown or partially known environments

    … which is usually referred as multi-robot coverage path planning (mCPP), has been proven to be NP-hard. Currently, existing approaches produce polynomial algorithms that are able to only approximate the minimum covering time. In chapter 3, a novel methodology is proposed, capable of …

    greece Repository record for Towards a fully autonomous and cooperative deployment of multi-robot teams for exploration and coverage in unknown or partially known environments (opens in a new tab)