- 자동차형 로봇의 최단경로 계산을 위한 새로운 방법
- A New Method to Calculate a Shortest Path for a Car-Like Robot
- ㆍ 저자명
- 조규상
- ㆍ 간행물명
- 한국시뮬레이션학회논문지
- ㆍ 권/호정보
- 2003년|12권 1호|pp.11-19 (9 pages)
- ㆍ 발행정보
- 한국시뮬레이션학회
- ㆍ 파일정보
- 정기간행물| PDF텍스트
- ㆍ 주제분야
- 기타
Dubins showed that any shortest path of a car-like robot consists of exactly three path segment which are either arcs of circles of radius r(denoted C), or straight line segments(denoted S). Possible six types classified into two families, i.e. CSC and CCC. CSC includes 2 types(LRL and RLR) and CSC includes 4 types(LSL, RSR, LSR, RSL). This paper proposes new formulae for CSC family to find the shortest smooth path between the initial and final configurations of a car-like robot. The formulae is used for finding connection points explicitly between ClongrightarrowS and SlongrightarrowC which are necessary for real applications. The formulae have simple forms mainly because they are transformed into origin of their original coordinates of initial and target configuration, and derived from a standard forms which are a representative configuration of LSL and LSR type respectively. The proposed formulae, which are derived from the standard forms, are simple and new method.