TY - GEN

T1 - Path-Time independent trajectory planning of ladder climbing with shortest path length for a four-limbed robot

AU - Sun, X.

AU - Hashimoto, K.

AU - Koizumi, A.

AU - Hamamoto, S.

AU - Matsuzawa, T.

AU - Teramachi, T.

AU - Takanishi, A.

N1 - Publisher Copyright:
© 2016 IEEE.

PY - 2016/7/26

Y1 - 2016/7/26

N2 - This paper describes a trajectory planning method of ladder climbing for a four-limbed robot. The overall design of the four-limbed robot and the specific design of its end-effector is explained. The trajectory planning consists of two components: path planning and time planning, and the separation of these two parts are realized by arc-length parameterization. In path planning, we use cubic spline interpolation to generate the path according to the given mid-points. It is a fact that the shape of path depends on the choice of the coefficients of the interpolation polynomial, and so does the path length. Therefore, we propose a minimization of path length so that once the mid-points are all given, the generated path will always be the shortest spline curve. For time planning, it enables us to decide how long the path goes in arbitrary given times. Due to the independence between path and time planning, different time planning along the same path can be applied for the purpose of speed adjustment, avoidance of moving obstacles, releasing the burden of motors and so on. Results from simulations and experiments authenticate the validity of our trajectory planning method.

AB - This paper describes a trajectory planning method of ladder climbing for a four-limbed robot. The overall design of the four-limbed robot and the specific design of its end-effector is explained. The trajectory planning consists of two components: path planning and time planning, and the separation of these two parts are realized by arc-length parameterization. In path planning, we use cubic spline interpolation to generate the path according to the given mid-points. It is a fact that the shape of path depends on the choice of the coefficients of the interpolation polynomial, and so does the path length. Therefore, we propose a minimization of path length so that once the mid-points are all given, the generated path will always be the shortest spline curve. For time planning, it enables us to decide how long the path goes in arbitrary given times. Due to the independence between path and time planning, different time planning along the same path can be applied for the purpose of speed adjustment, avoidance of moving obstacles, releasing the burden of motors and so on. Results from simulations and experiments authenticate the validity of our trajectory planning method.

UR - http://www.scopus.com/inward/record.url?scp=84983405811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983405811&partnerID=8YFLogxK

U2 - 10.1109/BIOROB.2016.7523620

DO - 10.1109/BIOROB.2016.7523620

M3 - Conference contribution

AN - SCOPUS:84983405811

T3 - Proceedings of the IEEE RAS and EMBS International Conference on Biomedical Robotics and Biomechatronics

SP - 188

EP - 194

BT - 2016 6th IEEE International Conference on Biomedical Robotics and Biomechatronics, BioRob 2016

PB - IEEE Computer Society

T2 - 6th IEEE RAS/EMBS International Conference on Biomedical Robotics and Biomechatronics, BioRob 2016

Y2 - 26 June 2016 through 29 June 2016

ER -