PATH PLANNING OF TRACTOR-TRAILER ROBOT BY FAST MARCHING METHODE (FMM)

Author(s):
Message:
Abstract:

This paper deals with motion planning of Tractor-trailer robots، which are car-like robot dragging several trailers with no driving force. Each trailer has a nonholonomic kinematic constraint which increases the complexity of the path planning problem. We solved this problem by implementing the Equivalent Size concept، which depending on the size، number، and link-point positions of trailers، transforms a tractor-trailer path planning problem into a single car-like robot path planning problem. In this paper a new path planning algorithm is proposed for car-like robots which utilizes the Fast Marching Method (FMM)، which is a numerical method for solving the Eikonal differential equation، and the concept of Virtual Obstacles. The algorithm is fast، works independent of the shape of obstacles، and is easy to implement. To evaluate the quality of the solutions the algorithm is compared with the grid search and nonholonomic RRT algorithms. The results showed that the new method has by far lower runtime compared to the other algorithms، while producing short and smooth paths.

Language:
Persian
Published:
Journal of Modeling in Engineering, Volume:11 Issue: 34, 2013
Pages:
31 to 48
magiran.com/p1168056  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!