Coordinating CAV Swarms at Intersections with a Deep Learning Model
- URL: http://arxiv.org/abs/2211.05297v1
- Date: Thu, 10 Nov 2022 02:14:36 GMT
- Title: Coordinating CAV Swarms at Intersections with a Deep Learning Model
- Authors: Jiawei Zhang, Shen Li, Li Li
- Abstract summary: Connected and automated vehicles (CAVs) are viewed as a special kind of robots that have the potential to significantly improve the safety and efficiency of traffic.
Here, we introduce a novel cooperative driving algorithm (AlphaOrder) that combines offline deep learning and online tree searching to find a near-optimal passing order in real-time.
- Score: 24.188603833058146
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Connected and automated vehicles (CAVs) are viewed as a special kind of
robots that have the potential to significantly improve the safety and
efficiency of traffic. In contrast to many swarm robotics studies that are
demonstrated in labs by employing a small number of robots, CAV studies aims to
achieve cooperative driving of unceasing robot swarm flows. However, how to get
the optimal passing order of such robot swarm flows even for a signal-free
intersection is an NP-hard problem (specifically, enumerating based algorithm
takes days to find the optimal solution to a 20-CAV scenario). Here, we
introduce a novel cooperative driving algorithm (AlphaOrder) that combines
offline deep learning and online tree searching to find a near-optimal passing
order in real-time. AlphaOrder builds a pointer network model from solved
scenarios and generates near-optimal passing orders instantaneously for new
scenarios. Furthermore, our approach provides a general approach to managing
preemptive resource sharing between swarm robotics (e.g., scheduling multiple
automated guided vehicles (AGVs) and unmanned aerial vehicles (UAVs) at
conflicting areas
Related papers
- Multi-agent Path Finding for Cooperative Autonomous Driving [8.8305853192334]
We devise an optimal and complete algorithm, Order-based Search with Kinematics Arrival Time Scheduling (OBS-KATS), which significantly outperforms existing algorithms.
Our work is directly applicable to many similarly scaled traffic and multi-robot scenarios with directed lanes.
arXiv Detail & Related papers (2024-02-01T04:39:15Z) - LPAC: Learnable Perception-Action-Communication Loops with Applications
to Coverage Control [80.86089324742024]
We propose a learnable Perception-Action-Communication (LPAC) architecture for the problem.
CNN processes localized perception; a graph neural network (GNN) facilitates robot communications.
Evaluations show that the LPAC models outperform standard decentralized and centralized coverage control algorithms.
arXiv Detail & Related papers (2024-01-10T00:08:00Z) - Mission-driven Exploration for Accelerated Deep Reinforcement Learning
with Temporal Logic Task Specifications [11.812602599752294]
We consider robots with unknown dynamics operating in environments with unknown structure.
Our goal is to synthesize a control policy that maximizes the probability of satisfying an automaton-encoded task.
We propose a novel DRL algorithm, which has the capability to learn control policies at a notably faster rate compared to similar methods.
arXiv Detail & Related papers (2023-11-28T18:59:58Z) - Decentralized Vehicle Coordination: The Berkeley DeepDrive Drone Dataset [103.35624417260541]
Decentralized vehicle coordination is useful in understructured road environments.
We collect the Berkeley DeepDrive Drone dataset to study implicit "social etiquette" observed by nearby drivers.
The dataset is of primary interest for studying decentralized multiagent planning employed by human drivers and for computer vision in remote sensing settings.
arXiv Detail & Related papers (2022-09-19T05:06:57Z) - Intelligent Trajectory Design for RIS-NOMA aided Multi-robot
Communications [59.34642007625687]
The goal is to maximize the sum-rate of whole trajectories for multi-robot system by jointly optimizing trajectories and NOMA decoding orders of robots.
An integrated machine learning (ML) scheme is proposed, which combines long short-term memory (LSTM)-autoregressive integrated moving average (ARIMA) model and dueling double deep Q-network (D$3$QN) algorithm.
arXiv Detail & Related papers (2022-05-03T17:14:47Z) - Decentralized Global Connectivity Maintenance for Multi-Robot
Navigation: A Reinforcement Learning Approach [12.649986200029717]
This work investigates how to navigate a multi-robot team in unknown environments while maintaining connectivity.
We propose a reinforcement learning approach to develop a decentralized policy, which is shared among multiple robots.
We validate the effectiveness of the proposed approach by comparing different combinations of connectivity constraints and behavior cloning.
arXiv Detail & Related papers (2021-09-17T13:20:19Z) - SABER: Data-Driven Motion Planner for Autonomously Navigating
Heterogeneous Robots [112.2491765424719]
We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal.
We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints.
recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution.
A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
arXiv Detail & Related papers (2021-08-03T02:56:21Z) - Robotic Brain Storm Optimization: A Multi-target Collaborative Searching
Paradigm for Swarm Robotics [24.38312890501329]
This paper proposes a BSO-based collaborative searching framework for swarm robotics called Robotic BSO.
The proposed method can simulate the BSO's guided search characteristics and has an excellent prospect for multi-target searching problems for swarm robotics.
arXiv Detail & Related papers (2021-05-27T13:05:48Z) - Jamming-Resilient Path Planning for Multiple UAVs via Deep Reinforcement
Learning [1.2330326247154968]
Unmanned aerial vehicles (UAVs) are expected to be an integral part of wireless networks.
In this paper, we aim to find collision-free paths for multiple cellular-connected UAVs.
We propose an offline temporal difference (TD) learning algorithm with online signal-to-interference-plus-noise ratio mapping to solve the problem.
arXiv Detail & Related papers (2021-04-09T16:52:33Z) - Learning Autoencoders with Relational Regularization [89.53065887608088]
A new framework is proposed for learning autoencoders of data distributions.
We minimize the discrepancy between the model and target distributions, with a emphrelational regularization
We implement the framework with two scalable algorithms, making it applicable for both probabilistic and deterministic autoencoders.
arXiv Detail & Related papers (2020-02-07T17:27:30Z) - Reinforcement Learning Based Vehicle-cell Association Algorithm for
Highly Mobile Millimeter Wave Communication [53.47785498477648]
This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks.
We first formulate the user state (VU) problem as a discrete non-vehicle association optimization problem.
The proposed solution achieves up to 15% gains in terms sum of user complexity and 20% reduction in VUE compared to several baseline designs.
arXiv Detail & Related papers (2020-01-22T08:51:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.