Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 190

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Complete coverage path planning using reinforcement learning for Tetromino based cleaning and maintenance robot

Krishna Lakshmanan, Anirudh, Elara Mohan, Rajesh, Ramalingam, Balakrishnan, Vu Le, Anh, Veerajagadeshwar, Prabahar, Tiwari, Kamlesh, Ilyas, Muhammad · 2020 · Automation in Construction

Abstract

Abstract Tiling robotics have been deployed in autonomous complete area coverage tasks such as floor cleaning, building inspection, and maintenance, surface painting. One class of tiling robotics, polyomino-based reconfigurable robots, overcome the limitation of fixed-form robots in achieving high-efficiency area coverage by adopting different morphologies to suit the needs of the current environment. Since the reconfigurable actions of these robots are produced by real-time intelligent decisions during operations, an optimal path planning algorithm is paramount to maximize the area coverage while minimizing the energy consumed by these robots. This paper proposes a complete coverage path planning (CCPP) model trained using deep blackreinforcement learning (RL) for the tetromino based reconfigurable robot platform called hTetro to simultaneously generate the optimal set of shapes for any pretrained arbitrary environment shape with a trajectory that has the least overall cost. To this end, a Convolutional Neural Network (CNN) with Long Short Term Memory (LSTM) layers is trained using Actor Critic Experience Replay (ACER) reinforcement learning algorithm. The results are compared with existing approaches which are based on the traditional tiling theory model, including zigzag, spiral, and greedy search schemes. The model is also compared with the Travelling salesman problem (TSP) based Genetic Algorithm (GA) and Ant Colony Optimization (ACO) schemes. The proposed scheme generates a path with lower cost while also requiring lesser time to generate it. The model is also highly robust and can generate a path in any pretrained arbitrary environments.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.autcon.2020.103078

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 190

Metadata

Authors
Krishna Lakshmanan, A., Elara Mohan, R., Ramalingam, B., Vu Le, A., Veerajagadeshwar, P., Tiwari, K., & Ilyas, M.
Venue
Automation in Construction
Publisher
Elsevier BV
Published
2020-04
Volume
112
Pages
103078
ISSN
0926-5805 (ISSN-L)
OpenAlex
W3000637312
Cited by
190
References
3
FWCI
14.20
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complete coverage path planning using reinforcement learning for Tetromino based cleaning and maintenance robot. https://app.cochat.ai/papers/10.1016/j.autcon.2020.103078
The paper
Krishna Lakshmanan, A., Elara Mohan, R., Ramalingam, B., Vu Le, A., Veerajagadeshwar, P., Tiwari, K., & Ilyas, M. (2020). Complete coverage path planning using reinforcement learning for Tetromino based cleaning and maintenance robot. Automation in Construction. https://doi.org/10.1016/j.autcon.2020.103078

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.