A new bug‐type navigation algorithm for mobile robots in unknown environments containing moving obstacles

Abstract

PurposeThe purpose of this paper is to improve the traditional bug algorithms for the navigation of mobile robots in unknown environments by considering the limitations in previous works such as generating long path, limited to static environments as well as ignoring implementation issues. With this purpose, a new bug‐type algorithm termed Distance Histogram Bug (DH‐Bug) is proposed for overcoming these limitations.Design/methodology/approachDH‐Bug redefines the traditional motion modes and switching criteria to shorten the path length. In order to extend the framework of the traditional bug algorithms to tackle the navigation problem in dynamic environments, a new mode and the related switching conditions are designed for dealing with moving obstacles. Moreover, a realization method termed the Distance Histogram (DH) method which takes many implementation issues into full account is proposed for implementing DH‐Bug on real robots.FindingsDH‐Bug is convergent in static environments and it also guarantees “approximate” convergence based on several reasonable assumptions when there are moving obstacles. Simulations results show that DH‐Bug generates shorter average path length than some classical Bug algorithms in static environments and it also performs well in most simulations that contain moving obstacles except for some extremely adverse scenarios which have been discussed in the paper. Experiments on real robots further verify its applicability in both static environments and dynamic environments containing moving obstacles.Originality/valueCompared with previous works, DH‐Bug has three main contributions. First, in static environments, it can shorten the average path length than many classical bug algorithms in the premise of guaranteeing convergence. Second, it can be applied in dynamic environments containing moving obstacles. Third, unlike the previous bug algorithms that always ignore the practical implementation issues, DH‐Bug presents not only an abstract concept, but also a realization approach for realizing this concept on real robots.