Abstract
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 are given. The investigation of unstable behaviour of path finding algorithm is presented. Some results of the robot information processing are briefly discussed. We consider the basic algorithms of data processing for laser distance measuring systems (LDMS) and their modification for ultrasonic sensors (UDMS).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
