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

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

An Iterative Approach for Collision Feee Routing and Scheduling in Multirobot Stations

This work is inspired by the problem of planning sequences of operations, as welding, in car manufacturing stations where multiple industrial robots cooperate. The goal is to minimize the station cycle time, \emph{i.e.} the time it takes for the last robot to finish its cycle. This is done by dispatching the tasks among the robots, and by routing and scheduling the robots in a collision-free way, such that they perform all predefined tasks. We propose an iterative and decoupled approach in order to cope with the high complexity of the problem. First, collisions among robots are neglected, leading to a min-max Multiple Generalized Traveling Salesman Problem (MGTSP). Then, when the sets of robot loads have been obtained and fixed, we sequence and schedule their tasks, with the aim to avoid conflicts. The first problem (min-max MGTSP) is solved by an exact branch and bound method, where different lower bounds are presented by combining the solutions of a min-max set partitioning problem and of a Generalized Traveling Salesman Problem (GTSP). The second problem is approached by assuming that robots move synchronously: a novel transformation of this synchronous problem into a GTSP is presented. Eventually, in order to provide complete robot solutions, we include path planning functionalities, allowing the robots to avoid collisions with the static environment and among themselves. These steps are iterated until a satisfying solution is obtained. Experimental results are shown for both problems and for their combination. We even show the results of the iterative method, applied to an industrial test case adapted from a stud welding station in a car manufacturing line

DECENTRALIZED TRAFFIC MANAGEMENT OF MULTI-AGENT SYSTEMS

Autonomous agents and multi-agent systems (MASs) represent one of the most exciting and challenging areas of robotics research during the last two decades. In recent years, they have been proposed for several applications, such as telecommunications, air traffic mangement, planetary exploration, surveillance etc.. MASs offer many potential advantages with respect to single-agent systems such as speedup in task execution, robustness with respect to failure of one or more agents, scalability and modularity. On the other hand, MASs introduce challenging issues such as the handling of distributed information data, the coordination among agents, the choice of the control framework and of communication protocols. This thesis investigates some problems that arise in the management of MASs. More specifically it investigates problems of designing decentralized control schemes to manage collections of vehicles cooperating to reach common goals, while simultaneously avoiding collisions. An existing decentralized policy for collisions avoidance, already proved safe for a system with three agents, has been extended up to five agents. A new decentralized policy, the Generalized Roundabout Policy, has been designed and its properties analyzed. Specifically safety and liveness properties have been studied. The first one has been proved formally, while the second has been addressed by means of probabilistic approaches. Moreover, it is addressed the problem of optimization of autonomous robotic exploration. The problem is clearly of great relevance to many tasks, such as e.g. surveillance or exploration. However, it is in general a difficult problem, as several quantities have to be traded off, such as the expected gain in map information, the time and energy it takes to gain this information, the possible loss of pose information along the way, and so on. Finally, software and hardware simulation tools have been developed for the analysis and the verification of the decentralized control policies. Such instruments are particularly useful for the verification of multi-agent systems which could be overwhelmingly complex to be addressed purely by a theoretical approach

Robot planning based on boolean specifications using petri net models

In this paper, we propose an automated method for planning a team of mobile robots such that a Boolean-based mission is accomplished. The task consists of logical requirements over some regions of interest for the agents'' trajectories and for their final states. In other words, we allow combinatorial specifications defining desired final states whose attainment includes visits to, avoidance of, and ending in certain regions. The path planning approach should select such final states that optimize a certain global cost function. In particular, we consider minimum expected traveling distance of the team and reduce congestions. A Petri net (PN) with outputs models the movement capabilities of the team and the regions of interest. The imposed specification is translated to a set of linear restrictions for some binary variables, the robot movement capabilities are formulated as linear constraints on PN markings, and the evaluations of the binary variables are linked with PN markings via linear inequalities. This allows us to solve an integer linear programming problem whose solution yields robotic trajectories satisfying the task

Speed control of wheeled mobile robot by nature-inspired social spider algorithm-based PID controller

: Mobile robot is an automatic vehicle with wheels that can be moved automatically from one place to another. A motor is built on its wheels for mobility purposes, which is controlled using a controller. DC motor speed is controlled by the proportional integral derivative (PID) controller. Kinematic modeling is used in our work to understand the mechanical behavior of robots for designing the appropriate mobile robots. Right and left wheel velocity and direction are calculated by using the kinematic modeling, and the kinematic modeling is given to the PID controller to gain the output. Motor speed is controlled by the PID low-level controller for the robot mobility; the speed controlling is done using the constant values Kd, Kp, and Ki which depend on the past, future, and present errors. For better control performance, the integral gain, differential gain, and proportional gain are adjusted by the PID controller. Robot speed may vary by changing the direction of the vehicle, so to avoid this the Social Spider Optimization (SSO) algorithm is used in PID controllers. PID controller parameter tuning is hard by using separate algorithms, so the parameters are tuned by the SSO algorithm which is a novel nature-inspired algorithm. The main goal of this paper is to demonstrate the effectiveness of the proposed approach in achieving precise speed control of the robot, particularly in the presence of disturbances and uncertainties

Unsynchronized Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics

Robots are increasingly found to operate together in the same environment where they must coordinate their motion. Such an operation is simple if the motion is quasi-static. Under second-order dynamics, the problem becomes challenging even for a known environment. Planning must guarantee safety by ensuring collision-free paths for the considered period by not bringing the robot to states where collisions are inevitable. This can be addressed with communication among robots, but it becomes complicated when the replanning cycles of different robots are not synchronized and robots make planning decisions at different times. This thesis shows how to guarantee safety for communicating second-order vehicles, whose replanning rates do not coincide, through a distributed motion planning framework without a global time reference. The method is evaluated through simulation where each robot has its own address space, and communicates with message passing. A proof of safety is presented, and simulation results are used to investigate performance of the framework

3D multi-robot patrolling with a two-level coordination strategy

Teams of UGVs patrolling harsh and complex 3D environments can experience interference and spatial conflicts with one another. Neglecting the occurrence of these events crucially hinders both soundness and reliability of a patrolling process. This work presents a distributed multi-robot patrolling technique, which uses a two-level coordination strategy to minimize and explicitly manage the occurrence of conflicts and interference. The first level guides the agents to single out exclusive target nodes on a topological map. This target selection relies on a shared idleness representation and a coordination mechanism preventing topological conflicts. The second level hosts coordination strategies based on a metric representation of space and is supported by a 3D SLAM system. Here, each robot path planner negotiates spatial conflicts by applying a multi-robot traversability function. Continuous interactions between these two levels ensure coordination and conflicts resolution. Both simulations and real-world experiments are presented to validate the performances of the proposed patrolling strategy in 3D environments. Results show this is a promising solution for managing spatial conflicts and preventing deadlocks