The small battery capacities of the mobile robot and the un-optimized planning efficiency of
the industrial robot bottlenecked the time efficiency and productivity rate of coverage tasks in …

In this study, we focus on the Multi-robot Coverage Path Planning (MCPP) problem for
maritime Search And Rescue (SAR) missions using a multiple Autonomous Underwater …

The problem of determining a collision free path within a region is an important area of
research in robotics. One significant aspect of this problem is coverage path planning, which …

In the coverage path planning problem, a common assumption is that the robot can fully
cover the environment without recharging. However, in reality most mobile robot systems …

Using Complete Coverage Path Planning (CCPP), a cleaning robot could visit every
accessible area in the workspace. The dynamic environment requires the higher …

Coverage path planning in a generic known environment is shown to be NP-hard. When the
environment is unknown, it becomes more challenging as the robot is required to rely on its …

Most cleaning robots have a good cleaning performance for small environments such as
houses but require a longer cleaning time due to problems such as slow cleaning progress …

This paper presents a method to avoid collisions and deadlocks between mobile robots
working collaboratively in a shared physical environment. Based on the shared knowledge …

In multi-agent systems, the decision of an agent will be affected by the behaviors of others.
Therefore, from the perspective of an agent, the situation is uncertain and random. Inspired …

Task allocation is crucial for autonomous underwater vehicle (AUV) collaboration in multi-
AUV maritime search and rescue missions. In real projects, there are possible target areas …