Minimum Time and Minimum Switch Path Planning for a Hyper-Redundant Manipulator with Lockable Joints
Author(s):
Abstract:
In this paper, the kinematic path planning of a special hyper-redundant manipulator with lockable joints is studied. In this manipulator the extra cables are replaced by a locking system to reduce weight of the structure and the number of actuators. In this research, the particle swarm optimization is used for path planning. In addition, the kinematic constraints such as joint limits are considered. In the first part of this paper, the minimum switch path planning is solved. This kind of path planning will decrease the vibration and energy consumption and increase the accuracy of manipulator. To validate the result, an innovative test is designed. According to the test results, the performance of the proposed method is shown. In the second part of the paper, the minimum time trajectory planning is studied based on the bang-bang theory. The inverse kinematic of manipulator is calculated such that the sum of legs length changes is decreased. Finally, the result of trajectory planning obtained from particle swarm optimization are compared to simulated annealing optimization results to confirm the performance and correctness of results.
Language:
Persian
Published:
Modares Mechanical Engineering, Volume:12 Issue: 1, 2012
Page:
50
magiran.com/p987003
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!