Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.02449 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911941001216000 |
|---|---|
| author | Ait, Ismael Kofman, Ernesto Pire, Taihú |
| author_facet | Ait, Ismael Kofman, Ernesto Pire, Taihú |
| contents | The use of an efficient coverage planning method is key for autonomous navigation in agricultural environments, where a robot must cover large areas of crops. This paper generally reviews the current state of the art of coverage path planning methods. Two widely used techniques applicable to agricultural environments are described in detail. The first consists of breaking down a complex field with obstacles into simpler subregions known as cells, to subsequently generate a coverage pattern in each of them. The second analyzes spaces composed of parallel strips through which the robot must circulate, in order to find the optimal order of visiting strips that minimizes the total distance traveled. Additionally, the combination of both techniques is discussed in order to obtain a more efficient global coverage plan. This analysis was conceived to be implemented with the soybean crop weeding robot developed at CIFASIS (CONICET-UNR). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_02449 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Revisión de Métodos de Planificación de Camino de Cobertura para Entornos Agrícolas Ait, Ismael Kofman, Ernesto Pire, Taihú Robotics The use of an efficient coverage planning method is key for autonomous navigation in agricultural environments, where a robot must cover large areas of crops. This paper generally reviews the current state of the art of coverage path planning methods. Two widely used techniques applicable to agricultural environments are described in detail. The first consists of breaking down a complex field with obstacles into simpler subregions known as cells, to subsequently generate a coverage pattern in each of them. The second analyzes spaces composed of parallel strips through which the robot must circulate, in order to find the optimal order of visiting strips that minimizes the total distance traveled. Additionally, the combination of both techniques is discussed in order to obtain a more efficient global coverage plan. This analysis was conceived to be implemented with the soybean crop weeding robot developed at CIFASIS (CONICET-UNR). |
| title | Revisión de Métodos de Planificación de Camino de Cobertura para Entornos Agrícolas |
| topic | Robotics |
| url | https://arxiv.org/abs/2407.02449 |