Computational Complexity of Spatial Laser Motion Sensor

摘要

The paper deals with the investigation of computational complexity of different algorithms of motion evaluation from the measurement of spatial laser motion sensor. Recently there have been developed a sensor capable to measure the spatial motion of a body based on the measurement of positions of laser beam intersections with planar sensitive arrays. The evaluation of spatial motion based on the planar coordinates of beam intersections is not a trivial task. This problem can be solved by different methods (analytical, numerical iterative, neural nets) for different sensor configurations (non-redundant, redundant). Their computational complexity is essential for the resulting sampling rate of the sensor.