14,170 research outputs found
Task Planning on Stochastic Aisle Graphs for Precision Agriculture
This work addresses task planning under uncertainty for precision agriculture
applications whereby task costs are uncertain and the gain of completing a task
is proportional to resource consumption (such as water consumption in precision
irrigation). The goal is to complete all tasks while prioritizing those that
are more urgent, and subject to diverse budget thresholds and stochastic costs
for tasks. To describe agriculture-related environments that incorporate
stochastic costs to complete tasks, a new Stochastic-Vertex-Cost Aisle Graph
(SAG) is introduced. Then, a task allocation algorithm, termed Next-Best-Action
Planning (NBA-P), is proposed. NBA-P utilizes the underlying structure enabled
by SAG, and tackles the task planning problem by simultaneously determining the
optimal tasks to perform and an optimal time to exit (i.e. return to a base
station), at run-time. The proposed approach is tested with both simulated data
and real-world experimental datasets collected in a commercial vineyard, in
both single- and multi-robot scenarios. In all cases, NBA-P outperforms other
evaluated methods in terms of return per visited vertex, wasted resources
resulting from aborted tasks (i.e. when a budget threshold is exceeded), and
total visited vertices.Comment: To appear in Robotics and Automation Letter
Assessing water availability in the Oroua River Catchment : a thesis presented in partial fulfillment of the requirements for a Master Degree in Applied Science (Agricultural Engineering), Massey University
The study estimated the 1993-1998 natural flows as well as their corresponding reliabilities along Kiwitea Stream and Oroua River upstream of the old Kawa Wool station. These estimates could present a baseline condition for assessing the hydrologic capability of the catchment for the existing rights and the amount of streamflow still available for additional rights. The study demonstrated that water availability modeling could be a useful tool in water resource management and planning for the Oroua catchment. The "usual" or high river flow allocation management for the Oroua River wherein a right may abstract water up to its permitted rates could be modeled in WRAP. The results of the simulation based on full abstraction of permitted rates suggested that on a monthly basis, there was enough flow physically available to meet all consented abstraction rights including the minimum flow requirement at Almadale and Spur Road stations throughout the 1993- 1998 simulation period. The study had identified an apparent shortcoming of the WRAP model in simulating the MWRC's water allocation schemes at times of low river flow wherein water rights are either restricted or curtailed whenever the flow reached the set monthly flow threshold and the minimum flow level. The WRAP program was lacking of a mechanism or algorithm that will allow a water diversion target to vary depending on a gauged flow at other locations. The study demonstrated that the criteria stipulated in the Oroua Catchment Water Allocation Regional Plan for rostering abstraction at times of low river flow could be accounted in WRAP water availability modeling using a weighted ranked priority scheme. The results of simulation apportioning the combined maximum abstraction rates for irrigation purposes, based on prior use and natural upstream-to-downstream location among irrigation rights, indicated a minimal increase in the utilization of available water of the Oroua River. Thus, with increased water use as a management objective, such options would not be an attractive alternative. To facilitate relevant hydrologic and institutional water availability and reliability assessment of the Oroua River, it is recommended that a modification be made in the WRAP program to include mechanism or algorithms that will allow automatic change of diversion target as a function of gauged flow. Also, a shorter computational interval, such as weekly or daily, would yield more relevant results for real-time water management for the Oroua River. For future simulation or modeling studies for the Oroua River, there is a need to have an actual streamflow measurement or gauging station downstream of the river for validation purposes. There is also a need to have data on actual abstractions and discharges to the Oroua River and its tributaries
Application of remote sensing to selected problems within the state of California
There are no author-identified significant results in this report
Reitinsuunnittelu määrätyssä järjestyksessä tehtäville peltotöille usean työkoneen yhteistyönä
Coverage path planning is the task of finding a collision free path that passes over every point of an area or volume of interest. In agriculture, the coverage task is encountered especially in the process of crop cultivation. Several tasks are performed on the field, one after the other, during the cultivation cycle.
Cooperation means that multiple agents, in this case vehicles, are working together towards a common goal. Several studies consider the problem where a single task is divided and assigned among the agents. In this thesis, however, the vehicles have different tasks that are sequentially dependent, that is, the first task must be completed before the other. The tasks are performed simultaneously on the same area. The literature review suggests that there is a lack of previous research on this topic.
The objective of this thesis was to develop an algorithm to solve the cooperative coverage path planning problem for sequentially dependent tasks. A tool chain that involves Matlab, Simulink and Visual Studio was adapted for the development and testing of the solution. A development and testing architecture was designed including a compatible interface to a simulation and a real-life test environment. Two different algorithms were implemented based on the idea of computing short simultaneous paths at a time and scheduling them in real-time.
The results were successfully demonstrated in a real-life test environment with two tractors equipped with a disc cultivator and a seeder. The objective was to sow the test area. The test drives show that with the algorithms that were developed in this thesis it is possible to perform two sequentially dependent agricultural coverage tasks simultaneously on the same area.Kattavassa reitinsuunnittelussa yritetään löytää polku, jonka aikana määritelty ala tai tilavuus tulee käytyä läpi niin että alueen jokainen piste on käsitelty. Maataloudessa tämä tehtävä on merkityksellinen erityisesti peltoviljelyssä. Useita peltotöitä suoritetaan yksi toisensa jälkeen samalla alueella viljelyvuoden aikana.
Useissa tutkimuksissa käsitellään yhteistyönä tehtävää reitinsuunnittelua, jossa yksi tehtävä on jaettu osiin ja osat jaetaan useiden tekijöiden kuten robottien kesken. Tässä diplomityössä peltotyökoneilla on kuitenkin omat erilliset tehtävänsä, joilla on määrätty järjestys, eli niiden suorittaminen riippuu työjärjestyksestä. Työkoneet työskentelevät samanaikaisesti samalla alueella. Diplomityössä tehty kirjallisuuskatsaus viittaa siihen, että vastaavaa aihetta ei ole aiemmin tutkittu.
Tämän diplomityön tavoitteena on kehittää algoritmi, jolla voidaan toteuttaa reitinsuunnittelu määrätyssä järjestyksessä tehtäville peltotöille usean peltotyökoneen yhteistyönä. Algoritmikehitystä ja testausta varten suunniteltiin yhtenäinen rajapinta, jolla algoritmia voitaisiin testata sekä simulaatiossa että todellisessa testitilanteessa. Algoritmikehityksessä käytettiin työkaluina Matlab, Simulink ja Visual Studio -ohjelmia. Työssä toteutettiin kaksi algoritmia, jotka perustuvat samaan ideaan: suunnitellaan kerrallaan kaksi lyhyttä samanaikaista polkua, jotka ajoitetaan reaaliajassa.
Algoritmeja testattiin todellisessa testiympäristössä kahden työkoneen yhteistyönä, kun tavoitteena on kylvää koko testialue. Ensimmäinen työvaihe suoritettiin lautasmuokkaimella ja toinen kylvökoneella. Testiajot osoittavat, että diplomityössä kehitetyillä algoritmeilla voidaan ohjata kahden toisistaan riippuvaisen peltotyön toteutus samanaikaisesti samalla peltoalueella
Adaptive Path Planning for Depth Constrained Bathymetric Mapping with an Autonomous Surface Vessel
This paper describes the design, implementation and testing of a suite of
algorithms to enable depth constrained autonomous bathymetric (underwater
topography) mapping by an Autonomous Surface Vessel (ASV). Given a target depth
and a bounding polygon, the ASV will find and follow the intersection of the
bounding polygon and the depth contour as modeled online with a Gaussian
Process (GP). This intersection, once mapped, will then be used as a boundary
within which a path will be planned for coverage to build a map of the
Bathymetry. Methods for sequential updates to GP's are described allowing
online fitting, prediction and hyper-parameter optimisation on a small embedded
PC. New algorithms are introduced for the partitioning of convex polygons to
allow efficient path planning for coverage. These algorithms are tested both in
simulation and in the field with a small twin hull differential thrust vessel
built for the task.Comment: 21 pages, 9 Figures, 1 Table. Submitted to The Journal of Field
Robotic
Multi-Agent Task Allocation in Complementary Teams: A Hunter and Gatherer Approach
Consider a dynamic task allocation problem, where tasks are unknowingly
distributed over an environment. This paper considers each task comprised of
two sequential subtasks: detection and completion, where each subtask can only
be carried out by a certain type of agent. We address this problem using a
novel nature-inspired approach called "hunter and gatherer". The proposed
method employs two complementary teams of agents: one agile in detecting
(hunters) and another skillful in completing (gatherers) the tasks. To minimize
the collective cost of task accomplishments in a distributed manner, a
game-theoretic solution is introduced to couple agents from complementary
teams. We utilize market-based negotiation models to develop incentive-based
decision-making algorithms relying on innovative notions of "certainty and
uncertainty profit margins". The simulation results demonstrate that employing
two complementary teams of hunters and gatherers can effectually improve the
number of tasks completed by agents compared to conventional methods, while the
collective cost of accomplishments is minimized. In addition, the stability and
efficacy of the proposed solutions are studied using Nash equilibrium analysis
and statistical analysis respectively. It is also numerically shown that the
proposed solutions function fairly, i.e. for each type of agent, the overall
workload is distributed equally.Comment: 15 pages, 12 figure
Application of remote sensing to selected problems within the state of California
There are no author-identified signficant results in this report
- …