Navigational control of multiple mobile robots in various environments

The thesis addresses the problem of mobile robots navigation in various cluttered environments and proposes methodologies based on a soft computing approach, concerning to three main techniques: Potential Field technique, Genetic Algorithm technique and Fuzzy Logic technique. The selected techniques along with their hybrid models, based on a mathematical support, solve the three main issues of path planning of robots such as environment representation, localization and navigation. The motivation of the thesis is based on some cutting edge issues for path planning and navigation capabilities, that retrieve the essential for various situations found in day-to-day life. For this purpose, complete algorithms are developed and analysed for standalone techniques and their hybrid models. In the potential field technique the local minima due to existence of dead cycle problem has been addressed and the possible solution for different situations has been carried out. In fuzzy logic technique the different controllers have been designed and their performance analysis has been done during their navigational control in various environments. Firstly, the fuzzy controller having all triangular members with five membership functions have been considered. Subsequently the membership functions are changed from Triangular to other functions, e.g. Trapezoidal, Gaussian functions and combinational form to have a more smooth and optimised control response. It has been found that the fuzzy controller with all Gaussian membership function works better compared to other chosen membership functions. Similarly the proposed Genetic algorithm is based on the suitable population size and fitness functions for finding out the robot steering angle in various cluttered field. At the end hybrid approaches e.g. Potential-Fuzzy, otential-Genetic, Fuzzy-Genetic and Potential-Fuzzy-Genetic are considered for navigation of multiple mobile robots. Initially the combination of two techniques has been selected in order to model the controllers and then all the techniques have been hybridized to get a better controller. These hybrid controllers are first designed and analysed for possible solutions for various situations provided by human intelligence. Then computer simulations have been executed extensively for various known and unknown environments. The proposed hybrid algorithms are embedded in the controllers of the real robots and tested in realistic scenarios to demonstrate the effectiveness of the developed controllers. Finally, the thesis concludes in a chapter describing the comparison of results acquired from various environments, showing that the developed algorithms achieve the main goals proposed by different approaches with a high level of simulations. The main contribution provided in the thesis is the definition and demonstration of the applicability of multiple mobile robots navigations with multiple targets in various environments based on the strategy of path optimisation

Multiple robot co-ordination using particle swarm optimisation and bacteria foraging algorithm

The use of multiple robots to accomplish a task is certainly preferable over the use of specialised individual robots. A major problem with individual specialized robots is the idle-time, which can be reduced by the use of multiple general robots, therefore making the process economical. In case of infrequent tasks, unlike the ones like assembly line, the use of dedicated robots is not cost-effective. In such cases, multiple robots become essential. This work involves path-planning and co-ordination between multiple mobile agents in a static-obstacle environment. Multiple small robots (swarms) can work together to accomplish the designated tasks that are difficult or impossible for a single robot to accomplish. Here Particle Swarm Optimization (PSO) and Bacteria Foraging Algorithm (BFA) have been used for coordination and path-planning of the robots. PSO is used for global path planning of all the robotic agents in the workspace. The calculated paths of the robots are further optimized using a localised BFA optimization technique. The problem considered in this project is coordination of multiple mobile agents in a predefined environment using multiple small mobile robots. This work demonstrates the use of a combinatorial PSO algorithm with a novel local search enhanced by the use of BFA to help in efficient path planning limiting the chances of PSO getting trapped in the local optima. The approach has been simulated on a graphical interface

Analysis and Development of Computational Intelligence based Navigational Controllers for Multiple Mobile Robots

