Decentralized Multi-Robot Social Navigation in Constrained Environments via Game-Theoretic Control Barrier Functions

We present an approach to ensure safe and deadlock-free navigation for decentralized multi-robot systems operating in constrained environments, including doorways and intersections. Although many solutions have been proposed to ensure safety, preventing deadlocks in a decentralized fashion with global consensus remains an open problem. We first formalize the objective as a non-cooperative, non-communicative, partially observable multi-robot navigation problem in constrained spaces with multiple conflicting agents, which we term as social mini-games. Our approach to ensuring safety and liveness rests on two novel insights: (i) deadlock resolution is equivalent to deriving a mixed-Nash equilibrium solution to a social mini-game and (ii) this mixed-Nash strategy can be interpreted as an analogue to control barrier functions (CBFs), that can then be integrated with standard CBFs, inheriting their safety guarantees. Together, the standard CBF along with the mixed-Nash CBF analogue preserves both safety and liveness. We evaluate our proposed game-theoretic navigation algorithm in simulation as well on physical robots using F1/10 robots, a Clearpath Jackal, as well as a Boston Dynamics Spot in a doorway, corridor intersection, roundabout, and hallway scenario. We show that (i) our approach results in safer and more efficient navigation compared to local planners based on geometrical constraints, optimization, multi-agent reinforcement learning, and auctions, (ii) our deadlock resolution strategy is the smoothest in terms of smallest average change in velocity and path deviation, and most efficient in terms of makespan (iii) our approach yields a flow rate of 2.8 - 3.3 (ms)^{-1 which is comparable to flow rate in human navigation at 4 (ms)^{-1}.Comment: arXiv admin note: text overlap with arXiv:2306.0881

Autonomous navigation of a wheeled mobile robot in farm settings

This research is mainly about autonomously navigation of an agricultural wheeled mobile robot in an unstructured outdoor setting. This project has four distinct phases defined as: (i) Navigation and control of a wheeled mobile robot for a point-to-point motion. (ii) Navigation and control of a wheeled mobile robot in following a given path (path following problem). (iii) Navigation and control of a mobile robot, keeping a constant proximity distance with the given paths or plant rows (proximity-following). (iv) Navigation of the mobile robot in rut following in farm fields. A rut is a long deep track formed by the repeated passage of wheeled vehicles in soft terrains such as mud, sand, and snow. To develop reliable navigation approaches to fulfill each part of this project, three main steps are accomplished: literature review, modeling and computer simulation of wheeled mobile robots, and actual experimental tests in outdoor settings. First, point-to-point motion planning of a mobile robot is studied; a fuzzy-logic based (FLB) approach is proposed for real-time autonomous path planning of the robot in unstructured environment. Simulation and experimental evaluations shows that FLB approach is able to cope with different dynamic and unforeseen situations by tuning a safety margin. Comparison of FLB results with vector field histogram (VFH) and preference-based fuzzy (PBF) approaches, reveals that FLB approach produces shorter and smoother paths toward the goal in almost all of the test cases examined. Then, a novel human-inspired method (HIM) is introduced. HIM is inspired by human behavior in navigation from one point to a specified goal point. A human-like reasoning ability about the situations to reach a predefined goal point while avoiding any static, moving and unforeseen obstacles are given to the robot by HIM. Comparison of HIM results with FLB suggests that HIM is more efficient and effective than FLB. Afterward, navigation strategies are built up for path following, rut following, and proximity-following control of a wheeled mobile robot in outdoor (farm) settings and off-road terrains. The proposed system is composed of different modules which are: sensor data analysis, obstacle detection, obstacle avoidance, goal seeking, and path tracking. The capabilities of the proposed navigation strategies are evaluated in variety of field experiments; the results show that the proposed approach is able to detect and follow rows of bushes robustly. This action is used for spraying plant rows in farm field. Finally, obstacle detection and obstacle avoidance modules are developed in navigation system. These modules enables the robot to detect holes or ground depressions (negative obstacles), that are inherent parts of farm settings, and also over ground level obstacles (positive obstacles) in real-time at a safe distance from the robot. Experimental tests are carried out on two mobile robots (PowerBot and Grizzly) in outdoor and real farm fields. Grizzly utilizes a 3D-laser range-finder to detect objects and perceive the environment, and a RTK-DGPS unit for localization. PowerBot uses sonar sensors and a laser range-finder for obstacle detection. The experiments demonstrate the capability of the proposed technique in successfully detecting and avoiding different types of obstacles both positive and negative in variety of scenarios

Multiple Waypoint Navigation in Unknown Indoor Environments

Indoor motion planning focuses on solving the problem of navigating an agent through a cluttered environment. To date, quite a lot of work has been done in this field, but these methods often fail to find the optimal balance between computationally inexpensive online path planning, and optimality of the path. Along with this, these works often prove optimality for single-start single-goal worlds. To address these challenges, we present a multiple waypoint path planner and controller stack for navigation in unknown indoor environments where waypoints include the goal along with the intermediary points that the robot must traverse before reaching the goal. Our approach makes use of a global planner (to find the next best waypoint at any instant), a local planner (to plan the path to a specific waypoint), and an adaptive Model Predictive Control strategy (for robust system control and faster maneuvers). We evaluate our algorithm on a set of randomly generated obstacle maps, intermediate waypoints, and start-goal pairs, with results indicating a significant reduction in computational costs, with high accuracies and robust control.Comment: Accepted at ICCR 202

SAFETY-GUARANTEED TASK PLANNING FOR BIPEDAL NAVIGATION IN PARTIALLY OBSERVABLE ENVIRONMENTS

Bipedal robots are becoming more capable as basic hardware and control challenges are being overcome, however reasoning about safety at the task and motion planning levels has been largely underexplored. I would like to make key steps towards guaranteeing safe locomotion in cluttered environments in the presence of humans or other dynamic obstacles by designing a hierarchical task planning framework that incorporates safety guarantees at each level. This layered planning framework is composed of a coarse high-level symbolic navigation planner and a lower-level local action planner. A belief abstraction at the global navigation planning level enables belief estimation of non-visible dynamic obstacle states and guarantees navigation safety with collision avoidance. Both planning layers employ linear temporal logic for a reactive game synthesis between the robot and its environment while incorporating lower level safe locomotion keyframe policies into formal task specification design. The high-level symbolic navigation planner has been extended to leverage the capabilities of a heterogeneous multi-agent team to resolve environment assumption violations that appear at runtime. Modifications in the navigation planner in conjunction with a coordination layer allow each agent to guarantee immediate safety and eventual task completion in the presence of an assumption violation if another agent exists that can resolve said violation, e.g. a door is closed that another dexterous agent can open. The planning framework leverages the expressive nature and formal guarantees of LTL to generate provably correct controllers for complex robotic systems. The use of belief space planning for dynamic obstacle belief tracking and heterogeneous robot capabilities to assist one another when environment assumptions are violated allows the planning framework to reduce the conservativeness traditionally associated with using formal methods for robot planning.M.S

Multi-robot coordination and safe learning using barrier certificates

The objective of this research is to develop a formal safety framework for collision-free and connectivity sustained motion in multi-robot coordination and learning based control. This safety framework is designed with barrier certificates, which provably guarantee the safety of dynamical systems based on the set invariance principle. The barrier certificates are enforced on the system using an online optimization-based controller such that minimal changes to the existing control strategies are required to guarantee safety. The proposed safety barrier certificates are validated on real multi-robot systems consisting of multiple Khepera robots, Magellan Pro robot, GRITS-Bots, and Crazyflie quadrotors.Ph.D

Integrated robot planning, path following, and obstacle avoidance in two and three dimensions: Wheeled robots, underwater vehicles, and multicopters

We propose an innovative, integrated solution to path planning, path following, and obstacle avoidance that is suitable both for 2D and 3D navigation. The proposed method takes as input a generic curve connecting a start and a goal position, and is able to find a corresponding path from start to goal in a maze-like environment even in the absence of global information, it guarantees convergence to the path with kinematic control, and finally avoids locally sensed obstacles without becoming trapped in deadlocks. This is achieved by computing a closed-form expression in which the control variables are a continuous function of the input curve, the robot\u2019s state, and the distance of all the locally sensed obstacles. Specifically, we introduce a novel formalism for describing the path in two and three dimensions, as well as a computationally efficient method for path deformation (based only on local sensor readings) that is able to find a path to the goal even when such path cannot be produced through continuous deformations of the original. The article provides formal proofs of all the properties above, as well as simulated results in a simulated environment with a wheeled robot, an underwater vehicle, and a multicopter

Game theoretic control of multi-agent systems: from centralised to distributed control

Differential game theory provides a framework to study the dynamic strategic interactions between multiple decisors, or players, each with an individual criterion to optimise. Noting the analogy between the concepts of "players'' and "agents'', it seems apparent that this framework is well-suited for control of multi-agent systems (MAS). Most of the existing results in the field of differential games assume that players have access to the full state of the system. This assumption, while holding reasonable in certain scenarios, does not apply in contexts where decisions are to be made by each individual agent based only on available local information. This poses a significant challenge in terms of the control design: distributed control laws, which take into account what information is available, are required. In the present work concepts borrowed from differential game theory and graph theory are exploited to formulate systematic frameworks for control of MAS, in a quest to shift the paradigm from centralised to distributed control. We introduce some preliminaries on differential game theory and graph theory, the latter for modeling communication constraints between the agents. Motivated by the difficulties associated with obtaining exact Nash equilibrium solutions for nonzero-sum differential games, we consider three approximate Nash equilibrium concepts and provide different characterisations of these in terms a class of static optimisation problems often encountered in control theory. Considering the multi-agent collision avoidance problem, we present a game theoretic approach, based on a (centralised) hybrid controller implementation of the control strategies, capable of ensuring collision-free trajectories and global convergence of the error system. We make a first step towards distributed control by introducing differential games with partial information, a framework for distributed control of MAS subject to local communication constraints, in which we assume that the agents share their control strategies with their neighbours. This assumption which, in the case of non-acyclic communication graphs, translates into the requirement of shared reasoning between groups of agents, is then relaxed through the introduction of a framework based on the concept of distributed differential games, i.e. a collection of multiple (fictitious) local differential games played by each individual agent in the MAS. Finally, we revisit the multi-agent collision avoidance problem in a distributed setting: considering time-varying communication graph topologies, which enable to model proximity-based communication constraints, we design differential games characterised by a Nash equilibrium solution which yields collision-free trajectories guaranteeing that all the agents reach their goal, provided no deadlocks occur. The efficacy of the game theoretic frameworks introduced in this thesis is demonstrated on several case studies of practical importance, related to robotic coordination and control of microgrids.Open Acces

Swarm-based planning and control of robotic functions

University of Technology, Sydney. Faculty of Engineering and Information Technology.Basic issues with a robotic task that requires multiple mobile robots moving in formations are to assemble at an initial point in the work space for establishing a desired formation, to maintain the formation while moving, to avoid obstacles by occasionally splitting/deforming and then re-establishing the formation, and to change the shape of the formation upon requests to accommodate new tasks or safety conditions. In the literature, those issues have been often addressed separately. This research proposes a generic framework that allows for tackling these issues in an integrated manner in the optimal formation planning and control context. Within this proposed framework, a leader robot will be assigned and the path for the leader is obtained by utilising a modified A* search together with a vector approach, and then smoothed out to reduce the number of turns and to satisfy the dynamic and kinematic constraints of mobile robots. Next, a reference trajectory is generated for the leader robot. Based on the formation configuration and the workspace environment, desired trajectories for follower robots in the group are obtained. At the lowest level, each robot tracks its own trajectory using a unified tracking controller. The problem of formation initialisation, in which a group of robots, initially scattering in the workspace, is deployed to get into a desired formation shape, is dealt with by using a Discrete Particle Swarm Optimisation (DPSO) technique incorporated with a behaviour-based strategy. The proposed technique aims to optimally assign desired positions for each robot in the formation by minimisation of a cost function associated with the predefined formation shape. Once each robot has been assigned with a desired position, a search scheme is implemented to obtain a collision free trajectory for each robot to establish the formation. Towards optimal maintenance of the motion patterns, the path that has been obtained for robots in the group by using the modified A* search, is further adjusted. For this, the Particle Swarm Optimisation (PSO) technique is proposed to minimise a cost function involving global motion of the formation, with the main objective of preventing unnecessary changes in the follower robot trajectories when avoiding obstacles. A PSO formation motion planning algorithm is proposed to search for motion commands for each robot. This algorithm can be used to initialise the formation or to navigate the formation to its target. The proposed PSO motion planning method is able to maintain the formation subject to the kinematic and velocity constraints. Analytical work of the thesis is validated by extensive simulation of multiple differential drive wheeled mobile robots based on their kinematic models. The techniques proposed in this thesis are also experimentally tested, in part, on two Amigo mobile robots

Simulation in Automated Guided Vehicle System Design

The intense global competition that manufacturing companies face today results in an increase of product variety and shorter product life cycles. One response to this threat is agile manufacturing concepts. This requires materials handling systems that are agile and capable of reconfiguration. As competition in the world marketplace becomes increasingly customer-driven, manufacturing environments must be highly reconfigurable and responsive to accommodate product and process changes, with rigid, static automation systems giving way to more flexible types. Automated Guided Vehicle Systems (AGVS) have such capabilities and AGV functionality has been developed to improve flexibility and diminish the traditional disadvantages of AGV-systems. The AGV-system design is however a multi-faceted problem with a large number of design factors of which many are correlating and interdependent. Available methods and techniques exhibit problems in supporting the whole design process. A research review of the work reported on AGVS development in combination with simulation revealed that of 39 papers only four were industrially related. Most work was on the conceptual design phase, but little has been reported on the detailed simulation of AGVS. Semi-autonomous vehicles (SA V) are an innovative concept to overcome the problems of inflexible -systems and to improve materials handling functionality. The SA V concept introduces a higher degree of autonomy in industrial AGV -systems with the man-in-the-Ioop. The introduction of autonomy in industrial applications is approached by explicitly controlling the level of autonomy at different occasions. The SA V s are easy to program and easily reconfigurable regarding navigation systems and material handling equipment. Novel approaches to materials handling like the SA V -concept place new requirements on the AGVS development and the use of simulation as a part of the process. Traditional AGV -system simulation approaches do not fully meet these requirements and the improved functionality of AGVs is not used to its full power. There is a considerflble potential in shortening the AGV -system design-cycle, and thus the manufacturing system design-cycle, and still achieve more accurate solutions well suited for MRS tasks. Recent developments in simulation tools for manufacturing have improved production engineering development and the tools are being adopted more widely in industry. For the development of AGV -systems this has not fully been exploited. Previous research has focused on the conceptual part of the design process and many simulation approaches to AGV -system design lack in validity. In this thesis a methodology is proposed for the structured development of AGV -systems using simulation. Elements of this methodology address the development of novel functionality. The objective of the first research case of this research study was to identify factors for industrial AGV -system simulation. The second research case focuses on simulation in the design of Semi-autonomous vehicles, and the third case evaluates a simulation based design framework. This research study has advanced development by offering a framework for developing testing and evaluating AGV -systems, based on concurrent development using a virtual environment. The ability to exploit unique or novel features of AGVs based on a virtual environment improves the potential of AGV-systems considerably.University of Skovde. European Commission for funding the INCO/COPERNICUS Projec