arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.05082cs.ROcs.MAcs.SYeess.SY
收藏

面向机器人交通无信号交叉口管理的强化学习辅助序贯优化

Reinforcement Learning Aided Sequential Optimization for Unsignalized Intersection Management of Robot Traffic

Robert Bosch Centre for Cyber Physical Systems, Indian Institute of Science at Bengaluru(班加罗尔印度科学学院罗伯特·博世网络物理系统中心);Department of Electrical Engineering, Indian Institute of Science at Bengaluru(班加罗尔印度科学学院电气工程系)

Nishchal Hoysal G., Pavankumar Tallapragada

AI总结:

本文针对机器人无信号交叉口管理问题,提出强化学习确定通行顺序与序贯轨迹优化相结合的框架,在保证安全的同时显著优于现有启发式方法并实现计算时间随机器人数量线性增长。

摘要:

我们考虑最优无信号交叉口管理问题,其中我们寻求为一组随机且持续到达的机器人获得安全且最优的轨迹。该问题涉及反复求解一个混合整数规划(以机器人加速度轨迹为决策变量),其参数各不相同,使用朴素优化算法的计算时间随机器人和车道数量呈指数增长。因此,这种方法不适合实时实现。在本文中,我们提出了一种结合学习与序贯优化的求解框架。特别地,我们提出了一种学习共享策略的算法,该策略在给定交通状态信息的情况下确定机器人的通行顺序。然后,我们根据该通行顺序依次优化机器人的轨迹。这种方法本质上始终保证安全。我们通过大量仿真验证了该方法的性能,并在9种不同的仿真设置中与文献中的5种不同启发式方法进行了比较。平均而言,我们的方法在目标函数、通行时间加权平均值和计算时间等各种指标上显著优于文献中的启发式方法。例如,在某些场景中,我们观察到我们的方法在目标值上比先到先服务启发式方法提高了最多150%。即使在未经训练的场景中,我们的方法在所有被考虑的启发式方法上也表现出超过30%的一致改进(在目标值上)。我们还通过仿真表明,我们方法的计算时间随机器人数量线性增长(假设所有其他因素保持不变)。学习到的策略已在物理机器人上实现,并对框架进行了轻微修改以应对现实世界中的挑战。

英文摘要:

We consider the problem of optimal unsignalized intersection management, wherein we seek to obtain safe and optimal trajectories, for a set of robots that arrive randomly and continually. This problem involves repeatedly solving a mixed integer program (with robot acceleration trajectories as decision variables) with different parameters, for which the computation time using a naive optimization algorithm scales exponentially with the number of robots and lanes. Hence, such an approach is not suitable for real-time implementation. In this paper, we propose a solution framework that combines learning and sequential optimization. In particular, we propose an algorithm for learning a shared policy that given the traffic state information, determines the crossing order of the robots. Then, we optimize the trajectories of the robots sequentially according to that crossing order. This approach inherently guarantees safety at all times. We validate the performance of this approach using extensive simulations and compare our approach against $5$ different heuristics from the literature in $9$ different simulation settings. Our approach, on average, significantly outperforms the heuristics from the literature in various metrics like objective function, weighted average of crossing times and computation time. For example, in some scenarios, we have observed that our approach offers up to $150\%$ improvement in objective value over the first come first serve heuristic. Even on untrained scenarios, our approach shows a consistent improvement (in objective value) of more than $30\%$ over all heuristics under consideration. We also show through simulations that the computation time for our approach scales linearly with the number of robots (assuming all other factors are constant). Learnt policies are implemented on physical robots with slightly modified framework to address real-world challenges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