G²Continuity Smooth Path Planning using Cubic Polynomial Interpolation with Membership Function

Abstract

-Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

Discrete-Time Circular Walking Pattern for Biped Robots

“…The research on humanoid robots has been diverging into various categories including the robot development and many related studies, such as dynamic walking [1][2][3], passive walking [4], adaptive motion planning [5], remote control of mobile robots [6], path planning for obstacle avoidance [7,8], walking pattern generation [9], just to name a few. Among them, control algorithm of walking pattern plays a significant role [9] because, either in a general or an emergent situation, robots may have to modify its preplanned body motion somewhat and somehow for stability by adjusting leg joint's angles or even its next footsteps based on sensory feedback signals.…”