Fast Path Planning for Precision Weeding

نویسندگان

  • James Ju Heon Lee
  • Kris Frey
  • Robert Fitch
  • Salah Sukkarieh
چکیده

Agricultural robots have the potential to reduce herbicide use in agriculture and horticulture through autonomous precision weeding. One of the main challenges is how to efficiently plan paths for a robot arm such that many individual weeds can be processed quickly. This paper considers an abstract weeding task among obstacles and proposes an efficient online path planning algorithm for an industrial manipulator mounted to a mobile robot chassis. The algorithm is based on a multi-query approach, inspired by industrial bin-picking, where a database of high-quality paths is computed offline and paths are then selected and adapted online. We present a preliminary implementation using a 6-DOF arm and report results from simulation experiments designed to evaluate system performance with varying database and obstacle sizes. We also validate the approach using a Universal Robots UR5 manipulator and ROS interface.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks

Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...

متن کامل

Centralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

متن کامل

مسیریابی حرکت روبات‌های ماشین‌واره با روش پیشروی سریع

The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...

متن کامل

Robots for Precision Agriculture

Indian agriculture, even after the Green Revolution, is not as productive as it could potentially be. It calls for a second Green Revolution – one of „precision agriculture‟, where cutting-edge technology is used to maximize production with minimum input costs and resources. In this paper we present a multi-purpose agricultural robot to implement precision irrigation, fertilizer addition and de...

متن کامل

Fast, three-dimensional, collision-free motion planning

Issues dealing with fast, 3-D, collision-free motion planning are discussed, and a fast path planning system under developnlent at NBS i s described. The components of a general motion planner are outlined, and some of their computational aspects are discussed. It is argued that an octree representation of the obstacles in the world leads to fast path planning algorithms. The system we are deve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014