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-1531@aerospace.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260211T133000 DTEND;TZID=Asia/Jerusalem:20260211T143000 DTSTAMP:20260101T075914Z URL:https://aerospace.technion.ac.il/events/seminar-slot-2026-02-11/ SUMMARY:Integrated Target Allocation and Guidance Strategy using Virtual Ta rgets DESCRIPTION:Lecturer:Kirill Reznik\n Faculty:The Stephen B. Klein Faculty o f Aerospace Engineering\n Institute:Technion – Israel Institute of Techn ology\n Location:Classroom 165\, ground floor\, Library\, Aerospace Eng.\n Zoom: https://technion.zoom.us/j/93549691766\n Abstract: \n\n\nThe resear ch investigates a Shoot-Shoot-Look engagement\, in which two waves of mult iple pursuers are deployed to intercept multiple targets. The first wave i s assigned to targets at the beginning of the scenario. The second wave co nsists of backup pursuers\, whose assignments to the actual targets are de layed until the outcomes of the first-wave intercepts become known. Before their final assignments\, the backup pursuers move toward virtual targets to allow several subsequent reallocation options. The allocation aims to minimize the final expected number of surviving targets. Each interception attempt is probabilistic and depends on the time of flight and heading ch ange required to reach the target. Discrete allocations\, together with th e continuous evolution of pursuer and target kinematic states under simple motion models\, are naturally modeled as a stochastic Markov Decision Pro cess. A general multi-stage formulation with repeated virtual target reall ocations can be solved optimally using Dynamic Programming\, but the assoc iated curse of dimensionality leads to a rapidly increasing computational cost. To mitigate this complexity\, the problem is reduced to a single dec ision stage\, assuming that first-wave intercepts occur within a narrow ti me window. The proposed reduction yields an equivalent finite-dimensional nonlinear optimization problem with respect to the initial headings of the backup pursuers. In addition\, a simplified sequential Greedy allocation algorithm is developed. Monte Carlo simulations show that it closely appro ximates the optimal solution for scenarios in which the first-wave pursuer s have similar intercept probabilities\, whereas\, for highly heterogeneou s first-wave outcomes\, Dynamic Programming yields significantly superior results.\n\n \;\n\n\n\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:STANDARD DTSTART:20251026T010000 TZOFFSETFROM:+0300 TZOFFSETTO:+0200 TZNAME:IST END:STANDARD END:VTIMEZONE END:VCALENDAR