You can install l1-path-finder using

You can then query the planner by calling .search(), which computes the shortest path between a pair of points. That's it!

Benchmarks

l1-path-finder is also extremely fast in practice. On the grid path planning challenge [4] data set, it outperforms all other JavaScript path planning libraries by orders of magnitude:

The JavaScript implementation of l1-path-finder is even competitive with state of the art native C++ codes. The following chart is a comparison to the Dan Harabor's implementation of jump point search [5]:

To see for yourself, you can run a limited interactive benchmark right in your browser: