Step by step Guide: A* algorithm | A star for 2D Path Planning

Поділитися
Вставка
  • Опубліковано 10 лис 2024

КОМЕНТАРІ • 11

  • @jephph8204
    @jephph8204  Рік тому

    I set the cost to be 10 in the movements in up/down and left/right directions, and the cost to be 14 in diagonal directions. Their more precise values would be 1 and sqrt(2), but I think using integers 10 and 14 would be helpful for code running speed.

  • @gahshunker
    @gahshunker 5 місяців тому +1

    why do you take into the account the diagonal neighbors, but when estimating heuristic to the goal, you don't take diagonal paths?

  • @ariton2990
    @ariton2990 10 місяців тому +2

    How do you decide the parent of a cell?? Im confused about this. Why did you decide for B1 to have C1 as a parent and not C2?

    • @MrDummyKicker
      @MrDummyKicker 3 місяці тому

      its how you setup the node connections in the beginning. Usually you as the programmer will determine which nod is the parent

    • @rg99999
      @rg99999 2 місяці тому

      Shouldn't you take the closest node as a parent

  • @yoshivayo
    @yoshivayo 4 місяці тому

    The algorithm is explained but it missed on explaining the why part

  • @ditz3nfitness
    @ditz3nfitness 5 місяців тому

    Why is G 14 on block C2?

  • @Urbanhashhustle
    @Urbanhashhustle 2 роки тому +2

    How did you calculate 24?

    • @jephph8204
      @jephph8204  Рік тому

      I set the cost to be 10 in the movements in up/down and left/right directions, and the cost to be 14 in diagonal directions. Their more precise values would be 1 and sqrt(2), but I think using integers 10 and 14 would be helpful for code running speed.

  • @Faith_Ojumah
    @Faith_Ojumah 11 місяців тому

    hi, your github link is no longer working

  • @joviyeung1866
    @joviyeung1866 2 роки тому

    Hi do you have a email where i can contact ?