Related papers: Algorithm for planar 4-Body Problem central config…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
We report on figure-eight choreographic solutions to a system of three identical particles interacting through a potential of Lennard-Jones type, $1/r^{12}-1/r^6$ where $r$ is a distance between the particles. By numerical search, we found…
In this paper, an analytical method that solves the forward displacement problem of several common spherical parallel manipulators (SPMs) is presented. The method uses the the quaternion algebra to restate the problem as a system of four…
The masses of elementary particles and hadrons can be calculated from the periodic table of elementary particles. The periodic table is derived from dimensional hierarchy for the seven extra spatial dimensions. As a molecule is the…
The purpose of this article is to \begin{enumerate} \item define $M(t,k)$ the $t$-fold center of mass arrangement for $k$ points in the plane, \item give elementary properties of $M(t,k)$ and \item give consequences concerning the space…
A new coordinate system on the tangent space to planar configurations is introduced to simplify some calculations on central configurations and relative equilibria in the $N$-body problem with a homogeneous potential, which includes the…
We study the effect of the radiation parameter in the location, stability and orbital dynamics in the Lagrange configuration of the restricted four-body problem when one of the primaries is a radiating body. The equations of motion for the…
A solvable many-body problem in the plane is exhibited. It is characterized by rotation-invariant Newtonian (``acceleration equal force'') equations of motion, featuring one-body (``external'') and pair (``interparticle'') forces. The…
We study the problem of motion planning for a collection of $n$ labeled unit disc robots in a polygonal environment. We assume that the robots have revolving areas around their start and final positions: that each start and each final is…
We construct a highly-symmetric periodic orbit of six bodies in three dimensions. In this orbit, binary collisions occur at the origin in a regular periodic fashion, rotating between pairs of bodies located on the coordinate axes.…
Given two distributions $P$ and $S$ of equal total mass, the Earth Mover's Distance measures the cost of transforming one distribution into the other, where the cost of moving a unit of mass is equal to the distance over which it is moved.…
As shown by Johannes Kepler in 1609, in the two-body problem, the shape of the orbit, a given ellipse, and a given non-vanishing constant angular momentum determines the motion of the planet completely. Even in the three-body problem, in…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
The elliptic restricted three body problem has been well studied. However, the previous formulations of the problem have used a rotating coordinate system to keep the positions of the primary and secondary on the x-axis. This requires the…
In this paper we classify the central configurations of the circular restricted 4-body problem with three primaries at the collinear configuration of the 3-body problem and an infinitesimal mass. The case where the three primaries have the…
The planar equilateral restricted four-body problem where two of the primaries have equal masses is used in order to determine the Newton-Raphson basins of convergence associated with the equilibrium points. The parametric variation of the…
We design a motion planning algorithm to coordinate the movements of two robots along a figure eight track, in such a way that no collisions occur. We use a topological approach to robot motion planning that relates instabilities in motion…
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards…
Given two positive real numbers $M$ and $m$ and an integer $n>2$, it is well known that we can find a family of solutions of the $(n+1)$-body problem where the body with mass $M$ stays put at the origin and the other $n$ bodies, all with…
In this paper we report on an algorithm for aligning multiple protein structures. The algorithm has been tested on a variety of inputs and it performs well in comparison to well-known algorithms for this problem.