Application of iterative closest point algorithm in automatic flight of speedy UAV

In order to realize the autonomous location and attitude estimation for speedy UAV, this paper designs an improved Iterative Closest Points (ICP) algorithm for fixed-wing UAV with a laser range finder mounted onboard. This improved ICP adopts a K-d tree and AK-d tree mixed closest point searching strategy to enhance its rapidity, and an automatic trim approach to drop out outlier points to improve its reliability. In order to check the feasibility of the proposed algorithm, flight experiment is conducted. Experiment result demonstrates the good performance of the algorithm.

[1]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Pavel Krsek,et al.  The Trimmed Iterative Closest Point algorithm , 2002, Object recognition supported by user interaction for service robots.

[3]  Lin-Juan Cong,et al.  ERP P1-N1 changes associated with Vernier perceptual learning and its location specificity and transfer. , 2013, Journal of vision.

[4]  Sebastian Scherer,et al.  Low-altitude operation of unmanned rotorcraft , 2011 .

[5]  Vijay Kumar,et al.  Autonomous multi-floor indoor navigation with a computationally constrained MAV , 2011, 2011 IEEE International Conference on Robotics and Automation.

[6]  Michael A. Greenspan,et al.  Approximate k-d tree search for efficient ICP , 2003, Fourth International Conference on 3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings..

[7]  Zhengyou Zhang,et al.  Iterative point matching for registration of free-form curves and surfaces , 1994, International Journal of Computer Vision.

[8]  Nicholas Roy,et al.  Rapidly-exploring Random Belief Trees for motion planning under uncertainty , 2011, 2011 IEEE International Conference on Robotics and Automation.