Zobrazeno 1 - 3
of 3
pro vyhledávání: '"T. D. Ranjitha"'
Autor:
K. R. Guruprasad, T. D. Ranjitha
Publikováno v:
Robotica. 39:1141-1162
SUMMARYA new coverage path planning (CPP) algorithm, namely cell permeability-based coverage (CPC) algorithm, is proposed in this paper. Unlike the most CPP algorithms using approximate cellular decomposition, the proposed algorithm achieves exact co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abc028f2037bb93f875838128011efbf
https://doi.org/10.1017/s026357472000096x
https://doi.org/10.1017/s026357472000096x
Autor:
T. D. Ranjitha, K. R. Guruprasad
Publikováno v:
IFAC-PapersOnLine. 49:195-200
In this paper, we propose a new robot coverage algorithm using approximate cellular decomposition. The algorithm uses spanning tree on adjacency graph formed by the decomposed cells. We introduce a concept of a virtual node corresponding to a partial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c672b1039d80ffb0dadb2236e5017429
https://doi.org/10.1016/j.ifacol.2016.03.052
https://doi.org/10.1016/j.ifacol.2016.03.052
Autor:
K. R. Guruprasad, T. D. Ranjitha
Publikováno v:
AIR
In this paper, we propose a new robot coverage algorithm using approximate cellular decomposition. While in most coverage algorithms using approximate cellular decomposition, only a resolution-complete coverage is achievable, the proposed algorithm a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ee9916e030048b7bce89546bb63a743
https://doi.org/10.1145/2783449.2783492
https://doi.org/10.1145/2783449.2783492