Intelligent Navigation Service Robot Working in a Flexible and Dynamic Environment

Numerous sensor fusion techniques have been reported in the literature for a number of robotics applications. These techniques involved the use of different sensors in different configurations. However, in the case of food driving, the possibility of the implementation has been overlooked. In restaurants and food delivery spots, enhancing the food transfer to the correct table is neatly required, without running into other robots or diners or toppling over. In this project, a particular algorithm module has been proposed and implemented to enhance the robot driving methodology and maximize robot functionality, accuracy, and the food transfer experience. The emphasis has been on enhancing movement accuracy to reach the targeted table from the start to the end. Four major elements have been designed to complete this project, including mechanical, electrical, electronics, and programming. Since the floor condition greatly affecting the wheels and turning angle selection, the movement accuracy was improved during the project. The robot was successfully able to receive the command from the restaurant and go to deliver the food to the customers\u27 tables, considering any obstacles on the way to avoid. The robot has equipped with two trays to mount the food with well-configured voices to welcome and greet the customer. The performance has been evaluated and undertaken using a routine robot movement tests. As part of this study, the designed service wheeled robot required to be with a high-performance real-time processor. As long as the processor was adequate, the experimental results showed a highly effective search robot methodology. Having concluded from the study that a minimum number of sensors are needed if they are placed appropriately and used effectively on a robot\u27s body, as navigation could be performed by using a small set of sensors. The Arduino Due has been used to provide a real-time operating system. It has provided a very successful data processing and transfer throughout any regular operation. Furthermore, an easy-to-use application has been developed to improve the user experience, so that the operator can interact directly with the robot via a special setting screen. It is possible, using this feature, to modify advanced settings such as voice commands or IP address without having to return back to the code

Learning and Co-operation in Mobile Multi-Robot Systems

Merged with duplicate record 10026.1/1984 on 27.02.2017 by CS (TIS)This thesis addresses the problem of setting the balance between exploration and exploitation in teams of learning robots who exchange information. Specifically it looks at groups of robots whose tasks include moving between salient points in the environment. To deal with unknown and dynamic environments,such robots need to be able to discover and learn the routes between these points themselves. A natural extension of this scenario is to allow the robots to exchange learned routes so that only one robot needs to learn a route for the whole team to use that route. One contribution of this thesis is to identify a dilemma created by this extension: that once one robot has learned a route between two points, all other robots will follow that route without looking for shorter versions. This trade-off will be labeled the Distributed Exploration vs. Exploitation Dilemma, since increasing distributed exploitation (allowing robots to exchange more routes) means decreasing distributed exploration (reducing robots ability to learn new versions of routes), and vice-versa. At different times, teams may be required with different balances of exploitation and exploration. The main contribution of this thesis is to present a system for setting the balance between exploration and exploitation in a group of robots. This system is demonstrated through experiments involving simulated robot teams. The experiments show that increasing and decreasing the value of a parameter of the novel system will lead to a significant increase and decrease respectively in average exploitation (and an equivalent decrease and increase in average exploration) over a series of team missions. A further set of experiments show that this holds true for a range of team sizes and numbers of goals

An Analysis Review: Optimal Trajectory for 6-DOF-based Intelligent Controller in Biomedical Application

With technological advancements and the development of robots have begun to be utilized in numerous sectors, including industrial, agricultural, and medical. Optimizing the path planning of robot manipulators is a fundamental aspect of robot research with promising future prospects. The precise robot manipulator tracks can enhance the efficacy of a variety of robot duties, such as workshop operations, crop harvesting, and medical procedures, among others. Trajectory planning for robot manipulators is one of the fundamental robot technologies, and manipulator trajectory accuracy can be enhanced by the design of their controllers. However, the majority of controllers devised up to this point were incapable of effectively resolving the nonlinearity and uncertainty issues of high-degree freedom manipulators in order to overcome these issues and enhance the track performance of high-degree freedom manipulators. Developing practical path-planning algorithms to efficiently complete robot functions in autonomous robotics is critical. In addition, designing a collision-free path in conjunction with the physical limitations of the robot is a very challenging challenge due to the complex environment surrounding the dynamics and kinetics of robots with different degrees of freedom (DoF) and/or multiple arms. The advantages and disadvantages of current robot motion planning methods, incompleteness, scalability, safety, stability, smoothness, accuracy, optimization, and efficiency are examined in this paper

Optimization of an Autonomous Mobile Robot Path Planning Based on Improved Genetic Algorithms

Mobile robots are intended to operate in a variety of environments, and they need to be able to navigate and travel around obstacles, such as objects and barriers. In order to guarantee that the robot will not come into contact with any obstacles or other objects during its movement, algorithms for path planning have been demonstrated. The basic goal while constructing a route is to find the fastest and smoothest route between the starting point and the destination. This article describes route planning using the improvised genetic algorithm with the Bezier Curve (GA-BZ). This study carried out two main experiments, each using a 20x20 random grid map model with varying percentages of obstacles (5%, 15%, and 30% in the first experiment, and 25% and 50% in the second). In the initial experiments, the population (PN), generation (GN), and mutation rate (MR) of genetic algorithms (GA) will be altered to the following values: (PN = 100, 125, 150, or 200; GN = 100, 125, 150; and MR = 0.1, 0.3, 0.5, 0.7) respectively. The goal is to evaluate the effectiveness of AMR in terms of travel distance (m), total time (s), and total cost (RM) in comparison to traditional GA and GA-BZ. The second experiment examined robot performance utilising GA, GA-BZ, Simulated Annealing (SA), A-Star (A*), and Dijkstra's Algorithms (DA) for path distance (m), time travel (s), and fare trip (RM). The simulation results are analysed, compared, and explained. In conclusion, the project is summarised

