Spacecraft swarm guidance using a sequence of decentralized convex optimizations

Daniel Morgan, Soon Jo Chung, Fred Y. Hadaegh

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This paper presents partially decentralized path planning algorithms for swarms of spacecraft composed of hundreds to thousands of agents with each spacecraft having lim- ited computational capabilities. In our prior work, J2-invariant orbits have been found to provide collision free motion for hundreds of orbits. This paper develops algorithms for the swarm reconfiguration which involves transferring from one J2-invariant orbit to another avoiding collisions and minimizing fuel. To perform collision avoidance, it is assumed that the spacecraft can communicate their trajectories with each other. The algorithm uses sequential convex programming to solve a series of approximate path planning problems until the solution converges. Two decentralized methods are developed: a serial method where the spacecraft take turn updating their trajectories and a parallel method where all of the spacecraft update their trajectories simultaneously.

Original languageEnglish (US)
Title of host publicationAIAA/AAS Astrodynamics Specialist Conference 2012
StatePublished - 2012
Externally publishedYes
EventAIAA/AAS Astrodynamics Specialist Conference 2012 - Minneapolis, MN, United States
Duration: Aug 13 2012Aug 16 2012

Publication series

NameAIAA/AAS Astrodynamics Specialist Conference 2012


ConferenceAIAA/AAS Astrodynamics Specialist Conference 2012
Country/TerritoryUnited States
CityMinneapolis, MN

ASJC Scopus subject areas

  • Aerospace Engineering
  • Astronomy and Astrophysics


Dive into the research topics of 'Spacecraft swarm guidance using a sequence of decentralized convex optimizations'. Together they form a unique fingerprint.

Cite this