Behavior Trees and Control Barrier Functions (BT intro part 10)

Поделиться
HTML-код
  • Опубликовано: 24 янв 2025

Комментарии • 2

  • @ludvigericson6930
    @ludvigericson6930 Год назад

    At 24:16 are we to understand Eq (5) as the union of all Kbar_j's s.t. the condition holds? Otherwise it is a set of subsets of U.

    • @petterogren7535
      @petterogren7535  8 месяцев назад

      Sorry for the late reply, only saw this now. No, not the union of different Kbar_j's, only the one for which the stuff to the right of the ":" holds. That is, it is non-empty, it is either j=k, or it is such that the next one is empty.