Complete coverage path planning in an agricultural environment

Thumbnail Image
Driscoll, Theresa
Major Professor
Yan-bin Jia
Committee Member
Journal Title
Journal ISSN
Volume Title
Research Projects
Organizational Units
Organizational Unit
Computer Science

Computer Science—the theory, representation, processing, communication and use of information—is fundamentally transforming every aspect of human endeavor. The Department of Computer Science at Iowa State University advances computational and information sciences through; 1. educational and research programs within and beyond the university; 2. active engagement to help define national and international research, and 3. educational agendas, and sustained commitment to graduating leaders for academia, industry and government.

The Computer Science Department was officially established in 1969, with Robert Stewart serving as the founding Department Chair. Faculty were composed of joint appointments with Mathematics, Statistics, and Electrical Engineering. In 1969, the building which now houses the Computer Science department, then simply called the Computer Science building, was completed. Later it was named Atanasoff Hall. Throughout the 1980s to present, the department expanded and developed its teaching and research agendas to cover many areas of computing.

Dates of Existence

Related Units

Journal Issue
Is Version Of
Computer Science

The problem of finding a collision-free path through a region has garnered a lot of research over the years. One branch of this is the problem of finding a path that completely covers a region. Solutions to the complete coverage path planning problem have applications in many different areas, such as search and rescue, automotive painting, and agriculture. In many cases, it is not sufficient to find any route that completely covers the field. It is desired that the path also be optimal so as to minimize certain costs. This is especially true in the agricultural environment. In the area of precision farming alone, the complete coverage path planning problem exists while performing many different operations, such as harvesting, seeding, spraying, applying fertilizer, and tillage. The fundamental concern of farmers is reducing the costs of running the farm. Since most farming costs ultimately depend on time in the field and area covered, the more efficient an operation can be completed, the lower the costs. Optimality is thus typically in terms of finding the shortest complete coverage path through the field. In this paper, we present an O(n2) algorithm for solving the optimal complete coverage problem on a field boundary with n sides. This multi-phase algorithm makes use of a plane-sweep algorithm to subdivide the field into smaller, trapezoidal regions. The optimal paths through the subregions are then calculated. Finally there is a merge phase where it is determined whether neighboring regions can be more efficiently covered if they were merged together than if they were left separate.

Subject Categories
Sat Jan 01 00:00:00 UTC 2011