ROBOT NAVIGATION IN VERY COMPLEX, DENSE, AND CLUTTERED INDOOR/OUTDOOR ENVIRONMENTS

Similar documents
NAVIGATION SYSTEMS MODEL-BASED METHODS

Lessons Learned in Integration for Sensor-Based Robot Navigation Systems

COMPARISON OF ROBOT NAVIGATION METHODS USING PERFORMANCE METRICS

The Obstacle-Restriction Method (ORM) for Robot Obstacle Avoidance in Difficult Environments

Advanced Robotics Path Planning & Navigation

Robot Shape, Kinematics, and Dynamics in Sensor-Based Motion Planning

Advanced path planning. ROS RoboCup Rescue Summer School 2012

3D Collision Avoidance for Navigation in Unstructured Environments

Reactive Obstacle Avoidance for Mobile Robots that Operate in Confined 3D Workspaces

Abstracting any Vehicle Shape and the Kinematics and Dynamic Constraints from Reactive Collision Avoidance Methods

Spring Localization II. Roland Siegwart, Margarita Chli, Martin Rufli. ASL Autonomous Systems Lab. Autonomous Mobile Robots

Introduction to Information Science and Technology (IST) Part IV: Intelligent Machines and Robotics Planning

Last update: May 6, Robotics. CMSC 421: Chapter 25. CMSC 421: Chapter 25 1

Modeling the Static and the Dynamic Parts of the Environment to Improve Sensor-based Navigation

Final Exam Practice Fall Semester, 2012

Elastic Bands: Connecting Path Planning and Control

W4. Perception & Situation Awareness & Decision making

Robot Motion Control Matteo Matteucci

Smooth Nearness Diagram Navigation

Sensor-Landmark Succession for Motion Planning along a Planned Trajectory

Safe Prediction-Based Local Path Planning using Obstacle Probability Sections

10/11/07 1. Motion Control (wheeled robots) Representing Robot Position ( ) ( ) [ ] T

An Architecture for Automated Driving in Urban Environments

A Reduced-Order Analytical Solution to Mobile Robot Trajectory Generation in the Presence of Moving Obstacles

Anibal Ollero Professor and head of GRVC University of Seville (Spain)

Collision avoidance with Vector Field Histogram+ and Nearness Diagram algorithms implemented on a LEGO Mindstorms NXT robot

Avoiding Moving Obstacles: the Forbidden Velocity Map

UAV Autonomous Navigation in a GPS-limited Urban Environment

Safe prediction-based local path planning using obstacle probability sections

Autonomous Mobile Robots, Chapter 6 Planning and Navigation Where am I going? How do I get there? Localization. Cognition. Real World Environment

Spring Localization II. Roland Siegwart, Margarita Chli, Juan Nieto, Nick Lawrance. ASL Autonomous Systems Lab. Autonomous Mobile Robots

A Reactive Bearing Angle Only Obstacle Avoidance Technique for Unmanned Ground Vehicles

S-SHAPED ONE TRAIL PARALLEL PARKING OF A CAR-LIKE MOBILE ROBOT

Introduction to Mobile Robotics Path Planning and Collision Avoidance

Planning in Mobile Robotics

Introduction to State-of-the-art Motion Planning Algorithms. Presented by Konstantinos Tsianos

Mobile Robotics. Mathematics, Models, and Methods. HI Cambridge. Alonzo Kelly. Carnegie Mellon University UNIVERSITY PRESS

Cooperative Conveyance of an Object with Tethers by Two Mobile Robots

AUTONOMOUS SYSTEMS. LOCALIZATION, MAPPING & SIMULTANEOUS LOCALIZATION AND MAPPING Part V Mapping & Occupancy Grid Mapping

Introduction to Mobile Robotics Path Planning and Collision Avoidance. Wolfram Burgard, Maren Bennewitz, Diego Tipaldi, Luciano Spinello

Introduction to Robotics

Spring 2010: Lecture 9. Ashutosh Saxena. Ashutosh Saxena

arxiv: v1 [cs.ro] 2 Sep 2017

Reinforcement Learning-Based Path Planning for Autonomous Robots

Modifications of VFH navigation methods for mobile robots

Introduction to Autonomous Mobile Robots

Robot Motion Planning

Nonholonomic motion planning for car-like robots

