• ورود به سامانه
      مشاهده مورد 
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Journal of Artificial Intelligence in Electrical Engineering
      • Volume 4, Issue 13
      • مشاهده مورد
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Journal of Artificial Intelligence in Electrical Engineering
      • Volume 4, Issue 13
      • مشاهده مورد
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Optimal Trajectory Generation for a Robotic Worm via Parameterization by B-Spline Curves

      (ندگان)پدیدآور
      Sayyed Noorani, Mohammad RezaNourfar, Pouya
      Thumbnail
      دریافت مدرک مشاهده
      FullText
      اندازه فایل: 
      670.9کیلوبایت
      نوع فايل (MIME): 
      PDF
      نوع مدرک
      Text
      زبان مدرک
      English
      نمایش کامل رکورد
      چکیده
      In this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using B-spline curves. The trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. Due to gait design considerations it is desired to minimize the required torques in a cycle of gait. Similar to caterpillars, progress in our crawling robot is achieved by propagating a trapezoidal wave from tail to head in the vertical plane. According to this model, the optimization problem has been solved via parameterization of joint trajectories, and consequently cost function, using cubic B-spline curves versus variant numbers of control points (CPs) needed in building those. Indeed, it is tried to find the best number of the CPs, of which the cost function obtains a minimum dynamical effort. To this end, the Genetic Algorithm is employed to find the minimal cost value once a nominated number of CPs is considered. Furthermore, since a complete period of this locomotion gait is composed of separated stages called sub-motions, thus the optimal trajectories for each sub-motion is examined independently. The results show choosing the number of CPs between 8 to 12 points constructs the optimized trajectories that reduce the dynamical effort of crawl in comparison with ones are reported by previous researches.
      کلید واژگان
      Worm-like Robot
      B-spline Curves
      Optimization
      Genetic Algorithm

      شماره نشریه
      13
      تاریخ نشر
      2015-06-01
      1394-03-11
      ناشر
      Ahar Branch,Islamic Azad University, Ahar,Iran

      شاپا
      2345-4652
      URI
      http://jaiee.iau-ahar.ac.ir/article_520419.html
      https://iranjournals.nlai.ir/handle/123456789/441111

      مرور

      همه جای سامانهپایگاه‌ها و مجموعه‌ها بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌هااین مجموعه بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌ها

      حساب من

      ورود به سامانهثبت نام

      تازه ترین ها

      تازه ترین مدارک
      © کليه حقوق اين سامانه برای سازمان اسناد و کتابخانه ملی ایران محفوظ است
      تماس با ما | ارسال بازخورد
      قدرت یافته توسطسیناوب