From 2c495f4d41fb14f6f9e576b44dadfb2b6e1660e7 Mon Sep 17 00:00:00 2001 From: Kyle Cesare Date: Sun, 26 Nov 2023 15:15:47 -0700 Subject: [PATCH] Update benchmark results in README. --- README.md | 12 ++++++++---- 1 file changed, 8 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index ad5da51..15d9605 100644 --- a/README.md +++ b/README.md @@ -22,15 +22,19 @@ The implementation is similar to TRAC-IK [[1]] in that a nonlinear optimization ## Benchmark -_NOTE: These benchmarks are provisional and conclusions should not yet be drawn._ - -We compare to TRAC-IK by drawing a random valid joint configuration, mapping into Cartesian space with forward kinematics, and then asking each solver to generate an inverse kinematics solution using a random initial guess. +We compare to TRAC-IK (by [tracikpy](https://github.com/mjd3/tracikpy)) by drawing a random valid joint configuration, mapping into Cartesian space with forward kinematics, and then asking each solver to generate an inverse kinematics solution using a random initial guess. Note that this methodology differs from the original TRAC-IK benchmark which solves for configurations along a dense trajectory, meaning seeds are always relatively close. The benchmark shown below is more similar to a motion planning workload, in which samples are randomly drawn from a space with little knowledge of a nearby seed. Timing is of a single inverse kinematics solve. - + + +Additionally, we use the [ik_benchmarking](https://github.com/PickNikRobotics/ik_benchmarking) project (credit to PickNik Robotics) to compare against various solvers for the Franka Emika Panda robot using the MoveIt interfaces for each solver. OptIK is configured to return solutions with roughly equal tolerance to its closest competitor, TRAC-IK. + +Timing is of a single inverse kinematics solve. Note the semi-log axes. + + ## Setup