Priority-based intersection management with kinodynamic constraints

We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot motion planning. Assuming the priorities between robots are assigned in advance and the existence of a collision-free trajectory respecting those priorities, we propose a provably safe trajectory planner satisfying kinodynamic constraints. The algorithm is shown to run in real time and to return safe (collision-free) trajectories. Simulation results on synthetic data illustrate the benefits of the approach.Comment: to be presented at ECC2014; 6 page

Optimal Control of Fully Routed Air Traffic in the Presence of Uncertainty and Kinodynamic Constraints

A method is presented to extend current graph-based Air Traffic Management optimization frameworks. In general, Air Traffic Management is the process of guiding a finite set of aircraft, each along its pre-determined path within some local airspace, subject to various physical, policy, procedural and operational restrictions. This research addresses several limitations of current graph-based Air Traffic Management optimization methods by incorporating techniques to account for stochastic effects, physical inertia and variable arrival sequencing. In addition, this research provides insight into the performance of multiple methods for approximating non-differentiable air traffic constraints, and incorporates these methods into a generalized weighted-sum representation of the multi-objective Air Traffic Management optimization problem that minimizes the total time of flight, deviation from scheduled arrival time and fuel consumption of all aircraft. The methods developed and tested throughout this dissertation demonstrate the ability of graph-based optimization techniques to model realistic air traffic restrictions and generate viable control strategies

Priority-based coordination of robots

20 pagesThis paper addresses the problem of coordinating multiple robots travelling through an intersection along fixed paths with positive velocities and kinodynamic constraints. The approach relies on a novel tool: a priority graph that encodes the relative order of the robots at the intersection. The overall planning approach can be decomposed into two key components as follows. The entry of robots into the intersection is managed by an intersection controller that assigns priorities. Within the intersection area, robots are controlled by a control law that preserves assigned priorities, avoids collisions, and is robust to unexpected decelerations of some robots occurring randomly

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

On Provably Safe and Live Multirobot Coordination With Online Goal Posting

A standing challenge in multirobot systems is to realize safe and efficient motion planning and coordination methods that are capable of accounting for uncertainties and contingencies. The challenge is rendered harder by the fact that robots may be heterogeneous and that their plans may be posted asynchronously. Most existing approaches require constraints on the infrastructure or unrealistic assumptions on robot models. In this article, we propose a centralized, loosely-coupled supervisory controller that overcomes these limitations. The approach responds to newly posed constraints and uncertainties during trajectory execution, ensuring at all times that planned robot trajectories remain kinodynamically feasible, that the fleet is in a safe state, and that there are no deadlocks or livelocks. This is achieved without the need for hand-coded rules, fixed robot priorities, or environment modification. We formally state all relevant properties of robot behavior in the most general terms possible, without assuming particular robot models or environments, and provide both formal and empirical proof that the proposed fleet control algorithms guarantee safety and liveness

Model-based robocentric planning and navigation for dynamic environments

This work addresses a new technique of motion planning and navigation for differential-drive robots in dynamic environments. Static and dynamic objects are represented directly on the control space of the robot, where decisions on the best motion are made. A new model representing the dynamism and the prediction of the future behavior of the environment is defined, the dynamic object velocity space (DOVS). A formal definition of this model is provided, establishing the properties for its characterization. An analysis of its complexity, compared with other methods, is performed. The model contains information about the future behavior of obstacles, mapped on the robot control space. It allows planning of near-time-optimal safe motions within the visibility space horizon, not only for the current sampling period. Navigation strategies are developed based on the identification of situations in the model. The planned strategy is applied and updated for each sampling time, adapting to changes occurring in the scenario. The technique is evaluated in randomly generated simulated scenarios, based on metrics defined using safety and time-to-goal criteria. An evaluation in real-world experiments is also presented

Least Restrictive and Minimally Deviating Supervisor for Safe Semi-Autonomous Driving at an Intersection: An MIQP Approach

International audienceAlthough significant progress has been made in the last few years towards cooperative and autonomous driving, the transition from human-driven to fully automated vehicles is expected to happen slowly. The question of semi-autonomous driving, where Advanced Driver Assistance Systems assist human drivers in their decisions, will therefore become increasingly important. In this paper, we consider the problem of safe intersection crossing for semi-autonomous vehicles with communication capacities. We design an intersection supervisor based on a mixed-integer quadratic programming approach which monitors the control inputs of each vehicle, and overrides those controls when necessary to ensure that all vehicles can navigate safely. Moreover, the solution control deviates minimally from the vehicles target inputs: overriding only occurs when it is strictly necessary, in which case the control is chosen as close as possible to the driver's intent. We theoretically prove that the supervisor needs only consider a finite future time horizon to ensure safety and deadlock avoidance over an infinite time horizon, and we demonstrate through simulation that this algorithm can work in real time. Additionally, unlike previous work, our formulation is suitable for complex intersection geometries with a high number of vehicles