Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and loc...

A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...

This paper presents a path planning technique for a mobile manipulator whose end-effector path is imposed by a given task. The planning is done decoupling the kinematics of the mobile platform and the manipulator, and planning for the former as a normal mobile robot. Two criteria for planning the path were implemented, one minimizing the need to turn the mobile robot and the other minimizing th...

This paper presents the use of a modified ant colony optimization algorithm and interactive web technologies for the problems of real-time path planning and navigation for an autonomous mobile robot. Assume that the mobile robot serves in an office building for delivering documents and packages, and all staff in different locations can assign tasks to the robot via a web-based application. Ther...

This project concerns the design and fabrication of the Automated Guided Robot (AGR) prototype, utilizing genetic algorithm (GA) as a mainframe in helping the robot to generate a self-understanding of the area of work and mobilization to a destination desired by the user. The main objective of this project is to create and develop a Path Planning Mobile Robot able to avoid obstacles in its path...

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

A critical operation in robot path planning is the veriication for collision between the robot and the obstacles in its environment. In this contribution we present a new collision detector KCD dedicated to path planning for mechanical devices and robots in industrial-size CAD models. We describe the architecture of KCD and the way in which it is applied in the path planning tool Move3D. We rep...

In this paper, a knowledge-based genetic algorithm (GA) is proposed for dynamic path planning of a mobile robot in unstructured complex environments. A unique representation method is proposed for the 2-dimensional complex robot environment, where the obstacles could be of arbitrary shape. According to the problem representation, an effective evaluation method is developed specially for the pro...

As for the limitations of algorithms in global path planning of mobile robot at present, this study applies the improved simulated annealing algorithm artificial neural networks to path planning of mobile robot in order to better the weaknesses of great scale of iteration computation and slow convergence, since the best-reserved simulated annealing algorithm was introduced and it was effectivel...

Path planning is one of the important aspects in the field of mobile robots. To solve this problem many approaches have been developed. The present research work aims to model immunised system architecture for path planning of autonomous mobile robot by avoiding obstacles, escaping traps and reaching its goal effectively within its environment. Simulation results presented to verify the effecti...