Laser simulator: a novel search graph-based path planning approach

• Main Authors: Ali, Mohammed A. H., Mailah, Musa
• Format: Article
• Language: English
• Published: SAGE Publications Inc. 2018
• Subjects: TJ Mechanical engineering and machinery
• Online Access: http://eprints.utm.my/id/eprint/84596/1/MusaMailah2018_LaserSimulatorANovelSearchGraphbasedPath.pdf; http://eprints.utm.my/id/eprint/84596/; http://dx.doi.org/10.1177/1729881418804726
• Institution: Universiti Teknologi Malaysia

A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. With such approach, it is possible to apply constraints on the mobile robot trajectory while navigating in complex terrains such as in factories and road environments, as the first work of its kind. The main advantage of this approach is the ability to be used for both global/local path planning in the presence of constraints and obstacles in unknown environments. The principle of the laser simulator approach with all possibilities and cases that could emerge during path planning is explained to determine the path from initial to destination positions in a two-dimensional map. In addition, a comparative study on the laser simulator approach, A* algorithm, Voronoi diagram with fast marching and PointBug algorithms was performed to show the benefits and drawbacks of the proposed approach. A case study on the utilization of the laser simulator in both global and local path planning has been applied in a road roundabout setting which is regarded as a complex environment for robot path planning. In global path planning, the path is generated within a grid map of the roundabout environment to select the path according to the respective road rules. It is also used to recognize the real roundabout from a sequence of images during local path planning in the real-world system. Results show that the performance of the proposed laser simulator approach in both global and local environments is achieved with low computational and path costs, in which the optimum path from the selected start position to the goal point is tracked accordingly in the presence of the obstacles.