LEARNING NAVIGATION MAPS BY LOOKING AT PEOPLE

A development of PSD sensor system for navigation and map building in the indoor environment

TURN AROUND BEHAVIOR GENERATION AND EXECUTION FOR UNMANNED GROUND VEHICLES OPERATING IN ROUGH TERRAIN

AUTONOMOUS mobile robots are those robots that have

Virtual Range Scan for Avoiding 3D Obstacles Using 2D Tools

Localization, Where am I?

ECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space

CONTROLO th Portuguese Conference on Automatic Control PREDICTIVE REACHING CONTROL WITH MULTIPLE MOTION MODELS

Motion Control (wheeled robots)

Advanced Robotics Path Planning & Navigation

Improving Robot Path Planning Efficiency with Probabilistic Virtual Environment Models

Path Planning. Marcello Restelli. Dipartimento di Elettronica e Informazione Politecnico di Milano tel:

Motion Planning for Mobile Robots - A Guide

Building Reliable 2D Maps from 3D Features

Non-holonomic Planning

ME 597/747 Autonomous Mobile Robots. Mid Term Exam. Duration: 2 hour Total Marks: 100

Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

A Path Tracking Method For Autonomous Mobile Robots Based On Grid Decomposition

A Fuzzy Local Path Planning and Obstacle Avoidance for Mobile Robots

Efficient SLAM Scheme Based ICP Matching Algorithm Using Image and Laser Scan Information

Neuro-adaptive Formation Maintenance and Control of Nonholonomic Mobile Robots

Mobile Robots Locomotion

Real-Time Obstacle Avoidance by an Autonomous Mobile Robot using an Active Vision Sensor and a Vertically Emitted Laser Slit

EE631 Cooperating Autonomous Mobile Robots

Autonomous navigation in industrial cluttered environments using embedded stereo-vision

Manipulator Path Control : Path Planning, Dynamic Trajectory and Control Analysis

COMBINING TASK AND MOTION PLANNING FOR COMPLEX MANIPULATION

Humanoid Robotics. Path Planning and Walking. Maren Bennewitz

Laser Scanner-Based Navigation and Motion Planning for Truck-Trailer Combinations

Stable Trajectory Design for Highly Constrained Environments using Receding Horizon Control

Obstacles Avoidance for Car-Like Robots Integration And Experimentation on Two Robots

Localization and Map Building

Fundamental problems in mobile robotics

Mobile Robotics. Marcello Restelli. Dipartimento di Elettronica e Informazione Politecnico di Milano tel:

Robotics Project. Final Report. Computer Science University of Minnesota. December 17, 2007

Robotics Tasks. CS 188: Artificial Intelligence Spring Manipulator Robots. Mobile Robots. Degrees of Freedom. Sensors and Effectors

COLLISION-FREE TRAJECTORY PLANNING FOR MANIPULATORS USING GENERALIZED PATTERN SEARCH

Announcements. Exam #2 next Thursday (March 13) Covers material from Feb. 11 through March 6

Robotics/Perception II

INTEGRATING LOCAL AND GLOBAL NAVIGATION IN UNMANNED GROUND VEHICLES

Vehicle Localization. Hannah Rae Kerner 21 April 2015

Mobile Manipulator Design

Applications of Guidance

Cognitive Robotics Robot Motion Planning Matteo Matteucci

MULTI-MODAL MAPPING. Robotics Day, 31 Mar Frank Mascarich, Shehryar Khattak, Tung Dang

Introduction to Robotics

3D Terrain Sensing System using Laser Range Finder with Arm-Type Movable Unit

1498. End-effector vibrations reduction in trajectory tracking for mobile manipulator

Motion Control in Dynamic Multi-Robot Environments

Exam in DD2426 Robotics and Autonomous Systems

Stereo-Based Obstacle Avoidance in Indoor Environments with Active Sensor Re-Calibration

Navigation methods and systems

Transcription:

