Abstract
In sensor-based navigation, a mobile robot arrives at its goal if, and only if, it never joins any deadlock, i.e., any periodic cycle, otherwise, the robot recognizes no deadlock-free path in an uncertain world. The authors call a set of alternative terminations the deadlock-free characteristic. In general, every previous sensor-based navigation algorithm keep the deadlock-free characteristic under the following assumptions: (1) a mobile robot traces an uncertain obstacle faithfully; and (2) a mobile robot identifies its position and orientation exactly. However, a mobile robot unfortunately cannot maintain these assumptions because of three kinds of error, i.e., self-positioning, sensing, and control errors. Therefore in this article, after eliminating these two assumptions, the authors design a new sensor-based navigation algorithm NC-Robust* in order for a mobile robot with these errors not to join any dead-lock in an uncertain world. Then they give a proof of the deadlock-free characteristic and ascertain the feasibility of the algorithm NC-Robust* by using a real mobile robot (Nomad) running in a practical world environment.
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.
