Optimal path planning of nonholonomic mobile robots Using optimal control method and verification of the method via experimental tests of the Scout mobile robot

Message:
Abstract:
nonholonomic mobile robots are widely used in industrial environments due to their extended workspace. Also, to increase the productivity and efficiency of the mobile robot, their path planning is an important task, and is attracted attention of many of robotic scientists. In this paper, the optimal path planning of the wheeled mobile robots are performed considering their nonlinear dynamic equations and the nonholonomic constraints. Problem of the trajectory optimization is formulated, and conditions of the optimality are derived as a set of nonlinear differential equations by means of indirect method of optimal control method. Then, the optimality equations are solved numerically, and variant simulations are executed. To verify the simulation study, some experimental analysis are done for the Scout mobile robot and compared to the simulation results. The experimental analysis verifies the simulation results, and demonstrates the applicability of the proposed method for the optimal path planning of the mobile robots.
Language:
Persian
Published:
Modares Mechanical Engineering, Volume:12 Issue: 2, 2012
Page:
87
magiran.com/p1015938  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!