ROBOT NAVIGATION IN VERY COMPLEX, DENSE, AND CLUTTERED INDOOR/OUTDOOR ENVIRONMENTS Javier Minguez Luis Montano Computer Science and Systems Engineering, CPS, University of Zaragoza, Spain Abstract: This paper addresses the reactive collision-free motion generation for indoor/outdoor robots which have geometric, kinematic, and dynamic constraints. Most of the current mobile robots are designed exhibiting some of these constraints: (1) typically they are circular, square or rectangular robots and (2) they are differential-driven robots, car-like robots, tri-cycle robots, etc. On the other hand, many navigation methods do not take into account the specific shape or robot s kinematics and dynamics. In this case, these methods relax some constraints or they rely on approximations. It is clear that this is a gap in research that needs to be closed, by devising mechanisms to generalize navigation methods to be applied over a wide range of mobile platforms. This paper focuses on the generalization of a reactive method - Nearness Diagram Navigation - to work over a fleet of geometric, kinematic, and dynamic constrained indoor/outdoor mobile robots. This framework has been extensively tested using four indoor and one outdoor robots equipped with different sensors. To validate the method, we report experiments in unknown, nonpredictable, unstructured, cluttered, dense and complex environments. Keywords: Autonomous mobile robots, obstacle avoidance, robot navigation. 1. INTRODUCTION This paper addresses robot navigation. In typical mobile robotic missions the indoor/outdoor environment is unknown and non-predictable (e.g. offices, museums, planetary surfaces). From the navigation point of view, the different nature of these environments also imposes a wide range of difficulties: They are unstructured, non-predictable, dense, cluttered, etc. In addition, the robots that are designed to accomplish mobile tasks in these environments usually exhibit different shapes and specific kinematics and dynamics. To design the safe motion generation task, there are at least three concepts to address: the method of navigation, the specific robot shape, and the robot s kinematics and dynamics. 1 This work was partially supported by Spanish CICYT project DPI2000-1272. The navigation technique that we use is the reactive collision avoidance approach (O.Khatib, 1986), (J.Borenstein and Y.Koren, 1991b), (I.Ulrich and J.Borenstein, 1998), (D.Fox et al., 1997), (J.Minguez and L.Montano, 2000), (S.Quinlan and O.Khatib, 1993) among others. Based on a perception-action process, they generate collision-free motion commands in a goal-directed fashion. The main advantage is that they require a very low computational load. This provides the system with the possibility of a high-rate environmental feedback (which is wellsuited in unknown and non-predictable environments). The drawbacks of these approaches are that they only produce sub-optimal solutions, and they cannot guarantee to reach the goal location. Currently, most of the robots designed exhibit kinematic and dynamic constraints. For these robots, the navigation method has to take into account these constraints. Otherwise, the robot approximately exe-

