BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//6.6.4.4//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:0-548@aerospace.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20231009T133000

DTEND;TZID=Asia/Jerusalem:20231009T143000

DTSTAMP:20230913T130026Z

URL:https://aerospace.technion.ac.il/events/a-new-computational-landing-gu
 idance-algorithm-for-reusable-launch-vehicles/

SUMMARY:A New Computational Landing Guidance Algorithm for Reusable Launch 
 Vehicles
DESCRIPTION:Lecturer:Prof. Chang-Hun Lee\n Faculty:Korea Advanced Institute
  of Science and Technology (KAIST)\n Institute:Korea Advanced Institute of
  Science and Technology (KAIST)\, Republic of Korea\n Location:Classroom 1
 65\, ground floor\, Library\, Aerospace Eng\n Zoom: https://technion.zoom.
 us/j/983 6793 1661\n Abstract: This talk introduces the optimal landing gu
 idance\, based on the computational guidance and control (CG&amp\;C) philo
 sophy\, for Reusable Launch Vehicles (RLVs) that utilize retro-propulsion 
 for the landing. Recently developed RLVs proved the cost-effectiveness and
  even the improved flexibility in the operation by reusing the first stage
  booster. However\, the guidance and control algorithms required for the r
 eusable launch vehicle not only have to pursue the minimization of fuel us
 age but also satisfy the various path constraints of the launch vehicle wh
 ile guaranteeing a precise and soft landing. To mitigate this difficulty\,
  this study proposes optimal trajectory tracking guidance by model predict
 ive control (MPC) framework to accomplish soft landing while satisfying th
 e various constraints. The proposed algorithms comprise two phases: Attain
 ing the fuel-optimal landing trajectory and tracking the optimal trajector
 y via MPC. In formulating the optimization problem for the MPC\, the attit
 ude control and throttling characteristics of the launch vehicle are augme
 nted while retaining the required computational load. Then\, sequential co
 nvex programming (SCP) is employed to solve the formulated non-convex opti
 mization problem efficiently. Lastly\, the proposed algorithm is verified 
 by numerical simulation with a 6DOF model and control algorithm designed f
 or the assumed launch vehicle and its landing scenario.\n Details: \n 
CATEGORIES:Seminars
LOCATION:Classroom 165\, ground floor\, Library\, Aerospace Eng

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:DAYLIGHT

DTSTART:20230324T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

END:VTIMEZONE
END:VCALENDAR