An hybridization of global-local methods for autonomous mobile robot navigation in partially-known environments

This paper deals with the navigation problem of an autonomous non-holonomic mobile robot in partially-known environment. In this proposed method, the entire process of navigation is divided into two phases: an off-line phase on which a distance-optimal reference trajectory enables the mobile robot to move from an initial position to a desired target which is planned using the B-spline method and the Dijkstra algorithm. In the online phase of the navigation process, the mobile robot follows the planned trajectory using a sliding mode controller with the ability of avoiding unexpected obstacles by the use of fuzzy logic controller. Also, the fuzzy logic and fuzzy wall-following controllers are used to accomplish the reactive navigation mission (path tracking and obstacle avoidance) for a comparative purpose. Simulation results prove that the proposed path planning method (B-spline) is simple and effective. Also, they attest that the sliding mode controller track more precisely the reference trajectory than the fuzzy logic controller (in terms of time elapsed to reach the target and stability of two wheels velocity) and this last gives best results than the wall-following controller in the avoidance of unexpected obstacles. Thus, the effectiveness of our proposed approach (B-spline method combined with sliding mode and fuzzy logic controllers) is proved compared to other techniques

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

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

A snake-based scheme for path planning and control with constraints by distributed visual sensors

YesThis paper proposes a robot navigation scheme using wireless visual sensors deployed in an environment. Different from the conventional autonomous robot approaches, the scheme intends to relieve massive on-board information processing required by a robot to its environment so that a robot or a vehicle with less intelligence can exhibit sophisticated mobility. A three-state snake mechanism is developed for coordinating a series of sensors to form a reference path. Wireless visual sensors communicate internal forces with each other along the reference snake for dynamic adjustment, react to repulsive forces from obstacles, and activate a state change in the snake body from a flexible state to a rigid or even to a broken state due to kinematic or environmental constraints. A control snake is further proposed as a tracker of the reference path, taking into account the robot’s non-holonomic constraint and limited steering power. A predictive control algorithm is developed to have an optimal velocity profile under robot dynamic constraints for the snake tracking. They together form a unified solution for robot navigation by distributed sensors to deal with the kinematic and dynamic constraints of a robot and to react to dynamic changes in advance. Simulations and experiments demonstrate the capability of a wireless sensor network to carry out low-level control activities for a vehicle.Royal Society, Natural Science Funding Council (China

A Survey on Passing-through Control of Multi-Robot Systems in Cluttered Environments

This survey presents a comprehensive review of various methods and algorithms related to passing-through control of multi-robot systems in cluttered environments. Numerous studies have investigated this area, and we identify several avenues for enhancing existing methods. This survey describes some models of robots and commonly considered control objectives, followed by an in-depth analysis of four types of algorithms that can be employed for passing-through control: leader-follower formation control, multi-robot trajectory planning, control-based methods, and virtual tube planning and control. Furthermore, we conduct a comparative analysis of these techniques and provide some subjective and general evaluations.Comment: 18 pages, 19 figure

Efficient Learning and Inference for High-dimensional Lagrangian Systems

Learning the nature of a physical system is a problem that presents many challenges and opportunities owing to the unique structure associated with such systems. Many physical systems of practical interest in engineering are high-dimensional, which prohibits the application of standard learning methods to such problems. This first part of this work proposes therefore to solve learning problems associated with physical systems by identifying their low-dimensional Lagrangian structure. Algorithms are given to learn this structure in the case that it is obscured by a change of coordinates. The associated inference problem corresponds to solving a high-dimensional minimum-cost path problem, which can be solved by exploiting the symmetry of the problem. These techniques are demonstrated via an application to learning from high-dimensional human motion capture data. The second part of this work is concerned with the application of these methods to high-dimensional motion planning. Algorithms are given to learn and exploit the struc- ture of holonomic motion planning problems effectively via spectral analysis and iterative dynamic programming, admitting solutions to problems of unprecedented dimension com- pared to known methods for optimal motion planning. The quality of solutions found is also demonstrated to be much superior in practice to those obtained via sampling-based planning and smoothing, in both simulated problems and experiments with a robot arm. This work therefore provides strong validation of the idea that learning low-dimensional structure is the key to future advances in this field

Dynamic obstacles avoidance algorithms for unmanned ground vehicles

En las últimas décadas, los vehículos terrestres no tripulados (UGVs) están siendo cada vez más empleados como robots de servicios. A diferencia de los robots industriales, situados en posiciones fijas y controladas, estos han de trabajar en entornos dinámicos, compartiendo su espacio con otros vehículos y personas. Los UGVs han de ser capaces de desplazarse sin colisionar con ningún obstáculo, de tal manera que puedan asegurar tanto su integridad como la del entorno. En el estado del arte encontramos algoritmos de navegación autónoma diseñados para UGVs que son capaces de planificar rutas de forma segura con objetos estáticos y trabajando en entornos parcialmente controlados. Sin embargo, cuando estos entornos son dinámicos, se planifican rutas más peligrosas y que a menudo requieren de un mayor consumo de energía y recursos, e incluso pueden llegar a bloquear el UGV en un mínimo local. En esta tesis, la adaptación de algunos algoritmos disponibles en el estado del arte para trabajar en entornos dinámicos han sido planteados. Estos algoritmos incluyen información temporal tales como los basados en arcos de curvatura (PCVM y DCVM) y los basados en ventanas dinámicas (DW4DO y DW4DOT). Además, se ha propuesto un planificador global basado en Lattice State Planner (DLP) que puede resolver situaciones donde los evitadores de obstáculos reactivos no funcionan. Estos algoritmos han sido validados tanto en simulación como en entornos reales, utilizando distintas plataformas robóticas, entre las que se incluye un robot asistente (RoboShop) diseñado y construido en el marco de esta tesis

Coordinated Sensor-Based Area Coverage and Cooperative Localization of a Heterogeneous Fleet of Autonomous Surface Vessels (ASVs)

Sensor coverage with fleets of robots is a complex task requiring solutions to localization, communication, navigation and basic sensor coverage. Sensor coverage of large areas is a problem that occurs in a variety of different environments from terrestrial to aerial to aquatic. In this thesis we consider the aquatic version of the problem. Given a known aquatic environment and collection of aquatic surface vehicles with known kinematic and dynamic constraints, how can a fleet of vehicles be deployed to provide sensor coverage of the surface of the body of water? Rather than considering this problem in general, in this work we consider the problem given a specific fleet consisting of one very well equipped robot aided by a number of smaller, less well equipped devices that must operate in close proximity to the main robot. A boustrophedon decomposition algorithm is developed that incorporates the motion, sensing and communication constraints imposed by the autonomous fleet. Solving the coverage problem leads to a localization/communication problem. A critical problem for a group of autonomous vehicles is ensuring that the collection operates within a common reference frame. Here we consider the problem of localizing a heterogenous collection of aquatic surface vessels within a global reference frame. We assume that one vessel -- the mother robot -- has access to global position data of high accuracy, while the other vessels -- the child robots -- utilize limited onboard sensors and sophisticated sensors on board the mother robot to localize themselves. This thesis provides details of the design of the elements of the heterogeneous fleet including the sensors and sensing algorithms along with the communication strategy used to localize all elements of the fleet within a global reference frame. Details of the robot platforms to be used in implementing a solution are also described. Simulation of the approach is used to demonstrate the effectiveness of the algorithm, and the algorithm and its components are evaluated using a fleet of ASVs