cutes the motion calculated by the reactive method (O.Khatib, 1986), (J.Borenstein and Y.Koren, 1991b), (J.Minguez and L.Montano, 2000), (S.Quinlan and O.Khatib, 1993). The robot s geometric constraint, that is the specific robot shape, is a much harder problem in reactive navigation. Classically, the robot shape is taken into account by translating the problem into the configuration space (J.C.Latombe, 1991), where a point represents the robot. To map the obstacles onto the configuration space is a difficult and very time-consuming task. Some reactive navigation methods avoid the configuration space computation by assuming circular geometry and checking collisions in the workspace (J.Borenstein and Y.Koren, 1991b), (J.Minguez and L.Montano, 2000), (S.Quinlan and O.Khatib, 1993). If these methods are used over non-circular bases, the robot shape needs to be approximated under constraining the method solution. This paper presents the generalization of a reactive navigation method - Nearness Diagram Navigation - to take into account the specific robot s shape, kinematics and dynamics. 2. THE FRAMEWORK Our approach is based on breaking down the motion generation process into three sub-problems related with: (1) collision avoidance, (2) the kinematic and dynamic constraints, and (3) the geometric constraints: (1) Assuming a circular robot free of motion constraints, the reactive collision avoidance approach - Nearness Diagram Navigation - is used to calculate the most promising motion direction and the desired velocity. (2) The Motion Generator uses the information provided by the Nearness Diagram Navigation to calculate a motion command that takes into account the kinematic and dynamic constraints. (3) If the robot is non-circular, the Shape Corrector modifies the pre-calculated motion command to take into account the robot s shape. Fig. 1 illustrates the complete process. Seen as a whole, this framework generates the collision-free motion commands to drive a kinematic, dynamic, and geometric constrained mobile platform towards a given goal location. We next analyze each of these modules. Let us start by the reactive method used - Nearness Diagram Navigation. 2.1 Nearness Diagram Navigation The Nearness Diagram Navigation (ND) (J.Minguez and L.Montano, 2000) is a reactive collision avoidance approach. Given depth information obtained from perceptions of the environment and a goal location, the Holonomic Circular NEARNESS DIAGRAM Non Holonomic Circular MOTION GENERATOR Non Holonomic Rectangular SHAPE CORRECTOR ROBOT Fig. 1. The reactive navigation problem breaken down in subproblems. method calculates a motion command (most promising motion direction and the velocity) to drive a holonomic and circular robot towards the goal location whilst avoiding collisions with the environment. The ND is designed using the situated-activity paradigm of behavioral design (R.Arkin, 1998). First, a set of situations is defined to fully describe the relative state of the robot, obstacle distribution and goal location. Subsequently, one action is designed for each situation. In real time, the perception is used to identify the current situation, and the associated action is executed generating the motion commands. The ND computes a velocity vector (velocity module, v ND, and velocity direction, θ ND ) for each sample period. Good results in very cluttered, complex and dense environments have been reported using the ND. This is the main motivation to select the ND off-the-shelf for our framework. The ND s limitation is that it does not take the kinematic constraints, dynamic constraints, and non-circular shapes into account. This paper addresses a generalization of this reactive method to take these constraints into account. 2.2 The Kinematic and Dynamic Constraints Once the ND has calculated the most promising motion direction and the desired velocity, we still need to convert this information into motion commands for the non-holonomic mobile base. To accomplish this we use the Motion Generator. The Motion Generator (MG) (J.R.Asensio and L.Montano, 2002) is a dynamic model-based robot controller for differential-drive robots. Each sample period, the MG computes the velocity commands from a virtual force applied to a point on the robot. The MG has significant advantages: (1) The model implicitly takes into account the kinematic and dynamic constraints, thus the controller provides feasible commands for a real robot. (2) The model s parameters have a clear physical sense. This allows an easy tuning of the parameters in order to obtain the desired dynamic behavior (non overshooting during turns, limits in velocities and accelerations). (3) The model filters the sudden changes in direction of commanded motions, which are usually produced by many reactive navigation methods.

1 0.5 0 0.5 1 1.5 2 2.5 3 3.5 4 0.03 LINEAR VELOCITY Safety Area 2 1.5 1 0.5 0 0.5 MOTION GENERATOR X m/sec 0.025 0.02 0.015 0.01 0.005 0 0 5 10 15 20 25 30 35 40 45 ITERATION 0 ANGULAR VELOCITY ND sectorization point ND solution Safety Area ND sectorization point Forward Part ND solution 1 F 0.01 0.02 1.5 2 rad/sec 0.03 0.04 Inscribed Circle 2.5 3 0.05 0.06 0 5 10 15 20 25 30 35 40 45 ITERATION Backward Part Fig. 2. a) Robot s trajectory. b) Translational and rotational velocities (motion command) obtained with the MG. Fig. 2a illustrates the robot moving between two locations. The input of the MG is a force, F, recalculated at each sampling period, which pulls the model towards the goal location. The output of the MG is the motion command given to the differential-driven robot v =(v,w). See Fig. 2b. We still need to connect the Nearness Diagram Navigation and the Motion Generator, Fig. 1. The most promising motion direction, θ ND, and the velocity, v ND, obtained with the ND are transformed into a force F =( F,θF ), the input of the MG. Fig. 3. a) Circular robot. b) Rectangular robot. Emergency Stop area Obstacle Left Safety Margin Obstacle Emergency Stop Area Free walking area X Goal Obstacle Right Safety Magin F = F max. v ND v max, θ F = θ ND (1) This framework calculates the collision-free motion commands to drive a circular and differential-driven robot towards the goal location. 2.3 The Geometric Constraint SOLUTION WITH w=0 BACK-LEFT MARGIN FINAL SOLUTION....... ND SOLUTION FOR THE ND SOLUTION At this point, we have used the Nearness Diagram Navigation and the Motion Generator to calculate the collision-free motion commands for a circular and differential-driven platform. So far, the reactive method only takes into account a circular geometry, other robot shapes are not considered. To extend this framework to take into account other geometries, we use the Shape Corrector (See Fig. 1). For now on we concentrate on rectangular shapes (the square shape is a particular case). In a first step, the - ND + MG - framework is used to calculate the motion command approximating the robot shape by the inscribed circle (see Fig. 3a). (It is a non-conservative selection motivated by the type of environment: Very dense, complex and cluttered, where the circumscribed circle is a coarse approximation). The role of the Shape Corrector is to modify the pre-calculated motion command to protect the two parts of the robot not covered by the inscribed circle, (the forward and backwards part), see Fig. 3b. The - ND + MG - is a framework that calculates motion commands to produce instantaneous forward motion v >= 0. (The reactive method is constrained to calculate instantaneous forward directions of motion). Then, the Shape corrector is based on three situations that exploit this constraint: BACK-CENTER MARGIN INITIAL (c) BACK-RIGHT MARGIN Fig. 4. a) Inminent collision.. b) Backwards collision danger. c) Forward collision danger. (1) Imminent collision: The robot is in this situation when the collision cannot be avoided with any sequence of forward motions. The motion command stops the robot (v = 0,w = 0), because the collision is imminent. A flag is then fired to launch a higher-level module to remove the robot from this situation (e.g. a motion planner). Fig. 4a illustrates this situation: When there are obstacles within the Emergency Stop Area (calculated from the circumscribed circle to the robot shape), no motion with v >= 0 (forward motion) or set of them can avoid the collision. (2) Forward collision danger: The robot is in this situation when there is a potential risk of entering into an Imminent collision situation. To detect it, we define a Safety Margin (divided into Left and Right Safety Margins) to enclose the Emergency Stop Area, see Fig. 4c. When there are obstacles within the Safety Margin the robot is

