跳过导航
Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy.
0:00 / 0:31

Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy.

Andrei Kashcha

@anvaka9864 位关注者

在 X 上查看
319 个赞下载原帖

33,677 次观看

Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy. In some cases this might be an acceptable tradeoff.

6 条评论

评论来自 X (Twitter) 上的原帖

  • Andrei Kashcha 🇺🇦 的头像

    @anvaka

    Here is how you can reproduce the results and explore alternatives: * Checkout and * Symlink ngraph.path into node_modules of the demo. * Change the ngraph.path like in the video and `npm build` it

    13 个赞

  • Grant Slatton 的头像

    @GrantSlatton

    Is there a good reason one would prefer this vs. always relaxing the heuristic estimate by some fixed percent as is traditionally done (e.g.

    6 个赞

  • nikolay 的头像

    @nikkyhammer40k

    Damn

    1 个赞

  • rshinra 的头像

    @rshinra

    When you're talking >.1s, no, it's not acceptable.

  • araz.dev ☀️ 的头像

    @ArazDev

    Cant stop being amazed every time i see a project by you

  • Andrei Kashcha 🇺🇦 的头像

    @anvaka

    Thank you, I really appreciate that.