Navigational path planning problems of the mobile robots have received considerable attention over the past few decades. The navigation problem of mobile robots are consisting of following three aspects i.e. locomotion, path planning and map building. Based on these three aspects path planning algorithm for a mobile robot is formulated, which is capable of finding an optimal collision free path from the start point to the target point in a given environment. The main objective of the dissertation is to investigate the advanced methodologies for both single and multiple mobile robots navigation in highly cluttered environments using computational intelligence approach. Firstly, three different standalone computational intelligence approaches based on the Adaptive Neuro-Fuzzy Inference System (ANFIS), Cuckoo Search (CS) algorithm and Invasive Weed Optimization (IWO) are presented to address the problem of path planning in unknown environments. Next two different hybrid approaches are developed using CS-ANFIS and IWO-ANFIS to solve the mobile robot navigation problems. The performance of each intelligent navigational controller is demonstrated through simulation results using MATLAB. Experimental results are conducted in the laboratory, using real mobile robots to validate the versatility and effectiveness of the proposed navigation techniques. Comparison studies show, that there are good agreement between them. During the analysis of results, it is noticed that CS-ANFIS and IWO-ANFIS hybrid navigational controllers perform better compared to other discussed navigational controllers. The results obtained from the proposed navigation techniques are validated by comparison with the results from other intelligent techniques such as Fuzzy logic, Neural Network, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and other hybrid algorithms. By investigating the results, finally it is concluded that the proposed navigational methodologies are efficient and robust in the sense, that they can be effectively implemented to solve the path optimization problems of mobile robot in any complex environment

Autonomous Topological Optimisation for Multi-robot Systems in Logistics

Multi-robot systems (MRS) are currently being introduced in many in-field logistics operations in large environments such as warehouses and commercial soft-fruit production. Collision avoidance is a critical problem in MRS as it may introduce deadlocks during the motion planning. In this work, a discretised topological map representation is used for low-cost route planning of individual robots as well as to easily switch the navigation actions depending on the constraints in the environment. However, this topological map could also have bottlenecks which leads to deadlocks and low transportation efficiency when used for an MRS. In this paper, we propose a resource container based Request-Release-Interrupt (RRI) algorithm that constrains each topological node with a capacity of one entity and therefore helps to avoid collisions and detect deadlocks. Furthermore, we integrate a Genetic Algorithm (GA) with Discrete Event Simulation (DES) for optimising the topological map to reduce deadlocks and improve transportation efficiency in logistics tasks. Performance analysis of the proposed algorithms are conducted after running a set of simulations with multiple robots and different maps. The results validate the effectiveness of our algorithms

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

Improving just-in-time delivery performance of IoT-enabled flexible manufacturing systems with AGV based material transportation

Autonomous guided vehicles (AGVs) are driverless material handling systems used for transportation of pallets and line side supply of materials to provide flexibility and agility in shop-floor logistics. Scheduling of shop-floor logistics in such systems is a challenging task due to their complex nature associated with the multiple part types and alternate material transfer routings. This paper presents a decision support system capable of supporting shop-floor decision-making activities during the event of manufacturing disruptions by automatically adjusting both AGV and machine schedules in Flexible Manufacturing Systems (FMSs). The proposed system uses discrete event simulation (DES) models enhanced by the Internet-of-Things (IoT) enabled digital integration and employs a nonlinear mixed integer programming Genetic Algorithm (GA) to find near-optimal production schedules prioritising the just-in-time (JIT) material delivery performance and energy efficiency of the material transportation. The performance of the proposed system is tested on the Integrated Manufacturing and Logistics (IML) demonstrator at WMG, University of Warwick. The results showed that the developed system can find the near-optimal solutions for production schedules subjected to production anomalies in a negligible time, thereby supporting shop-floor decision-making activities effectively and rapidly

