A study of snake-like locomotion through the analysis of a flexible robot model

We examine the problem of snake-like locomotion by studying a system consisting of a planar inextensible elastic rod with adjustable spontaneous curvature, which provides an internal actuation mechanism that mimics muscular action in a snake. Using a Cosserat model, we derive the equations of motion in two special cases: one in which the rod can only move along a prescribed curve, and one in which the rod is constrained to slide longitudinally without slipping laterally, but the path is not fixed a priori (free-path case). The second setting is inspired by undulatory locomotion of snakes on flat surfaces. The presence of constraints leads in both cases to non-standard boundary conditions that allow us to close and solve the equations of motion. The kinematics and dynamics of the system can be recovered from a one-dimensional equation, without any restrictive assumption on the followed trajectory or the actuation.We derive explicit formulae highlighting the role of spontaneous curvature in providing the driving force (and the steering, in the free-path case) needed for locomotion. We also provide analytical solutions for a special class of serpentine motions, which enable us to discuss the connection between observed trajectories, internal actuation and forces exchanged with the environment

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the ellipses are found in an efficient manner. To do so, the intersection points of the ellipses that fall on the boundary of the intersection region are determined, and a set of points is generated on the elliptic arcs connecting every two neighbouring intersection points. By finding the tangent lines to the ellipses at the extended set of points, a set of half-planes is obtained, whose intersection forms a polygon. To find the polygon more efficiently, the points are given an order and the intersection of the half-planes corresponding to every two neighbouring points is calculated. If the polygon is convex and bounded, these calculated points together with the initially obtained intersection points will form its vertices. If the polygon is non-convex or unbounded, we can detect this situation and then generate additional discrete points only on the elliptical arc segment causing the issue, and restart the algorithm to obtain a bounded and convex polygon. Finally, the smallest area ellipse that contains the vertices of the polygon is obtained by solving a convex optimization problem. Through numerical experiments, it is illustrated that the proposed technique returns a tighter outer-approximation of the intersection of multiple ellipses, compared to conventional techniques, with only slightly higher computational cost