Home /Research /Closest Gap based (CG) reactive obstacle avoidance Navigation for highly cluttered environments
OTHER

Closest Gap based (CG) reactive obstacle avoidance Navigation for highly cluttered environments

M Mujahad, David G. Fischer, Bärbel Mertsching, Hussein Jaddu

Year
2010
Citations
49

Abstract

A new reactive collision avoidance approach for mobile robots moving in cluttered and complex environments was developed and implemented. The novelty of this approach lies in the creation of a new method for analyzing openings in front of the robot that highly reduces their number when compared with the Nearness-Diagram Navigation (ND) technique, particularly in complex scenarios. Moreover, the angular width of the chosen (selected) gap with respect to the robot vision is taken into consideration. Consequently, oscillations are alleviated, the computational complexity is reduced and a smoother behavior will be achieved. Our technique adjusts the motion law proposed in the Smooth Nearness-Diagram Navigation (SND) method to generate safer paths for the robot by considering the ratio of threats on its sides and applying stricter deviation against an obstacle as it gets closer to the robot. Hence, the problem of deadlock occurring in narrow corridors, with high threats on one side and low threats on the other, is solved without affecting the smoothness behavior. Simulation and experimental results demonstrate the power of the proposed approach.

Keywords

Obstacle avoidanceSmoothnessDeadlockComputer scienceRobotCollision avoidanceMobile robotObstacleComputer visionArtificial intelligence

Related papers

Browse all OTHER papers