Path planning algorithms for autonomous navigation of a non-holonomic robot in unstructured environments

openPath planning is a crucial aspect of autonomous robot navigation, enabling robots to efficiently and safely navigate through complex environments. This thesis focuses on autonomous navigation for robots in dynamic and uncertain environments. In particular, the project aims to analyze the localization and path planning problems. A fundamental review of the existing literature on path planning algorithms has been carried on. Various factors affecting path planning, such as sensor data fusion, map representation, and motion constraints, are also analyzed. Thanks to the collaboration with E80 Group S.p.A., the project has been developed using ROS (Robot Operating System) on a Clearpath Dingo-O, an indoor mobile robot. To address the challenges posed by unstructured and dynamic environments, ROS follows a combined approach of using a global planner and a local planner. The global planner generates a high-level path, considering the overall environment, while the local planner handles real-time adjustments to avoid moving obstacles and optimize the trajectory. This thesis describes the role of the global planner in a ROS-framework. Performance benchmarking of traditional algorithms like Dijkstra and A*, as well as other techniques, is fundamental in order to understand the limits of these methods. In the end, the Hybrid A* algorithm is introduced as a promising approach for addressing the issues of unstructured environments for autonomous navigation of a non-holonomic robot. The core concepts and implementation details of the algorithm are discussed, emphasizing its ability to efficiently explore continuous state spaces and generate drivable paths.The effectiveness of the proposed path planning algorithms is evaluated through extensive simulations and real-world experiments using the mobile platform. Performance metrics such as path length, execution time, and collision avoidance are analyzed to assess the efficiency and reliability of the algorithms.Path planning is a crucial aspect of autonomous robot navigation, enabling robots to efficiently and safely navigate through complex environments. This thesis focuses on autonomous navigation for robots in dynamic and uncertain environments. In particular, the project aims to analyze the localization and path planning problems. A fundamental review of the existing literature on path planning algorithms has been carried on. Various factors affecting path planning, such as sensor data fusion, map representation, and motion constraints, are also analyzed. Thanks to the collaboration with E80 Group S.p.A., the project has been developed using ROS (Robot Operating System) on a Clearpath Dingo-O, an indoor mobile robot. To address the challenges posed by unstructured and dynamic environments, ROS follows a combined approach of using a global planner and a local planner. The global planner generates a high-level path, considering the overall environment, while the local planner handles real-time adjustments to avoid moving obstacles and optimize the trajectory. This thesis describes the role of the global planner in a ROS-framework. Performance benchmarking of traditional algorithms like Dijkstra and A*, as well as other techniques, is fundamental in order to understand the limits of these methods. In the end, the Hybrid A* algorithm is introduced as a promising approach for addressing the issues of unstructured environments for autonomous navigation of a non-holonomic robot. The core concepts and implementation details of the algorithm are discussed, emphasizing its ability to efficiently explore continuous state spaces and generate drivable paths.The effectiveness of the proposed path planning algorithms is evaluated through extensive simulations and real-world experiments using the mobile platform. Performance metrics such as path length, execution time, and collision avoidance are analyzed to assess the efficiency and reliability of the algorithms

Graceful Navigation for Mobile Robots in Dynamic and Uncertain Environments.

The ability to navigate in everyday environments is a fundamental and necessary skill for any autonomous mobile agent that is intended to work with human users. The presence of pedestrians and other dynamic objects, however, makes the environment inherently dynamic and uncertain. To navigate in such environments, an agent must reason about the near future and make an optimal decision at each time step so that it can move safely toward the goal. Furthermore, for any application intended to carry passengers, it also must be able to move smoothly and comfortably, and the robot behavior needs to be customizable to match the preference of the individual users. Despite decades of progress in the field of motion planning and control, this remains a difficult challenge with existing methods. In this dissertation, we show that safe, comfortable, and customizable mobile robot navigation in dynamic and uncertain environments can be achieved via stochastic model predictive control. We view the problem of navigation in dynamic and uncertain environments as a continuous decision making process, where an agent with short-term predictive capability reasons about its situation and makes an informed decision at each time step. The problem of robot navigation in dynamic and uncertain environments is formulated as an on-line, finite-horizon policy and trajectory optimization problem under uncertainty. With our formulation, planning and control becomes fully integrated, which allows direct optimization of the performance measure. Furthermore, with our approach the problem becomes easy to solve, which allows our algorithm to run in real time on a single core of a typical laptop with off-the-shelf optimization packages. The work presented in this thesis extends the state-of-the-art in analytic control of mobile robots, sampling-based optimal path planning, and stochastic model predictive control. We believe that our work is a significant step toward safe and reliable autonomous navigation that is acceptable to human users.PhDMechanical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/120760/1/jongjinp_1.pd

