This paper presents a consensus-based path planning algorithm for a team of communicating spacecraft. The central idea is the development of a new efficient method of incorporating collision avoidance into the consensus algorithm. This is done by applying the concept of quadratically constrained attitude control (Q-CAC), where attitude constraints are represented as a set of linear matrix inequalities (LMI), and solved by semidefinite programming. Lyapunov-based stability analysis is also presented, together with simulation results for a team of spacecraft engaging in arbitrary formation reconfigurations, to demonstrate the effectiveness of the approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Path planning for multiple spacecraft using consensus with LMI avoidance constraints


    Contributors:


    Publication date :

    2012-03-01


    Size :

    2243613 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Multiple Aircraft Deconflicted Path Planning with Weather Avoidance Constraints

    Pannequin, Jessica / Bayen, Alexandre / Mitchell, Ian et al. | AIAA | 2007


    Spacecraft Trajectory Planning with Avoidance Constraints Using Mixed-Integer Linear Programming

    Arthur Richards / Tom Schouwenaars / Jonathan P. How et al. | AIAA | 2002


    Multiple Aircraft Deconflicted Path Planning with Weather Avoidance Constraints AIAA Paper

    Pannequin, J. / Bayen, A. / Mitchell, I. et al. | British Library Conference Proceedings | 2007