Mobile Robot-Assisted Cellular Environment Coverage - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Mobile Robot-Assisted Cellular Environment Coverage

(1) , (1) , (1)
1

Abstract

The robotic coverage problem of a known rectangular cellular environment with obstacles is considered in this article. The robot can move only at directions parallel and perpendicular to the sides of the rectangle and can cover one cell at each time unit. A suboptimal minimum-time complete area coverage path-planning algorithm is presented. This algorithm minimizes a distance cost metric related to its current position and the quadtree-based decomposed blocks of the unexplored space. The efficiency of the suggested algorithm is shown through simulation studies and the implementation of a non-linear controller designed for a two-wheeled robot to achieve tracking of reference trajectories. For the implementation of the controller, the localization of the robotic vehicle was necessary and it was achieved via image processing.

Keywords

Fichier principal
Vignette du fichier
SiamantasGT10.pdf (1.99 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01060675 , version 1 (17-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Georgios Siamantas, Konstantinos Gatsis, Antony Tzes. Mobile Robot-Assisted Cellular Environment Coverage. 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI), Oct 2010, Larnaca, Cyprus. pp.254-261, ⟨10.1007/978-3-642-16239-8_34⟩. ⟨hal-01060675⟩
44 View
44 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More