A New Approach towards Non-holonomic Path Planning of Car-like Robots using Rapidly Random Tree Fixed Nodes(RRT*FN)

Autonomous car driving is gaining attention in industry and is also an ongoing research in scientific community. Assuming that the cars moving on the road are all autonomous, this thesis introduces an elegant approach to generate non-holonomic collision-free motion of a car connecting any two poses (configurations) set by the user. Particularly this thesis focusses research on "path-planning" of car-like robots in the presence of static obstacles. Path planning of car-like robots can be done using RRT and RRT*. Instead of generating the non-holonomic path between two sampled configurations in RRT, our approach finds a small incremental step towards the next random configuration. Since the incremental step can be in any direction we use RRT to guide the robot from start configuration to end configuration. This "easy-to-implement" mechanism provides flexibility for enabling standard plan- ners to solve for non-holonomic robots without much modifications. Thus, strength of such planners for car path planning can be easily realized. This thesis demon- strates this point by applying this mechanism for an effective variant of RRT called as RRT - Fixed Nodes (RRT*FN). Experiments are conducted by incorporating our mechanism into RRT*FN (termed as RRT*FN-NH) to show the effectiveness and quality of non-holonomic path gener- ated. The experiments are conducted for typical benchmark static environments and the results indicate that RRT*FN-NH is mostly finding the feasible non-holonomic solutions with a fixed number of nodes (satisfying memory requirements) at the cost of increased number of iterations in multiples of 10k. Thus, this thesis proves the applicability of mechanism for a highly constrained planner like RRT*-FN, where the path needs to be found with a fixed number of nodes. Although, comparing the algorithm (RRT*FN-NH) with other existing planners is not the focus of this thesis there are considerable advantages of the mechanism when applied to a planner. They are a) instantaneous non-holonomoic path generation using the strengths of that particular planner, b) ability to modify on-the-fly non-holomic paths, and c) simple to integrate with most of the existing planners. Moreover, applicability of this mechanism using RRT*-FN for non-holonomic path generation of a car is shown for a more realistic urban environments that have typical narrow curved roads. The experiments were done for actual road map obtained from google maps and the feasibility of non-holonomic path generation was shown for such environments. The typical number of iterations needed for finding such feasible solutions were also in multiple of 10k. Increasing speed profiles of the car was tested by limiting max speed and acceleration to see the effect on the number of iterations

Asymptotically Optimal Sampling-Based Motion Planning Methods

Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also optimize a cost function, such as path length. Formal path-quality guarantees for continuously valued search spaces are an active area of research interest. Recent results have proven that some sampling-based planning methods probabilistically converge toward the optimal solution as computational effort approaches infinity. This survey summarizes the assumptions behind these popular asymptotically optimal techniques and provides an introduction to the significant ongoing research on this topic.Comment: Posted with permission from the Annual Review of Control, Robotics, and Autonomous Systems, Volume 4. Copyright 2021 by Annual Reviews, https://www.annualreviews.org/. 25 pages. 2 figure

Learning Probabilistic Generative Models For Fast Sampling-Based Planning

Due to their simplicity and efficiency in high dimensional space, sampling-based motion planners have been gaining interest for robotic manipulation in recent years. We present several new learning approaches using probabilistic generative models for fast sampling-based planning. First, we propose fast collision detection in high dimensional configuration spaces based on Gaussian Mixture Models (GMMs) for Rapidly-exploring Random Trees (RRT). In addition, we introduce a new probabilistically safe local steering primitive based on the probabilistic model. Our local steering procedure is based on a new notion of a convex probabilistically safety corridor that is constructed around a configuration using tangent hyperplanes of confidence ellipsoids of GMMs learned from prior collision history. For efficient sampling, we suggest a sampling method with a learned Q-function with linear function approximation based on feature representations such as Radial Basis Functions. This sampling method chooses the optimal node from which to extend the search tree via the softmax function of learned state values. We also discuss a novel constrained sampling-based motion planning method for grasp and transport tasks with redundant robotic manipulators, which allows the best grasp configuration and approach direction to be automatically determined. Since these approaches with the learned probabilistic models require large size data and time for training, it is essential that they are able to be adapted to environmental change in an online manner. The suggested online learning approach with the Dirichlet Process Mixture Model (DPMM) can adapt the complexity to the data and learn new Gaussian clusters with streaming data in newly explored areas without batch learning. We have applied these approaches in a number of robot arm planning scenarios and have shown their utility and effectiveness in simulation and on a physical 7-DoF robot manipulator