in this situation. The motion command stops and turn the robot in place (v = 0,w >< 0) to clear the Safety Margin of obstacles. The selection of the turn direction depends on: (1) the part of the Safety Margin that contains obstacles, and (2) an internal piece of information of the Nearness Diagram Navigation called - free walking area. Deeper details are out of the scope of the paper, but it is important to note that the result clears the Safety Margin of obstacles, implicitly avoiding the Imminent collision situation. Fig. 4b illustrates an example of this situation, in which the robot stops and turns right in place. (3) Backward collision danger: The robot is in this situation when the pre-calculated motion command would produce a collision with the back part of the robot. To detect it, we analytically calculate the trajectory, which would be obtained by the execution of the pre-calculated motion command (following (D.Fox et al., 1997)). Then, the robot motion is simulated over the trajectory to check for collisions. For safety reasons, the back part of the robot is extended with a Safety Margin (divided into three parts Back-Left, Back-Right and Back-Center Safety Margins), see Fig. 4c. Then we distinguish three cases: A collision is detected with the Back-Left Margin. The angle between the ND solution and the direction that would produce w = 0 is discretized in sub-directions. The MG calculates a new motion command by using one of those subdirections. The new motion command is tested for collisions, repeating the procedure until a collision-free motion command is found. Fig. 4b illustrates an example where the pre-calculated motion command produces a collision with the Back-Left Margin. Some intermediate directions are tested until a collision-free one is found. A collision is detected with the Back-Right Margin. The above procedure is repeated but towards the right-hand direction. A collision is detected with Back-Center Margin, or simultaneously with Back-Left and Back- Right Margins. The motion command is a forward motion without rotation (v >< 0,w = 0). 3. EXPERIMENTAL RESULTS This framework has been tested in four indoor and one outdoor robots. The main characteristics of the robots are: (1) they are differential-driven robots except the outdoor robot that can be set to work in differentialdriven mode. (2) The robots are circular, square and rectangular. (3) The available on-board sensors are ultrasounds, 2D and 3D laser rangefinders, and a stereo pair of cameras. To adapt the general framework to each robot, the main adjustments were: (1) An special safety area (for each robot geometry) was designed for the Near- 1m INITIAL X X (c) Fig. 5. a) Nomadic Scout robot. b) Simulated experiments with laser. c) Real experiment with ultrasounds. ness Diagram Navigation (see Fig. 3a and Fig. 3b). (2) The Motion Generator parameters were tuned to have the desired dynamic behavior compatible with each platform constraints (due to the different motion capabilities of each robot). (3) Only some geometric parameters needed changes in the Shape Corrector. The experiments reported have a common objective: To show that this framework is able to safely drive a kinematic, dynamic, and geometric constrained mobile platform in very dense, complex and cluttered environments. This is the type of environment where other approaches are susceptible to failure for the following reasons: (1) the reactive method itself. (2) Approximations in the motion generated. (3) Approximations in the robot shape. In all the experiments the environment was completely unknown, and only the goal location was given in advance to the robot. 3.1 Circular robots For circular robots we use the Nearness Diagram Navigation + Motion Generator framework. Scout This framework has been implemented in an Scout (Nomadic technologies) at the Instituto Superior Técnico de Lisboa, Portugal. The Scout is a circular and differential-driven robot with two active wheels, that moves up to v max = 1m/sec. This base has a ring of 16 Polaroid ultrasounds, and it is equipped with a SICK planar laser rangefinder with a field of view of 180, a range of 32m, and an accuracy of up to 1cm. See Fig. 5a.

