About Path Finding Problem and Information Support of Mobile Robots in Uncertainty

This paper shows the reasons of an incomparability of path finding algorithms in uncertainty. An example of non-monotonous dependency of algorithm efficiency upon radius of ranger action and an example of the algorithm adaptation in unknown terrain during the motion is given. The investigation of unstable behaviour of path finding algorithm is presented. Some results of robot information processing are briefly discussed. We consider the basic algorithms of data processing for laser distance measuring systems and their modification for ultrasonic sensors.