Explore the vast range of titles available.

Using Complete Coverage Path Planning (CCPP), a cleaning robot could visit every accessible area in the workspace. The dynamic environment requires the higher computation of the CCPP algorithm because the path needs to be replanned when the path might become invalid. In previous CCPP methods, when the neighbours of the current position are obstacles or have been visited, it is challenging for the robot to escape from the deadlocks with the least extra time cost. In this study, a novel CCPP algorithm is proposed to deal with deadlock problems in a dynamic environment. A priority template inspired by the short memory model could reduce the number of deadlocks by giving the priority of directions. Simultaneously, a global backtracking mechanism guides the robot to move to the next unvisited area quickly, taking the use of the explored global environmental information. What's more, the authors extend their CCPP algorithm to a multi-robot system with a market-based bidding process which could deploy the coverage time. Experiments of apartment-like scenes show that the authors’ proposed algorithm can guarantee an efficient collision-free coverage in dynamic environments. The proposed method performs better than related approaches on coverage rate and overlap length.

An Autonomous Underwater Helicopter (AUH) is a disk-shaped, multi-propelled Autonomous Underwater Vehicle (AUV), which is intended to work autonomously in underwater environments. The near-bottom area sweep in unknown environments is a typical application scenario, in which the complete coverage path planning (CCPP) is essential for AUH. A complete coverage path planning approach for AUH with a single beam echo sounder, including the initial path planning and online local collision avoidance strategy, is proposed. First, the initial path is planned using boustrophedon motion. Based on its mobility, a multi-dimensional obstacle sensing method is designed with a single beam range sonar mounted on the AUH. The VFH+ algorithm is configured for the heading decision-making procedure before encountering obstacles, based on their range information at a fixed position. The online local obstacle avoidance procedure is simulated and analyzed with variations of the desired heading direction and corresponding polar histograms. Finally, several simulation cases are set up, simulated and compared by analyzing the heading decision in front of different obstacle situations. The simulation results demonstrate the feasibility of the complete coverage path planning approach proposed, which proves that AUH completing a full coverage area sweep in unknown environments with a single beam sonar is viable.

This paper presents a novel sensor-based online coverage path-planning algorithm that guarantees the complete coverage of an unknown rectilinear workspace for the task of a mobile robot. The proposed algorithm divides the workspace of the robot into cells at each scan sample. This division can be classified as an exact cell decomposition method, which incrementally constructs cell decomposition while the robot covers an unknown workspace. To guarantee complete coverage, a closed map representation based on a feature extraction that consists of a set of line segments called critical edges is proposed. In this algorithm, cell boundaries are formed by extended critical edges, which are the sensed partial contours of walls and objects in the workspace. The robot uses a laser scanner to sense the critical edges. Sensor measurement is sampled twice in each cell. Scan matching is performed to merge map information between the reference scan and the current scan. At each scan sample, a two-direction oriented rectilinear decomposition is achieved in the workspace and presented by a closed map representation. The construction order of the cells is very important in this incremental cell decomposition algorithm. To choose the next target cell from candidate cells, the robot checks for redundancy in the planned path and for possible positions of the ending points of the current cell. The key point of the algorithm is memorizing the covered space to define the next target cell from possible cells. The path generation within the defined cell is determined to minimize the number of turns, which is the main factor in saving time during the coverage. Therefore, the cell’s long boundary should be chosen as the main path of the robot. This algorithm is verified by an experiment under the LABVIEW environment.