Connecting planar linear chains in the spatial $N$-body problem
Guowei Yu

TL;DR
This paper extends the understanding of spatial N-body problem by identifying collision-free action minimizers for linear chains under symmetry constraints, revealing families of choreographies and conditions for collision or regular polygon configurations.
Contribution
It generalizes previous planar results to spatial cases, removes monotone constraints, and shows the existence of continuous families of choreographies connecting linear chains.
Findings
Action minimizers are collision-free at specific rotation speeds.
Families of choreographies connect different linear chains.
Certain rotation speeds lead to regular N-gon configurations.
Abstract
The family of planar linear chains are found as collision-free action minimizers of the spatial -body problem with equal masses under or -symmetry constraint and different types of topological constraints. This generalizes a previous result by the author in \cite{Y15c} for the planar -body problem. In particular, the monotone constraints required in \cite{Y15c} are proven to be unnecessary, as it will be implied by the action minimization property. For each type of topological constraints, by considering the corresponding action minimization problem in a coordinate frame rotating around the vertical axis at a constant angular velocity , we find an entire family of simple choreographies (seen in the rotating frame), as changes from to . Such a family starts from one planar linear chain and ends at another (seen in the original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpacecraft Dynamics and Control · Astro and Planetary Science · Stellar, planetary, and galactic studies
