Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot
The complete coverage path planning is a process of finding a path which ensures that a mobile robot completely covers the entire environment while following the planned path. In this paper, we propose a complete coverage path planning algorithm that generates smooth complete coverage paths based on...
Main Authors: | Ana Šelek, Marija Seder, Mišel Brezak, Ivan Petrović |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-11-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/22/23/9269 |
Similar Items
-
Smooth Autonomous Patrolling for a Differential-Drive Mobile Robot in Dynamic Environments
by: Ana Šelek, et al.
Published: (2023-08-01) -
Collaborative Complete Coverage and Path Planning for Multi-Robot Exploration
by: Huei-Yung Lin, et al.
Published: (2021-05-01) -
Proposed Smooth-STC Algorithm for Enhanced Coverage Path Planning Performance in Mobile Robot Applications
by: Hai Van Pham, et al.
Published: (2019-06-01) -
Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot
by: Anh Vu Le, et al.
Published: (2020-06-01) -
Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem
by: Ash Wan Yaw Sang, et al.
Published: (2024-03-01)