Optimal reorientation of planar floating snake robots with collision avoidance.

In this paper, a motion planning algorithm for floating planar under-actuated hyper-redundant snake robots is proposed. The presented algorithm generates locally optimal shape trajectories, i.e., continuous trajectories in the base space of the robot. Such shape trajectories produce a desired rotation of the snake robot, i.e., change in the uncontrolled orientation fiber variable. The proposed method formulates the motion planning problem as an optimization problem where the objective function could be defined to minimize various metrics, such as energy-based cost functions. Additionally, the proposed motion planning algorithm uses a heuristic to generate shape trajectories that avoid self-intersections and obstacle collision. Hence, the motion planning method generates shape trajectories that locally minimize user-defined cost functions and eliminate self-intersections or obstacle collision. The proposed gait generation method is validated using numerical simulations of five-link and seven-link snake robots. • Motion planning algorithm for reorienting snake robots in force-free environments. • The proposed algorithm is applicable to snake robots having any number of links. • The proposed algorithm generates optimal shape trajectories. • Generated shape trajectories are optimized based on user-defined cost functions. • The algorithm facilitates obstacle avoidance and inter-link collision avoidance. • Introduction of a novel heuristic for inter-link collision avoidance. [ABSTRACT FROM AUTHOR]