메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

피인용 0

검색

    초록·키워드

    Between any two points in the Cartesian space, the straight motion has many distinct advantages in path / trajectory plannings, specially in a crowded workspace. But to achieve this motion is a nontrivial task. One standard way to approximate this motion is to place enough intermediate points along the desired path and linearly interpolate two adjacent intermediate points in the joint space. In this approach, however, the determination of the minimum (or smallest) number of intermediate points is very important from several aspects. A scheme that can effectively accomplish this purpose is established in this paper. This scheme is based on several search methods. The results are demonstrated using the PUMA 560 series manipulator. quality, yielding an increased travelling time between q° and q². Therefore determination of the smallest number of intermediate points is important for minimizing the total travelling time and reducing jerk(due to abrupt changes in acceleration) at transition point that has significant deteriorating effects on the life expectancy of the manipulator. Furthermore, the appropriate determination of the intermediate points can reduce the memory size that is required to record all intermediate points and to generate the corresponding polynomials.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-ECN-0101-2009-569-013247435