Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Revisión de Métodos de Planificación de Camino de Cobertura para Entornos Agrícolas (2407.02449v1)

Published 2 Jul 2024 in cs.RO

Abstract: 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).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. S. Vougioukas, “Agricultural Robotics,” Annual Review of Control, Robotics, and Autonomous Systems, vol. 2, pp. 365 – 392, 2019.
  2. H. Choset and P. Pignon, “Coverage Path Planning: The Boustrophedon Cellular Decomposition,” in Field and Service Robotics (FSR), 1998, pp. 203 – 209.
  3. R. N. De Carvalho, H. A. Vidal, P. Vieira, and M. I. Ribeiro, “Complete coverage path planning and guidance for cleaning robots,” in Proceeding of the IEEE International Symposium on Industrial Electronics, vol. 2, 1997, pp. 677 – 682.
  4. M. Dakulović, S. Horvatić, and I. Petrović, “Complete Coverage D* Algorithm for Path Planning of a Floor-Cleaning Mobile Robot,” IFAC Proceedings Volumes, vol. 44, pp. 5950 – 5955, 2011.
  5. E. Acar, H. Choset, Y. Zhang, and M. Schervish, “Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods,” The International Journal of Robotics Research, vol. 22, pp. 441 – 466, 2003.
  6. E. Acar, M. Simmons, M. Rosenblatt, M. Roth, M. Berna, Y. Mittlefehldt, and H. Choset, “Sensor Based Coverage of Unknown Environments for Land Mine Detection,” in Sixteenth National Conference on Artificial Intelligence, 1999, pp. 932 – 933.
  7. S. X. Yang and C. Luo, “A neural network approach to complete coverage path planning,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 34, pp. 718 – 724, 2004.
  8. M. A. Farsi, K. Ratcliff, J. P. Johnson, C. R. Allen, K. Z. Karam, and R. Pawson, “Robot control system for window cleaning,” Proceedings of American Control Conference, vol. 1, pp. 994 – 995, 1994.
  9. T. Pire, M. Mujica, J. Civera, and E. Kofman, “The Rosario dataset: Multisensor data for localization and mapping in agricultural environments,” Intl. J. of Robotics Research, vol. 38, pp. 633–641, 2019.
  10. H. Choset, “Coverage for robotics – A survey of recent results,” Annals of Mathematics and Artificial Intelligence, no. 31, pp. 113 – 126, 2001.
  11. E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,” Journal of Robotics and Autonomous Systems, vol. 61, pp. 1258 – 1276, 2013.
  12. A. Khan, I. Noreen, and Z. Habib, “On Complete Coverage Path Planning Algorithms for Non-holonomic Mobile Robots: Survey and Challenges,” Journal of Information Science and Engineering, vol. 33, pp. 101 – 121, 2017.
  13. D. Bochtis and S. Vougioukas, “Minimising the non-working distance travelled by machines operating in a headland field pattern,” Biosystems Engineering, vol. 101, pp. 1 – 12, 2008.
  14. I. Hameed, D. Bochtis, and C. Sørensen, “Driving Angle and Track Sequence Optimization for Operational Path Planning Using Genetic Algorithms,” Applied Engineering in Agriculture, vol. 27, pp. 1077–1086, 2011.
  15. T. Oksanen and A. Visala, “Coverage path planning algorithms for agricultural field machines,” Journal of Field Robotics, vol. 26, pp. 651 – 668, 2009.
  16. E. Acar, H. Choset, A. Rizzi, P. Atkar, and D. Hull, “Morse Decompositions for Coverage Tasks,” Intl. J. of Robotics Research, vol. 21, pp. 331 – 344, 2002.
  17. G. Laporte, “The traveling salesman problem: An overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 2, pp. 231 – 247, 1992.
  18. D. Bochtis and T. Oksanen, “Combined coverage and path planning for field operations,” in Precision agriculture, 2009, pp. 521 – 527.

Summary

We haven't generated a summary for this paper yet.