Abstract In previous work the authors have provided the first game-theoretic approach to the Satellite Range Scheduling problem, modeling the problem as a Stackelberg game and computing its equilibrium in polynomial time. Compared to previous work which focused on the perfect information case, this chapter introduces several variants of this problem with limited information, sheds some light on alternative models, and provides further insight on the relations with the centralized version of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Noncooperative Satellite Range Scheduling with perfect information

    Vazquez, Antonio J. / Scott Erwin, R. | IEEE | 2015


    Parameter Requirements for Noncooperative Satellite Maneuver Reconstruction Using Adaptive Filters

    Goff, Gary M. / Showalter, Daniel / Black, Jonathan T. et al. | AIAA | 2015



    Reactive Satellite Range Scheduling

    Vázquez Álvarez, Antonio José / Erwin, Richard Scott | Springer Verlag | 2015


    Review of Relative Navigation for Noncooperative Spacecraft in Close Range

    Wang, Dayi / Hu, Qiyang / Li, Wenbo et al. | British Library Conference Proceedings | 2021