Admissible gap navigation: A new collision avoidance approach
Introduction
Mobile robots have proven themselves tremendously useful in a wide variety of real-world applications, such as transportation, search and rescue, and mining. Perhaps the most interesting aspect of these robots is the ability to execute tasks that are difficult or dangerous to be performed by humans. Designing such robots requires to solve several challenges such as detection, grasping, and control. Nevertheless, whatever the task to be carried out, at some point, the robot has to move. Therefore, autonomous navigation is at the heart of any robotic system and has been thoroughly studied since the beginning of robotics.
The difficulties of autonomous navigation arise from the fact that real-world environments are often unpredictable, unstructured, and changes over time. Moreover, moving obstacles may block the robot’s working area while performing tasks. Under these circumstances, it is essential to incorporate the sensory information into the control loop, bridging the gap between path planning and motion execution. By this means, the environmental changes are detected in real-time enabling robots to avoid unforeseen obstacles. These difficulties are tackled by reactive collision avoidance methods.
The majority of collision avoidance techniques present limited capability of driving robots through narrow spaces in cluttered environments. This is due the fact that these methods experience several classical problems such as being prone to local minima, failure of steering a robot among closely spaced obstacles, and the tendency to generate oscillatory motion [1]. It has been shown that using some form of high-level description of the sensory information is a successful approach to deal with these environments. The so-called gap-based methods [[1], [2], [3], [4]] follow this strategy. However, these methods provide direction solutions assuming holonomic and disc-shaped robots. This is indeed a strong assumption since ignoring the actual vehicle shape may lead to collisions or failure of finding a direction solution. Additionally, ignoring the kinematic constraints may result in computing infeasible motions, relying on approximations when applied on a real vehicle. Hence, accounting for these constraints is of great importance, particularly for robots that are performing tasks in hazardous environments.
In order to deal with this limitation, some methods turn the holonomic solution into a motion control that complies with the shape and kinematic constraints. For instance, in [5] a least squares method is used to align the direction solution with the robot’s heading. In [6], a similar approach is proposed by splitting the problem into subproblems (motion, shape, and kinematics). In fact, these solutions are subject to approximations and deal with each constraint separately [7]. This may arise some problems, especially in scenarios requiring high maneuverability. A more convenient solution is proposed in [7] by mapping the workspace into the so called Arc Reachable Manifold (ARM) in such away that, when the navigation method is applied in ARM, these constraints are implicitly considered. Although this approach is general and can be applied to many existing techniques, it has some shortcomings that might limit its use in dense environments: first, constructing the obstacle region in ARM is based on the assumption that the configurations are attainable by elemental circular paths only. Hence, navigable gaps may appear blocked in ARM.1 Second, the coordinates of ARM are transformed to comply with the kinematic constraints. Searching for openings in the new coordinates is unnatural and may result in detecting incorrect or phantom gaps.
This paper introduces a new concept, the Admissible Gap (AG), for reactive collision avoidance. We call a gap admissible if it is possible to find a single motion control that safely guides a robot through it, while obeying the vehicle constraints. By employing the AG concept, it has been possible to develop a collision avoidance approach that successfully drives a robot in unknown dense environments. As compared with other gap-based methods, our approach directly considers the exact shape and kinematic constraints rather than finding a direction solution and then aligning the vehicle with that direction. The basic idea is to extract the set of gaps surrounding the vehicle and select the most promising one in terms of reaching the goal. A virtual admissible gap is then constructed in an iterative manner, such that traversing it leads to the selected gap and a compromise between path length and motion safety is achieved.
The admissible gap has appeared in part in [8]. In this paper, the concept is extended by considering all virtual gaps that are constructed in the iterative process, not only one. Consequently, the smoothness of the trajectories has been improved. Furthermore, we propose a new methodology for detecting gaps that is applicable to limited and full field of view sensor types. With this methodology, the total number of gaps is reduced by eliminating useless ones, increasing the stability of navigation and alleviating the possibility of oscillation. Additionally, this paper includes a detailed presentation of the overall method along with useful remarks which have been omitted in the conference for the sake of brevity. Finally, several experiments in dense environments are provided, where outstanding results have been achieved, outperforming existing state-of-the-art techniques in terms of efficiency, safety, robustness, and smoothness. By employing the AG approach, our team successfully competed in the 2016 World RoboCup Rescue League, where we ranked the 3rd place in our first participation in the competition.
The remainder of the paper is structured as follows. Section 2 presents the related work while Section 3 introduces some preliminary definitions. In Section 4, our methodology of extracting gaps is described, and subsequently, in Section 5 the Admissible Gap concept is presented. Section 6 shows how this concept is used to navigate a mobile robot. In Sections 7 Experimental results, 8 Evaluation and discussion, the experimental results are discussed and the performance of the AG is evaluated. Finally, Section 9 points out some concluding remarks and presents recommendations for future work.
Section snippets
Related work
Robot motion planning has been thoroughly studied by the robotics community and has been traditionally addressed from two distinct perspectives; path planning (map-based) and collision avoidance (sensor-based). Since path planning is beyond the scope of this paper, only collision avoidance methods are covered (for those interested, refer to [9]). For brevity, the focus will be restricted to some representative approaches, including those that have proved popular across the years and those that
Preliminary definitions
The goal and current robot locations are denoted by and , respectively. The robot considered here utilizes a differential-drive (unicycle model), is navigating on a flat ground, and subject to “rolling without slipping” velocity constraints. Its radius (we mean the radius of a virtual circle wrapped around the robot) is denoted by . The shape of the robot is approximated by a polygon with edges, denoted as .
We assume that the sensor data is available as depth (scan) points to
Extracting gaps
In this section, we show how to determine the list of gaps visible from the current robot location. The key idea is to analyze the structure of and find out discontinuities that may occur between two consecutive depth points. The process of detecting and classifying depth discontinuities is discussed in Section 4.1. Section 4.2 describes the first step of the algorithm which implies searching to extract all visible gaps surrounding the robot. In the second step, is reduced to by
Admissible gap
This section presents the Admissible gap concept, which provides a foundation to develop our navigation method. In Section 5.1 we review the robot’s kinematic constraints and characterize some properties of the vehicle paths. Section 5.2 introduces a strategy of traversing gaps that complies with the kinematic constraints. In Section 5.3 we use this strategy to determine the admissibility status of a given gap. In order to enhance the readability in this section, the notation representing the
AG obstacle avoidance method
In this section, we show how the Admissible Gap concept can be used to navigate a mobile robot. The overall approach works as follows. At each control cycle the sensor data is checked to determine whether the goal is navigable from the current robot’s location or not (i.e. ). If not, the robot is directed towards a gap rather than towards the goal itself. The gap closest to the goal is selected. It is determined by checking both sides of each gap and selecting the one with the side
Experimental results
The AG method was tested using our rescue robot GETbot; a Pioneer 3-AT with a skid-steer drive. The GETbot has a rectangular shape () and equipped with an on-board computer (2.6 GHz Intel Core i5-3320M processor). The maximum linear and angular velocities are 0.7 m/s and 2.4 rad/s. Two laser scanners were used to sense the environment; the first is a Hokuyo UTM-30LX covering a range of 30 m and having a resolution of with a field of view of . The other is a Hokuyo URG-04LX
Evaluation and discussion
In order to evaluate the effectiveness of the AG approach and to compare its performance to that of the techniques discussed in Section 7, the following metrics are employed [[4], [67]]:
(1) Total execution time (): The total amount of time a robot needs to perform the mission.
(2) Path length (): The total distance traveled by a robot from an initial location to a target: where and denote the Cartesian coordinates of the initial and target
Conclusions and future works
This paper presents a new concept, the admissible gap, for reactive obstacle avoidance. This concept addresses the question of whether it is possible to find a kinematically admissible motion command that safely guides a mobile robot through a given gap. With this concept, it has been possible to develop an obstacle avoidance approach for robots moving in unknown dense environments. Unlike the gap-based techniques, the proposed AG approach is developed in such away that the exact shape and
Muhannad Mujahed was born on 25 September 1980 in Hebron, Palestine. He received the Computer Engineering degree from Palestine Polytechnic University, Hebron, Palestine, in 2002, and the master degree in Electronics and Computer Engineering from Al-Quds University, Jerusalem, Palestine, in 2010. In 2011, he received a Ph.D. scholarship from the Deutscher Akademischer Austausch Dienst (DAAD) and joined the Cognitive Systems Engineering Group, (GET Lab), University of Paderborn, Paderborn,
References (67)
- et al.
Tangential gap flow (TGF) navigation: A new reactive obstacle avoidance approach for highly cluttered environments
Robot. Auton. Syst.
(2016) - et al.
A novel potential field method for path planning of mobile robots by adapting animal motion attributes
Robot. Auton. Syst.
(2016) - et al.
A method for reactive navigation of nonholonomic under-actuated robots in maze-like environments
Automatica
(2013) - et al.
A local obstacle avoidance method for mobile robots in partially known environment
Robot. Auton. Syst.
(2010) - et al.
A novel obstacle avoidance algorithm: Follow the gap method
Robot. Auton. Syst.
(2012) - et al.
Nearness diagram (ND) navigation: Collision avoidance in troublesome scenarios
IEEE Trans. Robot. Autom.
(2004) - J.W. Durham, F. Bullo, Smooth nearness-diagram navigation, in: IROS, Nice, France, 2008, pp....
- M. Mujahed, B. Mertsching, A new gap-based collision avoidance method for mobile robots, in: SSRR, Lausanne, 2016, pp....
- A. Bemporad, A.D. Luca, G. Oriolo, A. De, Local incremental planning for a car-like robot navigating among obstacles,...
- J. Minguez, L. Montano, Robot navigation in very complex, dense, and cluttered indoor/outdoor evironments, in: 15th...
Extending collision avoidance methods to consider the vehicle shape, kinematics, and dynamics of a mobile robot
IEEE Trans. Robot.
Springer Handbook of Robotics
A survey of robotic motion planning in dynamic environments
Robotics and Autonomous Systems
The vector field histogram - fast obstacle avoidance for mobile robots
IEEE Trans. Robot. Automat.
Real-time obstacle avoidance for multiple mobile robots
Robotica
Feature based potential field for low-level active visual navigation
Real-time obstacle avoidance for manipulators and mobile robots
Int. J. Robot. Res.
Robot motion planning: A distributed representation approach
Int. J. Robot. Res.
A harmonic potential approach for simultaneous planning and control of a generic UAV platform
J. Intell. Robot. Syst.
Modified Newton’s method applied to potential field-based navigation for mobile robots
IEEE Trans. Robot.
Hybrid dynamic moving obstacle avoidance using a stochastic reachable set-based potential field
IEEE Trans. Robot.
Dynamic path planning for a mobile automaton with limited information on the environment
IEEE Trans. Automat. Control
Tangentbug: A range-sensor-based navigation algorithm
Int. J. Robot. Res.
Reactive and the shortest path navigation of a wheeled mobile robot in cluttered environments
Robotica
Cited by (0)
Muhannad Mujahed was born on 25 September 1980 in Hebron, Palestine. He received the Computer Engineering degree from Palestine Polytechnic University, Hebron, Palestine, in 2002, and the master degree in Electronics and Computer Engineering from Al-Quds University, Jerusalem, Palestine, in 2010. In 2011, he received a Ph.D. scholarship from the Deutscher Akademischer Austausch Dienst (DAAD) and joined the Cognitive Systems Engineering Group, (GET Lab), University of Paderborn, Paderborn, Germany.
His main areas of interest include mobile robot navigation, collision avoidance, control theory, and sensor-based motion planning.
Dirk Fischer received his diploma degree in an interdisciplinary course of study in Electrical Engineering and Computer Science from the University of Paderborn, Germany in 2000. Since 2003 he is with the cognitive systems engineering group (GET Lab) at the University of Paderborn, Paderborn, Germany. His main research interests include rescue robotics, robot navigation, and motion planning.
Bärbel Mertsching received the Ph.D. degree in electrical engineering from Paderborn University, Paderborn, Germany, with a thesis on knowledge-based image analysis.
She was a Professor of Computer Science at the University of Hamburg, Hamburg, Germany, from 1994 to 2003. In 2003 she joined the University of Paderborn, Paderborn, Germany, where she is currently a Professor of Electrical Engineering and the director of the Cognitive Systems Engineering Group, (GET Lab). Her research interests include cognitive systems engineering, in particular, computer vision and robotics, as well as microelectronics for image processing and didactics of engineering education.