We review a range of techniques related to navigation of unmanned vehicles through unknown environments with obstacles, especially those that rigorously ensure collision avoidance (given certain assumptions about the system). This topic continues to be an active area of research, and we highlight some directions in which available approaches may be improved. The paper discusses models of the sensors and vehicle kinematics, assumptions about the environment, and performance criteria. Methods applicable to stationary obstacles, moving obstacles and multiple vehicles scenarios are all reviewed. In preference to global approaches based on full knowledge of the environment, particular attention is given to reactive methods based on local sensory data, with a special focus on recently proposed navigation laws based on model predictive and sliding mode control.

/pdf/algorithms-for-collision-free-navigation-of-mobile-robots-in-1s1ksc76if.pdf

Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey

Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent frameworks like MDPs and POMDPs, planning can be carried out by resorting to Q-value functions: an optimal Q-value function Q* is computed in a recursive manner by dynamic programming, and then an optimal policy is extracted from Q*. In this paper we study whether similar Q-value functions can be defined for decentralized POMDP models (Dec-POMDPs), and how policies can be extracted from such value functions. We define two forms of the optimal Q-value function for Dec-POMDPs: one that gives a normative description as the Q-value function of an optimal pure joint policy and another one that is sequentially rational and thus gives a recipe for computation. This computation, however, is infeasible for all but the smallest problems. Therefore, we analyze various approximate Q-value functions that allow for efficient computation. We describe how they relate, and we prove that they all provide an upper bound to the optimal Q-value function Q*. Finally, unifying some previous approaches for solving Dec-POMDPs, we describe a family of algorithms for extracting policies from such Q-value functions, and perform an experimental evaluation on existing test problems, including a new firefighting benchmark problem.

/pdf/optimal-and-approximate-q-value-functions-for-decentralized-3szb2au7vs.pdf

Optimal and approximate Q-value functions for decentralized POMDPs

The dynamic window approach (DWA) is a well-known navigation scheme developed by Fox et al. and extended by Brock and Khatib. It is safe by construction, and has been shown to perform very efficiently in experimental setups. However, one can construct examples where the proposed scheme fails to attain the goal configuration. What has been lacking is a theoretical treatment of the algorithm's convergence properties. Here we present such a treatment by merging the ideas of the DWA with the convergent, but less performance-oriented, scheme suggested by Rimon and Koditschek. Viewing the DWA as a model predictive control (MPC) method and using the control Lyapunov function (CLF) framework of Rimon and Koditschek, we draw inspiration from an MPC/CLF framework put forth by Primbs to propose a version of the DWA that is tractable and convergent.

A convergent dynamic window approach to obstacle avoidance

/pdf/optimal-and-approximate-q-value-functions-for-decentralized-iox2pynw4u.pdf

Optimal and Approximate Q-value Functions for Decentralized POMDPs

The aim of this article is focused on the design of an obstacle detection system for assisting visually impaired people. A dense disparity map is computed from the images of a stereo camera carried by the user. By using the dense disparity map, potential obstacles can be detected in 3D in indoor and outdoor scenarios. A ground plane estimation algorithm based on RANSAC plus filtering techniques allows the robust detection of the ground in every frame. A polar grid representation is proposed to account for the potential obstacles in the scene. The design is completed with acoustic feedback to assist visually impaired users while approaching obstacles. Beep sounds with different frequencies and repetitions inform the user about the presence of obstacles. Audio bone conducting technology is employed to play these sounds without interrupting the visually impaired user from hearing other important sounds from its local environment. A user study participated by four visually impaired volunteers supports the proposed system.

https://www.mdpi.com/1424-8220/12/12/17476/pdf

Assisting the Visually Impaired: Obstacle Detection and Warning System by Acoustic Feedback

Improving collision avoidance for mobile robots in partially known environments: the beam curvature method

This paper describes a method for local path planning for mobile robots that combines reactive obstacle avoidance with on-line local path planning. Our approach is different to other model-based navigation approaches since it integrates both global and local planning processes in the same architecture while other methods only combine global path planning with a reactive method to avoid non-modelled obstacles. Our local planning is only triggered when an unexpected obstacle is found and reactive navigation is not able to regain the initial path. A new trajectory is then calculated on-line using only proximity sensor information. This trajectory can be improved during the available time using an anytime algorithm. The proposed method complements the reactive behaviour and allows the robot to navigate safely in a partially known environment during a long time period without human intervention.

Deliberative On-Line Local Path Planning for Autonomous Mobile Robots

A new technique for enhancing global path planning for mobile robots working in partially known as indoor environments is presented in this paper. The method is based on a graph approach that adapts the cost of the paths by incorporating travelling time from real experiences. The approach uses periodical measurements of time and position reached by the robot while moving to the goal to modify the costs of the branches. Consequently, the search of a feasible path from a static global map in dynamic environments is more realistic than employing a distance metric. Our approach has been tested in simulation as well on an autonomous robot. Results from both simulation and real experiences are discussed.

A global motion planner that learns from experience for autonomous mobile robots

http://www.nt.ntnu.no/users/skoge/prost/proceedings/ifac2002/data/content/00633/633.pdf

The beam-curvature method: a new approach for improving local realtime obstacle avoidance

This paper proposes a set of methods for solving stochastic decision problems modeled as partially observable Markov decision processes (POMDPs). This approach (Real Time Heuristic Decision System, RT-HDS) is based on the use of prediction methods combined with several existing heuristic decision algorithms. The prediction process is one of tree creation. The value function for the last step uses some of the classic heuristic decision methods. To illustrate how this approach works, comparative results of different algorithms with a variety of simple and complex benchmark problems are reported. The algorithm has also been tested in a mobile robot supervision architecture.

A. R. Diéguez

Papers

Improving collision avoidance for mobile robots in partially known environments: the beam curvature method

Deliberative On-Line Local Path Planning for Autonomous Mobile Robots

A global motion planner that learns from experience for autonomous mobile robots

The beam-curvature method: a new approach for improving local realtime obstacle avoidance

Heuristic anytime approaches to stochastic decision processes