1 |
Cao, Z. L., Huang, Y., and Hall, E. L., 1988, “Region filling operations with random obstacle avoidance for mobile robotics”, Journal of Robotic Systems, 5(2), 87-102.
DOI
|
2 |
Balch, T., 2000, “The case for randomized search”, IEEE International Conference on Robotics and Automation Workshop on Sensors and Motion, San Francisco, CA,.
|
3 |
Choset, H., and Pignon, P., 1997, “Coverage path planning : The boustrophedon cellular decomposition”, International Conference on Field and Service Robotics, Canberra, Australia.
|
4 |
Sorensen, C.G., Bak and T., Jorgensen, R.N., 2004, “Mission Planner for Agricultural Robotics”, Leuven, Belgium.
|
5 |
Yang, S. X., and Luo, C., 2004, “A neural network approach to complete coverage path planning”, IEEE Transactions on Systems, Man and Cybernetics, Part B, 34(1), 718-724.
DOI
ScienceOn
|
6 |
LaValle, S. M., 2006, “Planning Algorithms”, Cambridge University Press.
|
7 |
Latombe, J. C., 1993, “Robot Motion Planning”, Boston, MA, Kluwer Academic Publishers.
|
8 |
Stoll, A., 2003, “Automatic operation planning for GPS-guided machinery”, Proceedings of 4th European Conference on Precision Agriculture, Berlin, Germany.
|
9 |
Oksanen, T., and Visala, A., 2009, “Coverage path planning algorithms for agricultural field machines”, Journal of Field Robotics 26(8), 651-668.
DOI
ScienceOn
|