An optimized field coverage planning approach for navigation of agricultural robots in fields involving obstacle areas

Technological advances combined with the demand of cost efficiency and environmental considerations has led farmers to review their practices towards the adoption of new managerial approaches, including enhanced automation. The application of field robots is one of the most promising advances among automation technologies. Since the primary goal of an agricultural vehicle is the complete coverage of the cropped area within a field, an essential prerequisite is the capability of the mobile unit to cover the whole field area autonomously. In this paper, the main objective is to develop an approach for coverage planning for agricultural operations involving the presence of obstacle areas within the field area. The developed approach involves a series of stages including the generation of field‐work tracks in the field polygon, the clustering of the tracks into blocks taking into account the in‐field obstacle areas, the headland paths generation for the field and each obstacle area, the implementation of a genetic algorithm to optimize the sequence that the field robot vehicle will follow to visit the blocks and an algorithmic generation of the task sequences derived from the farmer practices. This approach has proven that it is possible to capture the practices of farmers and embed these practices in an algorithmic description providing a complete field area coverage plan in a form prepared for execution by the navigation system of a field robot

Cellular Decomposition for Non-repetitive Coverage Task with Minimum Discontinuities

A mechanism to derive non-repetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end effector lift-offs for manipulators. The problem is motivated by the automatic polishing of an object. Due to the non-bijective mapping between the workspace and the joint-space, a continuous coverage path in the workspace may easily be truncated in the joint-space, incuring undesirable end effector lift-offs. Inversely, there may be multiple configuration choices to cover the same point of a coverage path through the solution of the Inverse Kinematics. The solution departs from the conventional local optimisation of the coverage path shape in task space, or choosing appropriate but possibly disconnected configurations, to instead explicitly explore the leaast number of discontinuous motions through the analysis of the structure of valid configurations in joint-space. The two novel contributions of this paper include proof that the least number of path discontinuities is predicated on the surrounding environment, independent from the choice of the actual coverage path; thus has a minimum. And an efficient finite cellular decomposition method to optimally divide the workspace into the minimum number of cells, each traversable without discontinuties by any arbitrary coverage path within. Extensive simulation examples and real-world results on a 5 DoF manipulator are presented to prove the validity of the proposed strategy in realistic settings

A fuzzy controller with supervised learning assisted reinforcement learning algorithm for obstacle avoidance

Fuzzy logic system promises an efficient way for obstacle avoidance. However, it is difficult to maintain the correctness, consistency, and completeness of a fuzzy rule base constructed and tuned by a human expert. Reinforcement learning method is capable of learning the fuzzy rules automatically. However, it incurs heavy learning phase and may result in an insufficiently learned rule base due to the curse of dimensionality. In this paper, we propose a neural fuzzy system with mixed coarse learning and fine learning phases. In the first phase, supervised learning method is used to determine the membership functions for the input and output variables simultaneously. After sufficient training, fine learning is applied which employs reinforcement learning algorithm to fine-tune the membership functions for the output variables. For sufficient learning, a new learning method using modified Sutton and Barto's model is proposed to strengthen the exploration. Through this two-step tuning approach, the mobile robot is able to perform collision-free navigation. To deal with the difficulty in acquiring large amount of training data with high consistency for the supervised learning, we develop a virtual environment (VE) simulator, which is able to provide desktop virtual environment (DVE) and immersive virtual environment (IVE) visualization. Through operating a mobile robot in the virtual environment (DVE/IVE) by a skilled human operator, the training data are readily obtained and used to train the neural fuzzy system.published_or_final_versio

Istraživanje i modeliranje nepoznatog poligonalnog prostora zasnovano na nesigurnim podacima udaljenosti

