Pregled bibliografske jedinice broj: 1260609
Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot
Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot // Sensors, 22 (2022), 23; 9269, 21 doi:10.3390/s22239269 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1260609 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Smooth Complete Coverage Trajectory Planning
Algorithm for a Nonholonomic Robot
Autori
Šelek, Ana ; Seder, Marija ; Brezak, Mišel ; Petrović, Ivan
Izvornik
Sensors (1424-8220) 22
(2022), 23;
9269, 21
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
mobile robot ; complete coverage ; path planning ; path smoothing ; velocity profile optimization
Sažetak
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 clothoids that allow a nonholonomic mobile robot to move in optimal time while following the path. This algorithm greatly reduces coverage time, the path length, and overlap area, and increases the coverage rate compared to the state-of-the-art complete coverage algorithms, which is verified by simulation. Furthermore, the proposed algorithm is suitable for real-time operation due to its computational simplicity and allows path replanning in case the robot encounters unknown obstacles. The efficiency of the proposed algorithm is validated by experimental results on the Pioneer 3DX mobile robot.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika, Računarstvo, Temeljne tehničke znanosti
POVEZANOST RADA
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
- MEDLINE