Admissible gap navigation: A new collision avoidance approach

https://doi.org/10.1016/j.robot.2018.02.008Get rights and content

Highlights

  • A new concept for collision avoidance, the Admissible Gap (AG), is introduced.

  • The exact robot shape and kinematic constraints are taken into account.

  • An efficient and stable methodology for extracting gaps is proposed.

  • An outstanding navigation performance in unknown dense environments is achieved.

  • The AG approach is evaluated and compared with three state-of-the-art methods.

Abstract

This paper proposes a new concept, the Admissible Gap (AG), for reactive collision avoidance. A gap is called admissible if it is possible to find a collision-free motion control that guides a robot through it, while respecting the vehicle constraints. By utilizing this concept, a new navigation approach was developed, achieving an outstanding performance in unknown dense environments. Unlike the widely used gap-based methods, our approach directly accounts for the exact shape and kinematics, rather than finding a direction solution and turning it later into a collision-free admissible motion. The key idea is to analyze the structure of obstacles and virtually locate an admissible gap, once traversed, the robot makes progress towards the goal. For this purpose, we introduce a strategy of traversing gaps that respect the kinematic constraints and provides a compromise between path length and motion safety. We also propose a new methodology for extracting gaps that eliminates useless ones, thus reducing oscillations. Experimental results along with performance evaluation demonstrate the outstanding behavior of the proposed AG approach. Furthermore, a comparison with existing state-of-the-art methods shows that the AG approach achieves the best results in terms of efficiency, robustness, safety, and smoothness.

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 pg and pr, 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 R. The shape of the robot is approximated by a polygon with m edges, denoted as Pe,e=1,,m.

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 S 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 S to extract all visible gaps V surrounding the robot. In the second step, V is reduced to G 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. Oprpg=ϕ). 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 (0.52×0.48) 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 0.25° with a field of view of 270°. 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 (Ttot): The total amount of time a robot needs to perform the mission.

(2) Path length (Plen): The total distance traveled by a robot from an initial location to a target: Plen=xixg1+fx212dxwhere (xi,f(xi)) and (xg,f(xg)) 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)

  • MinguezJ. et al.

    Extending collision avoidance methods to consider the vehicle shape, kinematics, and dynamics of a mobile robot

    IEEE Trans. Robot.

    (2009)
  • M. Mujahed, B. Mertsching, The admissible gap (AG) method for reactive collision avoidance, in: IEEE International...
  • MinguezJ. et al.

    Springer Handbook of Robotics

    (2016)
  • MohananM. et al.

    A survey of robotic motion planning in dynamic environments

    Robotics and Autonomous Systems

    (2017)
  • BorensteinJ. et al.

    The vector field histogram - fast obstacle avoidance for mobile robots

    IEEE Trans. Robot. Automat.

    (1991)
  • FahimiF. et al.

    Real-time obstacle avoidance for multiple mobile robots

    Robotica

    (2009)
  • RodriguesR.T. et al.

    Feature based potential field for low-level active visual navigation

  • KhatibO.

    Real-time obstacle avoidance for manipulators and mobile robots

    Int. J. Robot. Res.

    (1986)
  • Y. Koren, J. Borenstein, Potential field methods and their inherent limitations for mobile robot navigation, in: IEEE...
  • BarraquandJ. et al.

    Robot motion planning: A distributed representation approach

    Int. J. Robot. Res.

    (1991)
  • MasoudA.A.

    A harmonic potential approach for simultaneous planning and control of a generic UAV platform

    J. Intell. Robot. Syst.

    (2012)
  • F. Bounini, D. Gingras, H. Pollart, D. Gruyer, Modified artificial potential field method for online path planning...
  • RenJ. et al.

    Modified Newton’s method applied to potential field-based navigation for mobile robots

    IEEE Trans. Robot.

    (2006)
  • D. Panagou, Motion planning and collision avoidance using navigation vector fields, in; ICRA, Hong Kong, China, 2014,...
  • R. Hegde, D. Panagou, Multi-agent motion planning and coordination in polygonal environments using vector fields and...
  • MaloneN. et al.

    Hybrid dynamic moving obstacle avoidance using a stochastic reachable set-based potential field

    IEEE Trans. Robot.

    (2017)
  • H. Chiang, N. Malone, K. Lesser, M. Oishi, L. Tapia, Path-guided artificial potential fields with stochastic reachable...
  • LumelskyV.J. et al.

    Dynamic path planning for a mobile automaton with limited information on the environment

    IEEE Trans. Automat. Control

    (1986)
  • D. Maravall, J. de Lope, J.P.F. Brea, Visual bug algorithm for simultaneous robot homing and obstacle avoidance using...
  • KamonI. et al.

    Tangentbug: A range-sensor-based navigation algorithm

    Int. J. Robot. Res.

    (1998)
  • SavkinA.V. et al.

    Reactive and the shortest path navigation of a wheeled mobile robot in cluttered environments

    Robotica

    (2013)
  • W. Feiten, R. Bauer, G. Lawitzky, Robust obstacle avoidance in unknown and cramped environments, in: ICRA, CA, USA,...
  • R. Simmons, The curvature-velocity method for local obstacle avoidance, in: ICRA, Minnosota, USA, 1996, pp....
  • 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.

    View full text