INITIAL Fig. 7. a) Hilare2 platform. b) Real Experiment. Fig. 6. a) Otilio platform. b) Real Experiment. Fig. 3a illustrates the robot model and the point used to apply the ND. The sampling time selected was T = 0.25msec and the maximum speed v = 0.3m/sec. We tested the framework in a simulator and in the real robot. In the simulator we used a simulated SICK laser. In the real robot we used the ultrasounds as main sensors. We processed the ultrasound measurements to build depth maps following (J.Borenstein and Y.Koren, 1991a). The experiments showed good results in dense, complex and cluttered environments. See Fig. 5b,c. 3.2 Rectangular and square robots For square and rectangular robots we use the Nearness Diagram Navigation + Motion Generator + Shape Corrector framework. Otilio This framework has been implemented and tested on the Otilio platform at the Universidad de Zaragoza (Spain). Otilio is a differential-driven robot, which has two driving wheels and its maximum speed is 1m/sec. The robot is square (0.8m 0.8m). It is equipped with a 3D laser rangefinder that scans the environment with a maximum range of 6.5m and an accuracy up to 2.5cm. See Fig. 6a. For the experiments, we used the last 20 laser measurements, projected onto the floor and corrected to the actual robot location (short-time memory). The sampling period was set to T = 0.4sec and the maximum speed to 0.3m/sec. Fig. 6b. shows an experiment in a typical indoor environment. The robot passed through two doors (the last one was half-open) and a corridor full of obstacles. The goal location was successfully reached without any collisions with the environment. Hilare2 and Hilare2Bis This framework has been implemented and tested on the Hilare2 and Hilare2Bis platforms at LAAS (CNRS), France. Both platforms have two driving wheels and their maximum speed is 1.5m/sec. The robots are rectangular (1.3m 0.8m) and they are equipped with a SICK laser rangefinder. The main INITIAL Fig. 8. a) Hilare2Bis. b) Real Experiment. difference between both robots is that Hilare2Bis is equipped with a GT6A arm with 6 degrees of freedom. The arm weighs about 60kg and it is located in the forward part of the robot. This produces a high inertia when the robot turns. See Fig. 7a and Fig. 8a. For the experiments, we used the last 40 laser measurements corrected with the robot odometry (shorttime memory). The sampling period was set to T = 0.4sec and the maximum speed to 0.3m/sec. To take the inertia into account in Hilare2Bis, we have tuned some parameters of the Motion Generator to have an adequate dynamic response. Fig. 7b shows an experiment with Hilare2 in a very dense, complex and cluttered environment. The robot passed through a very narrow corridor (< 10cm at sides) and it maneuvered reactively in a constrained space (central part of the experiment) to find the exit. The goal location was successfully reached without collisions with the environment. Fig. 8b shows an experiment with Hilare2Bis in a very complex and dense environment built while the robot was moving (thiscreates the environment s nonpredictability component). The robot passed through the asymmetric corridor and in the last part of the experiment it maneuvered to the right to reach the goal location. The robot successfully arrived at the goal location without collisions with the environment. Lama This framework has been implemented and tested on the outdoor Lama platform at LAAS (CNRS), France. Lama has 6 driving wheels that can be programmed to work in differential-drive mode. The robot is rectangular (1.85m 1.2m) and its maximum speed is

