Mobile Robot-Assisted Cellular Environment Coverage

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01060675
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 2:27:16 PM
Last modification on : Monday, December 18, 2017 - 1:11:02 AM
Long-term archiving on : Sunday, February 18, 2018 - 3:54:23 PM

File

SiamantasGT10.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

101

Files downloads

88