ON MINIMUM-TIME MINIMUM-FUEL RENDEZVOUS

被引：1
|
作者：
VANGELDER, A
BELTRAMI, E
MUNICK, H
机构：
来源：
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS | 1961年 / 9卷 / 03期
关键词：
D O I：
10.1137/0109039
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：474 / 480
页数：7
相关论文
共 50 条
  • [1] Minimum-fuel/minimum-time maneuvers of formation flying satellites
    Avanzini, G
    Biamonti, D
    Minisci, EA
    [J]. ASTRODYNAMICS 2003, PTS 1-3, 2003, 116 : 2403 - 2421
  • [2] MINIMUM-FUEL RENDEZVOUS TECHNIQUES
    TSCHAUNER, JF
    HEMPEL, PR
    [J]. JOURNAL OF SPACECRAFT AND ROCKETS, 1965, 2 (05) : 802 - +
  • [3] MINIMUM-FUEL MINIMUM-TIME CONTROL OF LINEAR DISCRETE-SYSTEMS
    KOLEV, LV
    [J]. INTERNATIONAL JOURNAL OF CONTROL, 1978, 27 (01) : 21 - 29
  • [4] ON MINIMUM FUEL, MINIMUM TIME RENDEZVOUS
    BELTRAMI, E
    [J]. SIAM REVIEW, 1961, 3 (02) : 174 - &
  • [5] Minimum-Time and Minimum-Fuel Low-Thrust Trajectory Design for Satellite Formation in Low-Earth Orbits
    Sowell, Samuel
    Taheri, Ehsan
    [J]. 2022 AMERICAN CONTROL CONFERENCE, ACC, 2022, : 2938 - 2943
  • [6] Decentralized algorithm for minimum-time rendezvous of Dubins vehicles
    Bhatia, Amit
    Frazzoli, Emilio
    [J]. 2008 AMERICAN CONTROL CONFERENCE, VOLS 1-12, 2008, : 1343 - +
  • [7] MINIMUM-FUEL LOW-THRUST RENDEZVOUS TRAJECTORIES VIA SWARMING ALGORITHM
    Pontani, Mauro
    Conway, Bruce A.
    [J]. SPACEFLIGHT MECHANICS 2013, PTS I-IV, 2013, 148 : 835 - 854
  • [8] A New Glideslope Guidance Algorithm for Minimum-Fuel Fixed-Time Elliptic Rendezvous Using Semidefinite Programming
    Ariba, Yassine
    Arzelier, Denis
    Urbina, Laura Sofia
    [J]. IFAC PAPERSONLINE, 2017, 50 (01): : 7235 - 7240
  • [9] MINIMUM-FUEL AIRCRAFT TRANSITION TRAJECTORIES
    PIERSON, BL
    ONG, SY
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1989, 12 (08) : 925 - 934
  • [10] Minimum-Fuel Cruise at Constant Altitude with Fixed Arrival Time
    Franco, Antonio
    Rivas, Damian
    Valenzuela, Alfonso
    [J]. JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2010, 33 (01) : 280 - 285
12345