We consider problem of exploration and mapping of unknown indoor environments using laser range finder. We assume a setup with a resolved localization problem and known uncertainty sensor models. Most exploration algorithms are based on detection of a boundary between explored and unexplored regions. They are, however, not efficient in practice due to uncertainties in measurement, localization and map building. The exploration and mapping algorithm is proposed that extends Ekman’s exploration algorithm by removing rigid constraints on the range sensor and robot localization. The proposed algorithm includes line extraction algorithm developed by Pfister, which incorporates noise models of the range sensor and robot’s pose uncertainty. A line representation of the range data is used for creating polygon that represents explored region from each measurement pose. The polygon edges that do not correspond to real environmental features are candidates for a new measurement pose. A general polygon clipping algorithm is used to obtain the total explored region as the union of polygons from different measurement poses. The proposed algorithm is tested and compared to the Ekman’s algorithm by simulations and experimentally on a Pioneer 3DX mobile robot equipped with SICK LMS-200 laser range finder.Razmatramo problem istraživanja i izgradnje karte nepoznatog unutarnjeg prostora koristeći laserski sensor udaljenosti. Pretpostavljamo riješenu lokalizaciju robota i poznati model nesigurnosti senzora. Većna se algoritama istraživanja zasniva na otkrivanju granica istraženog i neistraženog područja. Međutim, u praksi nisu učinkoviti zbog nesigurnosti mjerenja, lokalizacije i izgradnje karte. Razvijen je algoritam istraživanja i izgradnje karte koji proširuje Ekmanov algoritam uklanjanjem strogih ograničenja na senzor udaljenosti i lokalizaciju robota. Razvijeni algoritam uključuje algoritam izdvajanja linijskih segmenata prema Pfisteru, koji uzima u obzir utjecaje zašumljenosti senzora i nesigurnosti položaja mobilnog robota. Linijska reprezentacija podataka udaljenosti koristi se za stvaranje poligona koji predstavlja istraženo područje iz svakog mjernog položaja. Bridovi poligona koji se ne podudaraju sa stvarnim značajkama prostora su kandidati za novi mjerni položaj. Algoritam općenitog isijecanja poligona korišten je za dobivanje ukupnog istraženog područja kao unija poligona iz različitih mjernih položaja. Razvijeni algoritam testiran je i uspoređen s izvornim Ekmanovim algoritmom simulacijski i eksperimentalno na mobilnom robotu Pioneer 3DX opremljenim laserskim senzorom udaljenosti SICK LMS-200

Efficient methods of non-myopic sensor management for multitarget tracking

Abstract. This paper develops two efficient methods of non-myopic (long-term) sensor management and investigates the benefit in the set-ting of multitarget tracking. The underlying tracking methodology is based on recursive estimation of a Joint Multitarget Probability Density (JMPD), which is implemented using particle filtering methods. The my-opic sensor management scheme is predicated on maximizing the expected Rényi Information Divergence between the current JMPD and the JMPD after a measurement has been made. A full non-myopic strategy based on this information theoretic method is calculated using Monte Carlo methods for a model problem. Since this is computationally intractable when looking more than a small number of time steps ahead, two alterna-tive strategies are investigated. First, we develop an information-directed search algorithm which focusses the Monte Carlo evaluations on action sequences that are most informative. Second, we give two approximate methods which replace the value-to-go with an easily computed function which captures the long term value of the current action. The perfor-mance of these methods is compared to the myopic scheme in terms of tracking performance and computational requirements.

A Frontier Based Multi-Robot Approach for Coverage of Unknown Environments

With the advent of latest technical advancements in the field of robotics, a stage has arrived where autonomous robots are expected to help humans in tasks that are either dangerous or too monotonous such as mining, search and rescue, floor cleaning. All these problems are derivatives of coverage problem wherein the motto is complete coverage of the environment in a time effective manner. Most of the coverage methods developed till date have access to the map prior to exploration and only few of them made use of multiple robots. In view of the drawbacks of the existing approaches, we developed a frontier based multi robot approach for coverage of unknown environments where map building and exploration is done simultaneously. Individual maps from the robots are merged to form a global map. Frontiers which are the boundaries between explored and unexplored areas are identified and the robots are navigated toward frontiers using the proposed exploration strategy. Robot operating System (ROS) is used for implementation and Stage is used for simulating robots and their environments. Simulation results are obtained for proposed approach and are compared with various existing exploration strategies

Scouting algorithms for field robots using triangular mesh maps

Labor shortage has prompted researchers to develop robot platforms for agriculture field scouting tasks. Sensor-based automatic topographic mapping and scouting algorithms for rough and large unstructured environments were presented. It involves moving an image sensor to collect terrain and other information and concomitantly construct a terrain map in the working field. In this work, a triangular mesh map was first used to represent the rough field surface and plan exploring strategies. A 3D image sensor model was used to simulate collection of field elevation information.A two-stage exploring policy was used to plan the next best viewpoint by considering both the distance and elevation change in the cost function. A greedy exploration algorithm based on the energy cost function was developed; the energy cost function not only considers the traveling distance, but also includes energy required to change elevation and the rolling resistance of the terrain. An information-based exploration policy was developed to choose the next best viewpoint to maximise the information gain and minimize the energy consumption. In a partially known environment, the information gain was estimated by applying the ray tracing algorithm. The two-part scouting algorithm was developed to address the field sampling problem; the coverage algorithm identifies a reasonable coverage path to traverse sampling points, while the dynamic path planning algorithm determines an optimal path between two adjacent sampling points.The developed algorithms were validated in two agricultural fields and three virtual fields by simulation. Greedy exploration policy, based on energy consumption outperformed other pattern methods in energy, time, and travel distance in the first 80% of the exploration task. The exploration strategy, which incorporated the energy consumption and the information gain with a ray tracing algorithm using a coarse map, showed an advantage over other policies in terms of the total energy consumption and the path length by at least 6%. For scouting algorithms, line sweeping methods require less energy and a shorter distance than the potential function method