Mobile robots and vehicles motion systems: a unifying framework

Robots perform many different activities in order to accomplish their tasks. The robot motion capability is one of the most important ones for an autonomous be- havior in a typical indoor-outdoor mission (without it other tasks can not be done), since it drastically determines the global success of a robotic mission. In this thesis, we focus on the main methods for mobile robot and vehicle motion systems and we build a common framework, where similar components can be interchanged or even used together in order to increase the whole system performance

Design, testing and validation of model predictive control for an unmanned ground vehicle

The rapid increase in designing, manufacturing, and using autonomous robots has attracted numerous researchers and industries in recent decades. The logical motivation behind this interest is the wide range of applications. For instance, perimeter surveillance, search and rescue missions, agriculture, and construction. In this thesis, motion planning and control based on model predictive control (MPC) for unmanned ground vehicles (UGVs) is tackled. In addition, different variants of MPC are designed, analysed, and implemented for such non-holonomic systems. It is imperative to focus on the ability of MPC to handle constraints as one of the motivations. Furthermore, the proliferation of computer processing enables these systems to work in a real-time scenario. The controller's responsibility is to guarantee an accurate trajectory tracking process to deal with other specifications usually not considered or solved by the planner. However, the separation between planner and controller is not necessarily defined uniquely, even though it can be a hybrid process, as seen in part of this thesis. Firstly, a robust MPC is designed and implemented for a small-scale autonomous bulldozer in the presence of uncertainties, which uses an optimal control action and a feed-forward controller to suppress these uncertainties. More precisely, a linearised variant of MPC is deployed to solve the trajectory tracking problem of the vehicle. Afterwards, a nonlinear MPC is designed and implemented to solve the path-following problem of the UGV for masonry in a construction context, where longitudinal velocity and yaw rate are employed as control inputs to the platform. For both the control techniques, several experiments are performed to validate the robustness and accuracy of the proposed scheme. Those experiments are performed under realistic localisation accuracy, provided by a typical localiser. Most conspicuously, a novel proximal planning and control strategy is implemented in the presence of skid-slip and dynamic and static collision avoidance for the posture control and tracking control problems. The ability to operate in moving objects is critical for UGVs to function well. The approach offers specific planning capabilities, able to deal at high frequency with context characteristics, which the higher-level planner may not well solve. Those context characteristics are related to dynamic objects and other terrain details detected by the platform's onboard perception capabilities. In the control context, proximal and interior-point optimisation methods are used for MPC. Relevant attention is given to the processing time required by the MPC process to obtain the control actions at each actual control time. This concern is due to the need to optimise each control action, which must be calculated and applied in real-time. Because the length of a prediction horizon is critical in practical applications, it is worth looking into in further detail. In another study, the accuracies of robust and nonlinear model predictive controllers are compared. Finally, a hybrid controller is proposed and implemented. This approach exploits the availability of a simplified cost-to-go function (which is provided by a higher-level planner); thus, the hybrid approach fuses, in real-time, the nominal CTG function (nominal terrain map) with the rest of the critical constraints, which the planner usually ignores. The conducted research fills necessary gaps in the application areas of MPC and UGVs. Both theoretical and practical contributions have been made in this thesis. Moreover, extensive simulations and experiments are performed to test and verify the working of MPC with a reasonable processing capability of the onboard process

Advances in Robot Navigation

Robot navigation includes different interrelated activities such as perception - obtaining and interpreting sensory information; exploration - the strategy that guides the robot to select the next direction to go; mapping - the construction of a spatial representation by using the sensory information perceived; localization - the strategy to estimate the robot position within the spatial map; path planning - the strategy to find a path towards a goal location being optimal or not; and path execution, where motor actions are determined and adapted to environmental changes. This book integrates results from the research work of authors all over the world, addressing the abovementioned activities and analyzing the critical implications of dealing with dynamic environments. Different solutions providing adaptive navigation are taken from nature inspiration, and diverse applications are described in the context of an important field of study: social robotics