The aim of this work is to have an universal solution for complete coverage which will be a component in the FroboMind architecture suggested by Kjeld Jensen in . ... Compared to previously work done within the field of coverage path planning this work presents a complete, universal and generic solution where all the steps in the process is included: Segmentation of a data set, creation of a configuration space, decomposition of a polygon, global and local path planning. To achieve this, a series of known algorithms are used including some tweaks and improvements to create a solid foundation for the FroboMind architecture and the agricultural community to explore and develop new algorithms for coverage path planning. Furthermore will the project be tested and verified by implementing it on a vehicle based on the FroboMind architecture.
Main Research Area:
NJF seminar 441, Automation and System Technology in Plant Production CIGR section V & NJF section VII conference, 2011