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
翻译:连接和自动化飞行器(CAVs)被视为一种特殊类型的机器人,有可能大大改善交通安全和效率。与实验室中通过雇用少量机器人而显示的许多群装机器人研究相反,CAV研究的目的是实现不易复制的机器人群流的合作驱动。然而,如何使这种机器人群流的最佳通过顺序,即使是无信号的交叉路口,也是一种硬问题(具体来说,计算基于逻辑的算法需要数天才能找到20CAV情景的最佳解决办法)。在这里,我们引入了一种新的合作驾驶算法(AlphaOrder),将离线深度学习和在线树寻找实时近乎最佳的过路顺序结合起来。Alphoorder从已解的情景中构建了一个指针网络模型,为新的情景即时生成近最佳过路令。此外,我们的方法提供了一种一般方法,用以管理在冲突地区多部自动导航飞行器(AGVs)和无人驾驶飞行器(UAVs)之间在超速资源共享。