Improving just-in-time delivery performance of IoT-enabled flexible manufacturing systems with AGV based material transportation

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. Autonomous guided vehicles (AGVs) are driverless material handling systems used for transportation of pallets and line side supply of materials to provide flexibility and agility in shop-floor logistics. Scheduling of shop-floor logistics in such systems is a challenging task due to their complex nature associated with the multiple part types and alternate material transfer routings. This paper presents a decision support system capable of supporting shop-floor decision-making activities during the event of manufacturing disruptions by automatically adjusting both AGV and machine schedules in Flexible Manufacturing Systems (FMSs). The proposed system uses discrete event simulation (DES) models enhanced by the Internet-of-Things (IoT) enabled digital integration and employs a nonlinear mixed integer programming Genetic Algorithm (GA) to find near-optimal production schedules prioritising the just-in-time (JIT) material delivery performance and energy efficiency of the material transportation. The performance of the proposed system is tested on the Integrated Manufacturing and Logistics (IML) demonstrator at WMG, University of Warwick. The results showed that the developed system can find the near-optimal solutions for production schedules subjected to production anomalies in a negligible time, thereby supporting shop-floor decision-making activities effectively and rapidly

A review: On path planning strategies for navigation of mobile robot

This paper presents the rigorous study of mobile robot navigation techniques used so far. The step by step investigations of classical and reactive approaches are made here to understand the development of path planning strategies in various environmental conditions and to identify research gap. The classical approaches such as cell decomposition (CD), roadmap approach (RA), artificial potential field (APF); reactive approaches such as genetic algorithm (GA), fuzzy logic (FL), neural network (NN), firefly algorithm (FA), particle swarm optimization (PSO), ant colony optimization (ACO), bacterial foraging optimization (BFO), artificial bee colony (ABC), cuckoo search (CS), shuffled frog leaping algorithm (SFLA) and other miscellaneous algorithms (OMA) are considered for study. The navigation over static and dynamic condition is analyzed (for single and multiple robot systems) and it has been observed that the reactive approaches are more robust and perform well in all terrain when compared to classical approaches. It is also observed that the reactive approaches are used to improve the performance of the classical approaches as a hybrid algorithm. Hence, reactive approaches are more popular and widely used for path planning of mobile robot. The paper concludes with tabular data and charts comparing the frequency of individual navigational strategies which can be used for specific application in robotics

Navigation Techniques for Control of Multiple Mobile Robots

The investigation reported in this thesis attempt to develop efficient techniques for the control of multiple mobile robots in an unknown environment. Mobile robots are key components in industrial automation, service provision, and unmanned space exploration. This thesis addresses eight different techniques for the navigation of multiple mobile robots. These are fuzzy logic, neural network, neuro-fuzzy, rule-base, rule-based-neuro-fuzzy, potential field, potential-field-neuro-fuzzy, and simulated-annealing- potential-field- neuro-fuzzy techniques. The main components of this thesis comprises of eight chapters. Following the literature survey in Chapter-2, Chapter-3 describes how to calculate the heading angle for the mobile robots in terms of left wheel velocity and right wheel velocity of the robot. In Chapter-4 a fuzzy logic technique has been analysed. The fuzzy logic technique uses different membership functions for navigation of the multiple mobile robots, which can perform obs..

Influence of the ratio on the mechanical properties of epoxy resin composite with diapers waste as fillers for partition panel application

Materials play significant role in the domestic economy and defense with the fast growth of science and technology field. New materials are the core of fresh technologies and the three pillars of modern science and technology are materials science, power technology and data science. The prior properties of the partition panel by using recycled diapers waste depend on the origin of waste deposits and its chemical constituents. This study presents the influence of the ratio on the mechanical properties of polymer in diapers waste reinforced with binder matrix for partition panel application. The aim of this study was to investigate the influence of different ratio of diapers waste polymer reinforced epoxy-matrix with regards to mechanical properties and morphology analysis. The polymer includes polypropylene, polystyrene, polyethylene and superabsorbent polymer (SAP) were used as reinforcing material. The tensile and bending resistance for ratio of 0.4 diapers waste polymers indicated the optimum ratio for fabricating the partition panel. Samples with 0.4 ratios of diapers waste polymers have highest stiffness of elasticity reading with 76.06 MPa. A correlation between the micro structural analysis using scanning electron microscope (SEM) and the mechanical properties of the material has been discussed