Comparing version
{ | ||
"name": "astar-path", | ||
"version": "0.1.0", | ||
"description": "Find least time 3D ballistic flight path between start and goal nodes. Computed trajectory considers projectile position, velocity and acceleration constraints as well as optional start/goal trajectory constraints. Implemented using heavily optimized A* algorithm, astar-path can compute a constrained 3D path in under 20ms and can be used for CNC path planning applications such as pick-and-place", | ||
"main": "index.js", | ||
"version": "0.1.1", | ||
"description": "Find least time 3D ballistic flight path between start and goal nodes.", | ||
"directories": { | ||
@@ -37,3 +36,3 @@ "test": "test", | ||
"keywords": [ | ||
"a* algorithm", | ||
"a-star algorithm", | ||
"graphs", | ||
@@ -40,0 +39,0 @@ "trajectory", |
69613
2.35%16
6.67%1561
3.86%