Locomotion of a two-dimensional walking-climbing robot using a closed-loop mechanism: From gait generation to navigation

被引:26
作者
Chen, IM [1 ]
Yeo, SH [1 ]
机构
[1] Nanyang Technol Univ, Sch Mech & Prod Engn, Singapore 639798, Singapore
关键词
robot locomotion; gait planning; navigation;
D O I
10.1177/0278364903022001003
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
We investigate the locomotion of a surface-walking/climbing robot, the Planar Walker, based or a novel planar eight-bar closed-loop mechanism. The robot call produce inchworm-like movements ill two orthogonal directions and call rotate about itself. The locomotion mechanism to achieve such motions comprises four-two-way linear cylinders forming a deformable quadrilateral and four two-way gripper modules. Decoupled transverse gaits and turning gaits of the robot with finite lengths and finite rotation angles are obtained through the actuation of linear-cylinders and grippers. Actuation sequences of the cylinders and grippers for different types of gaits are modeled using finite state machines. The kinematics of the gaits are described using planar rigid motion group SE(2). When a series of gaits are executed, the robot follows a non-smooth segmented trajectory. Based on this feature, three point-to-point navigation methods are developed for various scenarios: the Simple Line of Sight (SLS) algorithm, the Simulated Annealing based Accurate Planning (SAAP) algorithm, and the Localized Hybrid Accurate Planning (LHAP) algorithm. Computer sinutlation shows that the SAAP algorithm produces accurate gait sequences and the LHAP algorithm saves computation time and resources for long-range targets. However. experimental results show that the inherent positional errors ill individual gait movements can be substantial when accumulated and call render a particular algorithm less effective.
引用
收藏
页码:21 / 40
页数:20
相关论文
共 21 条
[1]  
Abderrahim M, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P2303, DOI 10.1109/ROBOT.1999.770449
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
Backes PG, 1997, IEEE INT CONF ROBOT, P335, DOI 10.1109/ROBOT.1997.620060
[4]   Locomotive gait generation for inchworm-like robots using finite state approach [J].
Chen, IM ;
Yeo, SH ;
Gao, Y .
ROBOTICA, 2001, 19 (05) :535-542
[5]  
Cormen T. H., 1990, INTRO ALGORITHMS
[6]  
Hirose S., 1997, Proceedings. 1997 IEEE International Conference on Robotics and Automation (Cat. No.97CH35992), P494, DOI 10.1109/ROBOT.1997.620085
[7]  
Hirose S., 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), P33, DOI 10.1109/ROBOT.2000.844036
[8]  
Hopcroft J. E., 2007, Introduction to Automata Theory, Languages and Computation
[9]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[10]  
Savall J, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1993, DOI 10.1109/ROBOT.1999.770400