Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm

The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reverse engineering. Registration occurs by aligning the regions that are common to multiple images. The largest difficulty in performing this registration is dealing with outliers and local minima while remaining efficient. A commonly used technique, iterative closest point, is efficient but is unable to deal with outliers or avoid local minima. Another commonly used optimization algorithm, simulated annealing, is effective at dealing with local minima but is very slow. Therefore, the algorithm developed in this paper is a hybrid algorithm that combines the speed of iterative closest point with the robustness of simulated annealing. Additionally, a robust error function is incorporated to deal with outliers. This algorithm is incorporated into a complete modeling system that inputs two sets of range data, regist...

• Type: Conference
• Year: 2000
• Where: ICRA
• Authors: Jason P. Luck, Charles Q. Little, William Hoff
• Keywords: ICRA 2000, Iterative Closest Point, Local Minima, Robotics, Simulated Annealing