A generalized laser simulator algorithm for optimal path planning in constraints environment

Path planning plays a vital role in autonomous mobile robot navigation, and it has thus become one of the most studied areas in robotics. Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. This approach allows finding the path for a mobile robot while avoiding obstacles, searching for a goal, considering some constraints and finding an optimal path during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating a wave of points in all directions towards the goal point with adhering to constraints. A simulation study employing the proposed approach is applied to the grid map settings to determine a collision-free path from the start to goal positions. First, the grid mapping of the robot's workspace environment is constructed, and then the borders of the workspace environment are detected based on the new proposed function. This function guides the robot to move toward the desired goal. Two concepts have been implemented to find the best candidate point to move next: minimum distance to goal and maximum index distance to the boundary, integrated by negative probability to sort out the most preferred point for the robot trajectory determination. In order to construct an optimal collision-free path, an optimization step was included to find out the minimum distance within the candidate points that have been determined by GLS while adhering to particular constraint's rules and avoiding obstacles. The proposed algorithm will switch its working pattern based on the goal minimum and boundary maximum index distances. For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. The proposed method has been tested in several test environments with different degrees of complexity. Twenty different arbitrary environments are categorized into four: Simple, complex, narrow, and maze, with five test environments in each. The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. The mean value of the path cost achieved by the proposed approach is 4% and 15% lower than PRM and RRT, respectively. The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. Finally, to verify the performance of the developed method for generating a collision-free path, experimental studies were carried out using an existing WMR platform in labs and roads. The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. The image processing includes several operations to apply GLS on the prepared local map. The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. The experimental test shows that the proposed method can generate the shortest path and best smooth trajectory from start to goal points in comparison with the laser simulator

Cooperative Swarm Optimisation of Unmanned Surface Vehicles

Edited version embargoed 10 07.01.2020 Full version: Access restricted permanently due to 3rd party copyright restrictions. Restriction set on 11/04/2019 by AS, Doctoral CollegeWith growing advances in technology and everyday dependence on oceans for resources, the role of unmanned surface vehicles (USVs) has increased many fold. Extensive operations of USVs having naval, civil and scientific applications are currently being undertaken in various complex marine environments and demands are being placed on them to increase their autonomy and adaptability. A key requirement for the autonomous operation of USVs is to possess a multi-vehicle framework where they can operate as a fleet of vehicles in a practical marine environment with multiple advantages such as surveying of wider areas in less time. From the literature, it is evident that a huge number of studies has been conducted in the area of single USV path planning, guidance and control whilst very few studies have been conducted to understand the implications of the multi vehicle approaches to USVs. This present PhD thesis integrates the modules of efficient optimal path planning, robust path following guidance and cooperative swarm aggregation approach towards development of a new hybrid framework for cooperative navigation of swarm of USVs to enable optimal and autonomous operation in a maritime environment. Initially, an effective and novel optimal path planning approach based on the A* algorithm has been designed taking into account the constraint of a safety distance from the obstacles to avoid the collisions in scenarios of moving obstacles and sea surface currents. This approach is then integrated with a novel virtual target path following guidance module developed for USVs where the reference trajectory from the path planner is fed into the guidance system. The novelty of the current work relies on combining the above mentioned integrated path following guidance system with decentralised swarm aggregation behaviour by means of simple potential based attraction and repulsion functions to maintain the centroid of the swarm of USVs and thereby guiding the swarm of USVs onto a reference path. Finally, an optimal and hybrid framework for cooperative navigation and guidance of fleet of USVs, implementable in practical maritime environments and effective for practical applications at sea is presented.Commonwealth Scholarship Commissio