Resolution-Exact Planner for Non-Crossing 2-Link Robot

نویسندگان

  • Zhongdi Luo
  • Chee K. Yap
چکیده

We consider the motion planning problem for a 2-link robot amidst polygonal obstacles. The two links are normally allowed to cross each other, but in this paper, we introduce the non-crossing version of this robot. This 4DOF configuration space is novel and interesting. Using the recently introduced algorithmic framework of Soft Subdivision Search (SSS), we design a resolution-exact planner for this robot. We introduce a new data structure for representing boxes and doing subdivision in this non-crossing configuration space. Our implementation achieved real-time performance for a suite of non-trivial obstacle sets.

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

ثبت نام

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

منابع مشابه

Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots

We consider the path planning problem for a 2-link robot amidst polygonal obstacles. Our robot is parametrizable by the lengths `1, `2 > 0 of its two links, the thickness τ ≥ 0 of the links, and an angle κ that constrains the angle between the 2 links to be strictly greater than κ. The case τ > 0 and κ ≥ 0 corresponds to “thick non-crossing” robots. This results in a novel 4DOF configuration sp...

متن کامل

Resolution-Exact Algorithms for Link Robots

Motion planning is a major topic in robotics. Divergent paths have been taken by practical roboticists and theoretical motion planners. Our goal is to produce algorithms that are practical and have strong theoretical guarantees. Recently, we have proposed a subdivision approach based on soft predicates [19], but with a new notion of correctness called resolution-exactness. Unlike most theoretic...

متن کامل

Resolution-Exact Planner for a 2-link Planar Robot using Soft Predicates

Motion planning is a major topic in robotics. It frequently refers to motion of a robot in a R2 or R3 world that contains obstacles. Our goal is to produce algorithms that are practical and have strong theoretical guarantees. Recently, a new framework Soft Subdivision Search (SSS) was introduced to solve various motion planning problems. It is based on soft predicates and a new notion of correc...

متن کامل

Exact Motion Planning for Tractor-Trailer Robots

A tractor-trailer robot consists of a carlike tractor towing a passive trailer. Due to its highly nonholonomic nature, the kinematics of this type of robot are complicated and di cult to compute. We present exact closed-form solutions for the kinematic parameters of a tractortrailer robot and use them to construct an exact and e cient motion planner in the absence of obstacles. This local plann...

متن کامل

Exact Collision Checking of Robot Paths

This paper describes a new eÆcient collision checker to test single straight-line segments in c-space, sequences of such segments, or more complex paths. This checker is particularly suited for probabilistic roadmap (PRM) planners applied to manipulator arms and multi-robot systems. Such planners spend most of their time checking local paths between randomly sampled con gurations for collision....

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

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