4,811 research outputs found
Robust multi-agent collision avoidance through scheduling
We propose a class of computationally efficient algorithms for conflict resolution in the presence of modeling and measurement uncertainties. Specifically, we address a scenario where a number of agents, whose dynamics are possibly nonlinear, must cross an intersection avoiding collisions. We obtain an exact solution and an approximate one with quantified error bound whose complexity scales polynomially with the number of agents.National Science Foundation (U.S.) (Award CNS 0930081)Roberto Rocca Foundatio
Towards Optimally Decentralized Multi-Robot Collision Avoidance via Deep Reinforcement Learning
Developing a safe and efficient collision avoidance policy for multiple
robots is challenging in the decentralized scenarios where each robot generate
its paths without observing other robots' states and intents. While other
distributed multi-robot collision avoidance systems exist, they often require
extracting agent-level features to plan a local collision-free action, which
can be computationally prohibitive and not robust. More importantly, in
practice the performance of these methods are much lower than their centralized
counterparts.
We present a decentralized sensor-level collision avoidance policy for
multi-robot systems, which directly maps raw sensor measurements to an agent's
steering commands in terms of movement velocity. As a first step toward
reducing the performance gap between decentralized and centralized methods, we
present a multi-scenario multi-stage training framework to find an optimal
policy which is trained over a large number of robots on rich, complex
environments simultaneously using a policy gradient based reinforcement
learning algorithm. We validate the learned sensor-level collision avoidance
policy in a variety of simulated scenarios with thorough performance
evaluations and show that the final learned policy is able to find time
efficient, collision-free paths for a large-scale robot system. We also
demonstrate that the learned policy can be well generalized to new scenarios
that do not appear in the entire training period, including navigating a
heterogeneous group of robots and a large-scale scenario with 100 robots.
Videos are available at https://sites.google.com/view/drlmac
A Decentralized Control Framework for Energy-Optimal Goal Assignment and Trajectory Generation
This paper proposes a decentralized approach for solving the problem of
moving a swarm of agents into a desired formation. We propose a decentralized
assignment algorithm which prescribes goals to each agent using only local
information. The assignment results are then used to generate energy-optimal
trajectories for each agent which have guaranteed collision avoidance through
safety constraints. We present the conditions for optimality and discuss the
robustness of the solution. The efficacy of the proposed approach is validated
through a numerical case study to characterize the framework's performance on a
set of dynamic goals.Comment: 6 pages, 3 figures, to appear at the 2019 Conference on Decision and
Control, Nice, F
Semi-autonomous Intersection Collision Avoidance through Job-shop Scheduling
In this paper, we design a supervisor to prevent vehicle collisions at
intersections. An intersection is modeled as an area containing multiple
conflict points where vehicle paths cross in the future. At every time step,
the supervisor determines whether there will be more than one vehicle in the
vicinity of a conflict point at the same time. If there is, then an impending
collision is detected, and the supervisor overrides the drivers to avoid
collision. A major challenge in the design of a supervisor as opposed to an
autonomous vehicle controller is to verify whether future collisions will occur
based on the current drivers choices. This verification problem is particularly
hard due to the large number of vehicles often involved in intersection
collision, to the multitude of conflict points, and to the vehicles dynamics.
In order to solve the verification problem, we translate the problem to a
job-shop scheduling problem that yields equivalent answers. The job-shop
scheduling problem can, in turn, be transformed into a mixed-integer linear
program when the vehicle dynamics are first-order dynamics, and can thus be
solved by using a commercial solver.Comment: Submitted to Hybrid Systems: Computation and Control (HSCC) 201
Distributed Consensus to Enable Merging and Spacing of UAS in an Urban Environment
This paper presents a novel approach to enable multiple Unmanned Aerial Systems approaching a common intersection to independently schedule their arrival time while maintaining a safe separation. Aircraft merging at a common intersection are grouped into a network and each aircraft broadcasts its arrival time interval to the network. A distributed consensus algorithm elects a leader among the aircraft approaching the intersection and helps synchronize the information received by each aircraft. The consensus algorithm ensures that each aircraft computes a schedule with the same input information. The elected leader also dictates when a schedule must be computed, which may be triggered when a new aircraft joins the network. Preliminary results illustrating the collaborative behavior of the vehicles are presented
- …