Largest accepted score in the caller's measure units. pickUpSearch uses a dimensionless maximum residual-to-bound ratio and bound 1. Acceptance is prioritised before cost; if no candidate passes, reachable returns the least measured candidate for its caller to reject.
Synchronous candidate score over aligned grasp-then-stroke arrays. keys contains the existing composite degree/millimetre arm-fit scores; judged and bounds are metres, with NaN where no explicit judge/bound exists (including the first grasp). The caller defines score units and must handle sentinels and validity. Its result is compared with bound; callback exceptions propagate, and the borrowed arrays are call-local.
The reachable variant of a symmetric hand goal: among the goals a family of turns produces (about a grasped part's own axis, where any azimuth wraps it alike, or about the palm's normal, where the palm's contact is unchanged), the one the arm can actually take from a posture, by the error left after the arm's fit over its three goals: the hand's rotation in degrees, the wrist's position in millimetres and the elbow's turn from its hint about the shoulder-to-wrist line in degrees, the one freedom a placed wrist leaves the elbow (Tolani, Goswami and Badler 2000). The fit gives up the elbow hint before the hand, so a hand turn the wrist's range cannot hold with the hinted elbow is reached by the other arm pose, the elbow raised; counting that turn as error ranks the grip the arm takes as the law asked above one it takes by leaving its bend. The authored turn wins ties by a hundredth of a degree per degree of turn. Grasp planners rank a part's symmetric grasps by reachability the same way (Miller et al. 2003, Automatic grasp planning using shape primitives), since an authored grip frame alone may ask the wrist for more deviation than it has. Input required of HumanGrasp.reachable. What a grip must hold before its cost counts: a measure of its per-key errors, judgements and the bounds the keys hold their judgements to (the grasp's, then each stroke key's;
NaNwhere none) and the most it may be. A grip within the bound is chosen before any beyond it; with none within, the one nearest the bound is returned for the caller to refuse. Absent, the least cost alone decides.