Genetically evolved dynamic control for quadruped walking

The aim of this dissertation is to show that dynamic control of quadruped locomotion is achievable through the use of genetically evolved central pattern generators. This strategy is tested both in simulation and on a walking robot. The design of the walker has been chosen to be statically unstable, so that during motion less than three supporting feet may be in contact with the ground. The control strategy adopted is capable of propelling the artificial walker at a forward locomotion speed of ~1.5 Km/h on rugged terrain and provides for stability of motion. The learning of walking, based on simulated genetic evolution, is carried out in simulation to speed up the process and reduce the amount of damage to the hardware of the walking robot. For this reason a general-purpose fast dynamic simulator has been developed, able to efficiently compute the forward dynamics of tree-like robotic mechanisms. An optimization process to select stable walking patterns is implemented through a purposely designed genetic algorithm, which implements stochastic mutation and cross-over operators. The algorithm has been tailored to address the high cost of evaluation of the optimization function, as well as the characteristics of the parameter space chosen to represent controllers. Experiments carried out on different conditions give clear indications on the potential of the approach adopted. A proof of concept is achieved, that stable dynamic walking can be obtained through a search process which identifies attractors in the dynamics of the motor-control system of an artificial walker

A Comprehensive Overview of Classical and Modern Route Planning Algorithms for Self-Driving Mobile Robots

Mobile robots are increasingly being applied in a variety of sectors, including agricultural, firefighting, and search and rescue operations. Robotics and autonomous technology research and development have played a major role in making this possible. Before a robot can reliably and effectively navigate a space without human aid, there are still several challenges to be addressed. When planning a path to its destination, the robot should be able to gather information from its surroundings and take the appropriate actions to avoid colliding with obstacles along the way. The following review analyses and compares 200 articles from two databases, Scopus and IEEE Xplore, and selects 60 articles as references from those articles. This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. Classical or traditional methods, such as Roadmaps (Visibility Graph and Voronoi Diagram), Potential Fields, and Cell Decomposition, and modern methodologies such as heuristic-based (Dijkstra Method, A* Algorithms, and D* Algorithms), metaheuristics algorithms (such as PSO, Bat Algorithm, ACO, and Genetic Algorithm), and neural systems such as fuzzy neural networks or fuzzy logic (FL) and Artificial Neural Networks (ANN) are described in this report. In this study, we outline the ideas, benefits, and downsides of modeling and path-searching technologies for a mobile robot

A Robotic System for In-Situ Measurement of Soil Total Carbon and Nitrogen

Surges in the cost of fertilizer in recent times coupled with the environmental effects of their over-application have driven the need for farmers to optimize the amount of fertilizer they apply on the farm. One of the key steps in determining the right amount of fertilizer to apply in a given field is measuring the amount of nutrients present in the soil. To ascertain nutrient deficiencies, most farmers perform wet chemistry analysis of soil samples which requires a lot of time and is expensive. In this research project, a robotic system was designed and developed that could autonomously move to predetermined GPS waypoints and estimate total carbon (TC) and total nitrogen (TN) content in the soil in-situ using visible and near-infrared reflectance spectroscopy - a faster and cheaper method to determine soil nutrients in real-time. For the locomotion of the robotic system, a Husky robotic platform by Clearpath Robotics was used. A Gen2 robotic arm by Kinova Robotics was used for the precise positioning of the probe in taking soil spectral measurement. The probe was custom designed and built to be used in conjunction with the robotic arm as an end-effector. Two lightweight and inexpensive spectrometers by OceanInsight, namely, Flame VisNIR and Flame NIR+, were used to capture the spectral signatures of soil. The prediction was done with a spectroscopic calibration model and External Parameter Orthogonalization (EPO) was applied to remove the moisture effect from the soil spectra. The robotic system was tested at University of Nebraska-Lincoln (UNL) NU-Spidercam phenotyping facility. Two sets of spectra were obtained from the field campaign: in-situ and dry-ground spectra. The dry-ground spectra were used as library scans and Partial Least Square Regression (PLSR) was used for the modeling. The in-situ spectra were randomly divided into EPO calibration and validation sets. Satisfactory results were obtained from the initial prediction on dry-ground validation set, with R2 (coefficient of determination) of 0.77 and RMSE (Root Mean Squared Error) of 0.15% for TC and R2 of 0.64 and RMSE of 171 ppm for TN. There was a reduction in R2 and an increase in RMSE values for both TC and TN when prediction was done directly on the in-situ validation set. For TC, the R2 dropped and RMSE increased to 0.25 and 0.29% respectively, and for TN, the R2 dropped and RMSE increased to 0.19 and 259 ppm respectively. This was primarily due to the presence of moisture in the field samples. The R2 increased to 0.62 and RMSE decreased to 0.2% for TC, and the R2 increased to 0.51 and RMSE decreased to 200 ppm for TN, when EPO was applied on both the in-situ validation and dry-ground sets. These findings highlight the importance of accounting for moisture effects in the prediction of soil properties using the robotic system and demonstrate the potential of the system in enabling soil monitoring and analysis in-situ. Advisor: Yufeng G