Search

Coordinate measurement machines (CMMs) have been widely used in inspecting mechanical parts with higher accuracy. Both the distribution and the number of the sampled points on measurand have an important effect on the efficiency and quality of the measurement of CMMs. In this paper, an adaptive sampling method is proposed for inspection planning on CMM for free-form surface. The points are iteratively sampled from a form error model, which is constructed by superimposing appropriate form errors on the nominal data. Moreover, a modified algorithm is introduced to determine the deviation of two point sets for the improvement of the inspecting accuracy, and the inspection uncertainty is also analyzed. A comparison is performed between the proposed method and the two well-known sampling methods, which are the equi-parametric method and the patch mean Gaussian curvature-based method, both simulated and experiment results show the effectiveness and robustness of this method. [ABSTRACT FROM AUTHOR]

The central challenge in robotic mapping is obtaining reliable data associations (or “loop closures”): state-of-the-art inference algorithms can fail catastrophically if even one erroneous loop closure is incorporated into the map. Consequently, much work has been done to push error rates closer to zero. However, a long-lived or multi-robot system will still encounter errors, leading to system failure. We propose a fundamentally different approach: allow richer error models that allow the probability of a failure to be explicitly modeled. In other words, rather than characterizing loop closures as being “right” or “wrong”, we propose characterizing the error of those loop closures in a more expressive manner that can account for their non-Gaussian behavior. Our approach leads to an fully integrated Bayesian framework for dealing with error-prone data. Unlike earlier multiple-hypothesis approaches, our approach avoids exponential memory complexity and is fast enough for real-time performance. We show that the proposed method not only allows loop closing errors to be automatically identified, but also that in extreme cases, the “front-end” loop-validation systems can be unnecessary. We demonstrate our system both on standard benchmarks and on the real-world data sets that motivated this work. [ABSTRACT FROM AUTHOR]