Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.16546v1

Help | Advanced Search

Computer Science > Robotics

arXiv:2506.16546v1 (cs)
[Submitted on 19 Jun 2025 ]

Title: BIDA: A Bi-level Interaction Decision-making Algorithm for Autonomous Vehicles in Dynamic Traffic Scenarios

Title: BIDA:动态交通场景下自动驾驶车辆的双层交互决策算法

Authors:Liyang Yu, Tianyi Wang, Junfeng Jiao, Fengwu Shan, Hongqing Chu, Bingzhao Gao
Abstract: In complex real-world traffic environments, autonomous vehicles (AVs) need to interact with other traffic participants while making real-time and safety-critical decisions accordingly. The unpredictability of human behaviors poses significant challenges, particularly in dynamic scenarios, such as multi-lane highways and unsignalized T-intersections. To address this gap, we design a bi-level interaction decision-making algorithm (BIDA) that integrates interactive Monte Carlo tree search (MCTS) with deep reinforcement learning (DRL), aiming to enhance interaction rationality, efficiency and safety of AVs in dynamic key traffic scenarios. Specifically, we adopt three types of DRL algorithms to construct a reliable value network and policy network, which guide the online deduction process of interactive MCTS by assisting in value update and node selection. Then, a dynamic trajectory planner and a trajectory tracking controller are designed and implemented in CARLA to ensure smooth execution of planned maneuvers. Experimental evaluations demonstrate that our BIDA not only enhances interactive deduction and reduces computational costs, but also outperforms other latest benchmarks, which exhibits superior safety, efficiency and interaction rationality under varying traffic conditions.
Abstract: 在复杂的现实交通环境中,自动驾驶车辆(AVs)需要在实时做出安全关键决策的同时与其它交通参与者进行交互。 人类行为的不可预测性带来了重大挑战,特别是在动态场景下,比如多车道高速公路和无信号灯控制的T字路口。 为了解决这一问题,我们设计了一种双层交互决策算法(BIDA),该算法结合了交互式蒙特卡洛树搜索(MCTS)和深度强化学习(DRL),旨在提高自动驾驶车辆在动态关键交通场景中的交互合理性、效率和安全性。 具体来说,我们采用了三种类型的DRL算法来构建可靠的值网络和策略网络,这些网络通过辅助价值更新和节点选择来指导交互式MCTS的在线推理过程。 然后,在CARLA中设计并实现了动态轨迹规划器和轨迹跟踪控制器,以确保计划操作的平稳执行。 实验评估表明,我们的BIDA不仅增强了交互推理能力并减少了计算成本,而且在各种交通条件下表现出比其他最新基准更高的安全性、效率和交互合理性。
Comments: 6 pages, 3 figures, 4 tables, accepted for IEEE Intelligent Vehicles (IV) Symposium 2025
Subjects: Robotics (cs.RO) ; Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET); Machine Learning (cs.LG); Systems and Control (eess.SY)
Cite as: arXiv:2506.16546 [cs.RO]
  (or arXiv:2506.16546v1 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2506.16546
arXiv-issued DOI via DataCite

Submission history

From: Tianyi Wang [view email]
[v1] Thu, 19 Jun 2025 19:03:40 UTC (3,695 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • Other Formats
view license
Current browse context:
cs.RO
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.AI
cs.ET
cs.LG
cs.SY
eess
eess.SY

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号