Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot. Issue 2 (14th May 2019)

• Record Type: Journal Article
• Authors: Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar
• Is Part Of: Robotica. Volume 38:Issue 2(2020)
• Page Start: 235
• Page End: 255
• Publication Date: 2019-05-14
• Subjects: Path planning, -- Image processing, -- Depth sensor, -- Mobile robot, -- Kinematic control, -- Probabilistic roadmap, -- Obstacle avoidance, -- Stability, -- Trajectory tracking; Robots -- Periodicals; 629.89205
• DOI: 10.1017/S0263574719000572
• Languages: English
• ISSNs: 0263-5747

Abstract

Summary: This paper presents a vision-based path planning strategy that aims to reduce the computational time required by a robot to find a feasible path from a starting point to the goal point. The proposed algorithm presents a novel strategy that can be implemented on any well-known path planning algorithm such as A*, D* and probabilistic roadmap (PRM), to improve the swiftness of these algorithms. This path planning algorithm is suitable for real-time scenarios since it reduces the computational time compared to the basis and traditional algorithms. To test the proposed path planning strategy, a tracking control strategy is implemented on a mobile platform. This control strategy consists of three major stages. The first stage deals with gathering information about the surrounding environment using vision techniques. In the second stage, a free-obstacle path is generated using the proposed reduced scheme. In the final stage, a Lyapunov kinematic tracking controller and two Artificial Neural Network (ANN) based-controllers are implemented to track the proposed path by adjusting the rotational and linear velocity of the robot. The proposed path planning strategy is tested on a Pioneer P3-DX differential wheeled mobile robot and an Xtion PRO depth camera. Experimental results prove the efficiency of the proposed path planning scheme, which was able to reduce the computational time by a large percentage which reached up to 88% of the time needed by the basis and traditional scheme, without significant adverse effect on the workability of the basis algorithm. Moreover, the proposed path planning algorithm has improved the path efficiency, in terms of the path length and trackability, challenging the traditional trade-off between swiftness and path efficiency.