Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/73229
DC Field | Value | |
---|---|---|
dc.title | Bipedal locomotion control using a four-compartmental central pattern generator | |
dc.contributor.author | Feng, K. | |
dc.contributor.author | Chew, C.-M. | |
dc.contributor.author | Hong, G.-S. | |
dc.contributor.author | Zielinska, T. | |
dc.date.accessioned | 2014-06-19T05:32:40Z | |
dc.date.available | 2014-06-19T05:32:40Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Feng, K., Chew, C.-M., Hong, G.-S., Zielinska, T. (2005). Bipedal locomotion control using a four-compartmental central pattern generator. IEEE International Conference on Mechatronics and Automation, ICMA 2005 : 1515-1520. ScholarBank@NUS Repository. | |
dc.identifier.isbn | 0780390458 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/73229 | |
dc.description.abstract | In this paper, we develop a simple bipedal loco motion algorithm based on biological concepts. The algorithm utilized a Central Pattern Generator (CPG) composed of four coupled neural oscillators (NO) to generate control signal for the bipedal robot. Feedbacks from the robot dynamics and the environment are used to update the CPG online. Our algorithm is then tested on a seven link model of bipedal robot. Simulation results suggest the proposed CPG can generate a smooth and continuous walking pattern for the robot. © 2005 IEEE. | |
dc.source | Scopus | |
dc.subject | Bipedal locomotion | |
dc.subject | Central Pattern Generator | |
dc.subject | Limit cycle | |
dc.subject | Neural oscillator | |
dc.type | Conference Paper | |
dc.contributor.department | MECHANICAL ENGINEERING | |
dc.description.sourcetitle | IEEE International Conference on Mechatronics and Automation, ICMA 2005 | |
dc.description.page | 1515-1520 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.