File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 338 -
dc.citation.number 2 -
dc.citation.startPage 329 -
dc.citation.title TRANSACTIONS OF THE KOREAN INSTITUTE OF ELECTRICAL ENGINEERS -
dc.citation.volume 43 -
dc.contributor.author Bien, Zeungnam -
dc.contributor.author Lee, Y -
dc.date.accessioned 2023-12-22T13:05:59Z -
dc.date.available 2023-12-22T13:05:59Z -
dc.date.created 2014-11-24 -
dc.date.issued 1994-02 -
dc.description.abstract This paper presents a novel method of path planning for a quadruped walking robot on irregular terrain. In the previous study on the path planning problem of mobile robots, it has been usually focused on the collision-free path planning for wheeled robots. The path planning problem of legged roboth, however, has unique aspects from the point of viw that the legged robot can cross over the obstacles and the gait constraint should be considered in the process of planning a path. To resolve this unique problem systematically, a new concept of the artificial intensity field of light is numerically constructed over the configuration space of the robot including the transformed obstacles and a feasible path is sought in the field. Also, the efficiency of the proposed method is shown by various simulation results -
dc.identifier.bibliographicCitation TRANSACTIONS OF THE KOREAN INSTITUTE OF ELECTRICAL ENGINEERS, v.43, no.2, pp.329 - 338 -
dc.identifier.issn 1975-8359 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/9214 -
dc.language 한국어 -
dc.publisher Korean Institute of Electrical Engineers -
dc.title.alternative A Method of Path Planning for a Quadruped Walking Robot on Irregular Terrain -
dc.title 불규칙 지형에서 사가 보행 로보트의 경로 계획 방법 -
dc.type Article -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.