This paper describes the dynamic window approach to reactive collision avoidance for mobile robots equipped with synchro-drives. The approach is derived directly from the motion dynamics of the robot and is therefore particularly well-suited for robots operating at high speed. It differs from previous approaches in that the search for commands controlling the translational and rotational velocity of the robot is carried out directly in the space of velocities. The advantage of our approach is that it correctly and in an elegantway incorporates the dynamics of the robot. This is done by reducing the search space to the dynamic window, which consists of the velocities reachable within a short time interval. Within the dynamic window the approach only considers admissible velocities yielding a trajectory on which the robot is able to stop safely. Among these velocities the combination of translational and rotational velocity is chosen by maximizing an objective function. The objective function includes a measure of progress towards a goal location, the forward velocity of the robot, and the distance to the next obstacle on the trajectory. In extensive experiments the approach presented here has been found to safely control our mobile robot RHINO with speeds of up to 95 cm/sec, in populated and dynamic environments.

This article describes the software architecture of an autonomous, interactive tour-guide robot. It presents a modular and distributed software architecture, which integrates localization, mapping, collision avoidance, planning, and various modules concerned with user interaction and Web-based telepresence. At its heart, the software approach relies on probabilistic computation, on-line learning, and any-time algorithms. It enables robots to operate safely, reliably, and at high speeds in highly dynamic environments, and does not require any modifications of the environment to aid the robot's operation. Special emphasis is placed on the design of interactive capabilities that appeal to people's intuition. The interface provides new means for human-robot interaction with crowds of people in public places, and it also provides people all around the world with the ability to establish a "virtual telepresence" using the Web. To illustrate our approach, results are reported obtained in mid-...

Autonomous mobile robots need very reliable navigation capabilities in order to operate unattended for long periods of time. We present a technique for achieving this goal that uses partially observable Markov decision process models (POMDPs) to explicitly model navigation uncertainty, including actuator and sensor uncertainty and approximate knowledge of the environment. This allows the robot to maintain a probability distribution over its current pose. Thus, while the robot rarely knows exactly where it is, it always has some belief as to what its true pose is, and is never completely lost. We present a navigation architecture based on POMDPs that provides a uniform framework with an established theoretical foundation for pose estimation, path planning, robot control during navigation, and learning. Our experiments show that this architecture indeed leads to robust corridor navigation for an actual indoor mobile robot. 1

Many applications in mobile robotics require the safe execution of a collision-free motion to a goal posi-tion. Planning approaches are well suited for achiev-ing a goal position in known static environments, while real-time obstacle avoidance methods allow re-active motion behavior in dynamic and unknown en-vironments. This paper proposes the global dynamic window approach as a generatlization of the dynamic window approach. It combines methods from motion planning and real-time obstacle avoidance to result in a framework that allows robust execution of high-velocity, goal-directed, reactive motion for a mobile robot in unknown and dynamic environments. The global dynamic window approach is applicable to non-holonomic and holonomic mobile robots. 1

Office delivery robots have to perform many tasks. They have to determine the order in which to visit ofces, plan paths to those offices, follow paths reliably, and avoid static and dynamic obstacles in the process. Reliability and efficiency are key issues in the design of such autonomous robot systems. They must deal reliably with noisy sensors and actuators and with incomplete knowledge of the environment. They must also act efficiently, in real time, to deal with dynamic situations. Our architecture is composed of four abstraction layers: obstacle avoidance, navigation, path planning, and task scheduling. The layers are independent, communicating processes that are always active, processing sensory data and status information to update their decisions and actions. A version of our robot architecture has been in nearly daily use in our building since December 1995. As of July 1996, the robot has traveled more than 75 kilometers in service of over 1800 navigation requests that were specified using our World Wide Web interface.

This paper addresses the reactive collision avoidance for vehicles that move in very dense, cluttered, and complex scenarios. First, we describe the design of a reactive navigation method that uses a "divide and conquer" strategy based on situations to simplify the difficulty of the navigation. Many techniques could be used to implement this design (since it is described at symbolic level), leading to new reactive methods that must be able to navigate in arduous environments (as the difficulty of the navigation is simplified). We also propose a geometry-based implementation of our design called the nearness diagram navigation. The advantage of this reactive method is to successfully move robots in troublesome scenarios, where other methods present a high degree of difficulty in navigating. We show experimental results on a real vehicle to validate this research, and a discussion about the advantages and limitations of this new approach.

This paper presents an enhancement to the earlier developed Vector Field Histogram (VFH) method for mobile robot obstacle avoidance. The enhanced method, called VFH*, successfully deals with situations that are problematic for purely local obstacle avoidance algorithms. The VFH* method verifies that a particular candidate direction guides the robot around an obstacle. The verification is performed by using the A* search algorithm and appropriate cost and heuristic functions. 1. INTRODUCTION Many mobile robot systems combine a global pathplanning module with a local obstacle avoidance module to perform navigation. While the global path planner determines a suitable path based on a map of the environment, the obstacle avoidance algorithm determines a suitable direction of motion based on recent sensor data. Obstacle avoidance is performed locally in order to ensure that real-time constraints are satisfied. A fast update rate of the obstacle avoidance algorithm is required to allow the ...

This paper develops a method of composing simple control policies, applicable over a limited region in a dynamical system's free space, such that the resulting composition completely solves the navigation and control problem for the given system operating in a constrained environment. The resulting control policy deployment induces a global control policy that brings the system to the goal, provided that there is a single connected component of the free space containing both the start and goal configurations. In this paper, control policies for both kinematic and simple dynamical systems are developed. This work assumes that the initial velocities are somewhat aligned with the desired velocity vector field. We conclude by offering an outline of an approach for accommodating arbitrary dynamical constraints and initial conditions.

Whenever robots are installed in populated environments, they need appropriate techniques to avoid collisions with unexpected obstacles. Over the past years several reactive techniques have been developed that use heuristic evaluation functions to choose appropriate actions whenever a robot encounters an unforeseen obstacle. Whereas the majority of these approaches determines only the next steering command, some additionally consider sequences of possible poses. However, they generally do not consider sequences of actions in the velocity space. Accordingly, these methods are not able to slow down the robot early enough before it has to enter a narrow passage. In this paper we present a new approach that integrates path planning with sensor-based collision avoidance. Our algorithm simultaneously considers the robot's pose and velocities during the planning process. We employ different strategies to deal with the huge state space that has to be explored. Our method has been implemented and tested on real robots and in simulation runs. Extensive experiments demonstrate that our technique can reliably control mobile robots moving at high speeds.

Abstract — An inevitable collision state for a robotic system can be defined as a state for which, no matter what the future trajectory followed by the system is, a collision with an obstacle eventually occurs. An inevitable collision state takes into account both the dynamics of the system and the obstacles, fixed or moving. The main contribution of this paper is to lay down and explore this novel concept (and the companion concept of inevitable collision obstacle). Formal definitions of the inevitable collision states and obstacles are given. Properties fundamental for their characterisation are established. This concept is very general and can be useful both for navigation and motion planning purposes (for its own safety, a robotic system should never find itself in an inevitable collision state!). The interest of this concept is illustrated by a safe motion planning example.