On computing a distance measure for path planning

Given two objects, A and B, such that A intersection B not= theta , the authors define a measure to characterize the penetration between A and B. They present fast algorithms for computing the measure for planar and polyhedral objects and demonstrate how the measure can be used in collision detection for path planning.<
>