首页> 外文会议>IEEE Intelligent Vehicles Symposium >Decentralized Cooperative Planning for Automated Vehicles with Hierarchical Monte Carlo Tree Search
【24h】

Decentralized Cooperative Planning for Automated Vehicles with Hierarchical Monte Carlo Tree Search

机译:分层蒙特卡罗树搜索的无人驾驶汽车分散合作计划

获取原文

摘要

Today's automated vehicles lack the ability to cooperate implicitly with others. This work presents a Monte Carlo Tree Search (MCTS) based approach for decentralized cooperative planning using macro-actions for automated vehicles in heterogeneous environments. Based on cooperative modeling of other agents and Decoupled-UCT (a variant of MCTS), the algorithm evaluates the state-action-values of each agent in a cooperative and decentralized manner, explicitly modeling the interdependence of actions between traffic participants. Macro-actions allow for temporal extension over multiple time steps and increase the effective search depth requiring fewer iterations to plan over longer horizons. Without predefined policies for macro-actions, the algorithm simultaneously learns policies over and within macro-actions. The proposed method is evaluated under several conflict scenarios, showing that the algorithm can achieve effective cooperative planning with learned macro-actions in heterogeneous environments.
机译:当今的自动驾驶汽车缺乏与他人隐式合作的能力。这项工作提出了一种基于蒙特卡洛树搜索(MCTS)的方法,用于在异构环境中使用宏动作对自动化车辆进行分散合作计划。该算法基于其他代理的协作建模和Decoupled-UCT(MCTS的一种变体),以协作和分散的方式评估每个代理的状态-动作值,从而显式地建模交通参与者之间的动作相互依赖性。宏动作允许在多个时间步长上进行时间扩展,并增加有效搜索深度,从而需要较少的迭代来规划更长的时间范围。如果没有针对宏动作的预定义策略,该算法将同时学习宏动作之上和之内的策略。在多种冲突情形下对该方法进行了评估,结果表明该算法可以在异构环境下利用学习到的宏动作实现有效的协同规划。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号