Abstract

Reactive navigation is a well-known paradigm for controlling an autonomous mobile robot, which suggests making all control decisions through some light processing of the current/recent sensor data. Among the many advantages of this paradigm are: 1) the possibility to apply it to robots with limited and low-priced hardware resources, and 2) the fact of being able to safely navigate a robot in completely unknown environments containing unpredictable moving obstacles. As a major disadvantage, nevertheless, the reactive paradigm may occasionally cause robots to get trapped in certain areas of the environment—typically, these conflicting areas have a large concave shape and/or are full of closely-spaced obstacles. In this last respect, an enormous effort has been devoted to overcome such a serious drawback during the last two decades. As a result of this effort, a substantial number of new approaches for reactive navigation have been put forward. Some of these approaches have clearly improved the way how a reactively-controlled robot can move among densely cluttered obstacles; some other approaches have essentially focused on increasing the variety of obstacle shapes and sizes that could be successfully circumnavigated; etc. In this paper, as a starting point, we choose the best existing reactive approach to move in densely cluttered environments, and we also choose the existing reactive approach with the greatest ability to circumvent large intricate-shaped obstacles. Then, we combine these two approaches in a way that makes the most of them. From the experimental point of view, we use both simulated and real scenarios of challenging complexity for testing purposes. In such scenarios, we demonstrate that the combined approach herein proposed clearly outperforms the two individual approaches on which it is built.

Highlights

  • In the light of the results presented in [28], where Tangential Gap Flow (TGF) is compared against the Nearness Diagram (ND), Smooth Nearness Diagram (SND) and CG strategies in dense and cluttered environments, we can justifiably claim that TGF presently outperforms all competitors because it is able to generate faster, shorter and smoother robot trajectories

  • This section is structured into three main blocks: in the first block, we evaluate the ability of the EG strategy to solve complex navigation problems through a set of simulated experiments; in the second block, we compare the performance of the TGF, T2 and EG strategies while navigation takes place within several simulated environments of gradually increasing difficulty; and, in the third block, we move from simulated to real experiments

  • T2 [25] is a non-purely reactive control strategy which stands out for giving robots the ability to avoid obstacles of a big size, regardless of the maximum measuring range of the sensor used for obstacle detection

Read more

Summary

Introduction

As a counterpoint to the previous example, note that when a system with internal and adaptive parametrization of N detects the robot is currently surrounded by smallsized, simple-shaped and sparse-distributed obstacles, the value of N is immediately decreased, because it is assumed that a basic understanding of the robot’s surroundings—with the word “basic” meaning here that N takes a low value equal to or slightly higher than 1—will be enough so that the system can make the robot successfully navigate around all such—minor— obstacles; or said differently, in a context where obstacle avoidance can be effectively accomplished with only a reduced amount of local information about the environment, the system aims to improve reactiveness, making the robot more capable of handling the unexpected.

Objectives
Results
Conclusion
Full Text
Published version (Free)

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 call