Fig. 9. a) Lama platform. b) Real Experiment. INTIAL OBSTACLES 0.17m/sec. For the collision avoidance task we used a pair of B/W cameras. See Fig. 9. The obstacle information is obtained with a particular probabilistic obstacle detection procedure (H.Haddad et al., 1998). The perceived area is described by a set of polygonal cells. By means of a Bayesian classifier, the cells are labeled with a probability that an obstacle will occupy them. The image-processing period is about four seconds. The sampling time was set to T = 0.4sec and the maximum speed 10cm/sec. The experiment was conducted in a typical outdoor environment (see Fig. 9b). The framework drove the robot towards the goal location avoiding collisions with the obstacles. The complete run was about 20m. 4. CONCLUSIONS We have presented a framework to generalize a reactive navigation method - Nearness Diagram Navigation - to work on robots with kinematic, dynamic and geometric constraints. This framework generates reactive motion commands to drive a mobile platform towards a goal location whilst avoiding collisions with the environment. We have shown experiments in very dense, complex and cluttered environments, where: (1) it is necessary to use a reactive method able to deal with these type of environments. (2) The robot s kinematic and dynamic constraints limit the motion capabilities, and this has to be taken into account. (3) The geometric constraint of the robot, that is the robot shape, also reduces the possible collision-free motions and this has to be taken into account. To validate the proposed approach, and demonstrate the easy portability among different platforms, the framework has been tested in five different robots at three different laboratories. We also tested the sensor influence by using ultrasounds, 2D lasers, 3D lasers and vision. The results were very satisfactory, and we were able to safely move the mobile platforms during hours of tests. From our point of view the main limitation of the framework is the division of the navigation problem into subproblems. This is an underconstrainted solution since the kinematic, dynamic, and geometric constraints are not explicitly taken into account in the reactive method stage. The reactive collision avoidance approach calculates solutions that separately are converted into feasible motion commands according with the platform constraints. The results are remarkable with this framework because the typical mobile platforms have quick dynamic and the kinematic is not very significant with the small sample periods used. On the other hand the result would be degraded. 5. ACKNOWLEDGEMENT We thank R. Alami and T. Simeon of LAAS/CNRS (France) for accepting J.Minguez into their working group. Moreover, we thank S. Fleury of LAAS/CNRS (France), for her help with algorithm implementation on the Hilare2, Hilare2Bis and Lama platforms. We thank J.Santos-Victor of ISR/IST of Lisbone (Portugal) for accepting J.Minguez into his working group. Moreover, we thank D.Ortin of University of Zaragoza (Spain) and C.Marques of ISR/IST of Lisbone (Portugal) for her help with the algorithm implementation on the Scout platform. REFERENCES D.Fox, W.Burgard and S.Thrun (1997), The dynamic window approach to collision avoidance, IEEE Transactions on Robotics and Automation 4:1. H.Haddad, M.Khatib, S.Lacroix and R.Chatila (1998), Reactive navigation in outdoor environments using potential fields, IEEE/RSJ International Conference on Robotics and Automation (ICRA 1998). I.Ulrich and J.Borenstein (1998), Vfh+: Reliable obstacle avoidance for fast mobile robots, IEEE International Conference on Robotics and Automation p. 1572. J.Borenstein and Y.Koren (1991a), Histogramic inmotion mapping for mobile robot obstacle avoidance, IEEE Journal of Robotics and Automation 7(4), 535 539. J.Borenstein and Y.Koren (1991b), The vector field histogram (vfh)-fast obstacle avoidance for mobile robots, IEEE Transactions on Robotics and Automation 7(3). J.C.Latombe (1991), Robot Motion Planning, Kluwer Academic Plubishers. J.Minguez and L.Montano (2000), Nearness diagram navigation (nd): A new real time collision avoidance approach, IEEE/RSJ International Conference on Intelligent Robots and Systems. J.R.Asensio and L.Montano (2002), A kinematic and dynamic model-based motion controller for mobile robots, International Federation of Automatic Control, IFAC 2002. O.Khatib (1986), Real-time obstacle avoidance for manipulators and mobile robots, The International Journal of Robotics Research 5(1). R.Arkin (1998), Behavior-based robotics, MIT Press. S.Quinlan and O.Khatib (1993), Elastic bands: Connecting path planning and control, IEEE International Conference on Robotics and Automation 2, 802 807.