Letian Wang

Letian Wang

Auto-generated profile, based on publicly available information

Letian Wang

The University of Toronto, Toronto, Canada

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 February 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
LWLetian Wang
Letian Wang
LSLiting Sun
Liting Sun
MTMasayoshi Tomizuka
Masayoshi Tomizuka
WZWei Zhan
Wei Zhan
As more and more autonomous vehicles (AVs) are being deployed on public roads, designing socially compatible behaviors for them is becoming increasingly important. In order to generate safe and efficient actions, AVs need to not only predict the future behaviors of other traffic participants, but also be aware of the uncertainties associated with such behavior prediction. In this letter, we propose an uncertain-aware integrated prediction and planning (UAPP) framework. It allows the AVs to infer the characteristics of other road users online and generate behaviors optimizing not only their own rewards, but also their courtesy to others, and their confidence regarding the prediction uncertainties. We first propose the definitions for courtesy and confidence. Based on that, their influences on the behaviors of AVs in interactive driving scenarios are explored. Moreover, we evaluate the proposed algorithm on naturalistic human driving data by comparing the generated behavior against ground truth. Results show that the online inference can significantly improve the human-likeness of the generated behaviors. Furthermore, we find that human drivers show great courtesy to others, even for those without right-of-way. We also find that such driving preferences vary significantly in different cultures.

15 July 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
CLChenran Li
Chenran Li
TTTu Trinh
Tu Trinh
LWLetian Wang
Letian Wang
CLChangliu Liu
Changliu Liu
MTMasayoshi Tomizuka
Masayoshi Tomizuka
WZWei Zhan
Wei Zhan
Planning under social interactions with other agents is an essential problem for autonomous driving. As the actions of the autonomous vehicle in the interactions affect and are also affected by other agents, autonomous vehicles need to efficiently infer the reaction of the other agents. Most existing approaches formulate the problem as a generalized Nash equilibrium problem solved by optimization-based methods. However, they demand too much computational resource and easily fall into the local minimum due to the non-convexity. Monte Carlo Tree Search (MCTS) successfully tackles such issues in game-theoretic problems. However, as the interaction game tree grows exponentially, the general MCTS still requires a huge amount of iterations to reach the optima. In this paper, we introduce an efficient game-theoretic trajectory planning algorithm based on general MCTS by incorporating a prediction algorithm as a heuristic. On top of it, a social-compliant reward and a Bayesian inference algorithm are designed to generate diverse driving behaviors and identify the other driver's driving preference. Results demonstrate the effectiveness of the proposed framework with datasets containing naturalistic driving behavior in highly interactive scenarios.

27 October 2025
Verified
Conference Paper
Open access
TTTao Tang
Tao Tang
EMEnhui Ma
Enhui Ma
XZXia Zhou
Xia Zhou
LWLetian Wang
Letian Wang
TYTianyi Yan
Tianyi Yan
XLXiaodan Liang
Xiaodan Liang

8 July 2022 in arXiv
Verified
Preprint
Open access
PDF file
CLChenran Li
Chenran Li
TTTu Trinh
Tu Trinh
LWLetian Wang
Letian Wang
CLChangliu Liu
Changliu Liu
MTMasayoshi Tomizuka
Masayoshi Tomizuka
ZWZhan Wei
Zhan Wei
Planning under social interactions with other agents is an essential problem for autonomous driving. As the actions of the autonomous vehicle in the interactions affect and are also affected by other agents, autonomous vehicles need to efficiently infer the reaction of the other agents. Most existing approaches formulate the problem as a generalized Nash equilibrium problem solved by optimization-based methods. However, they demand too much computational resource and easily fall into the local minimum due to the non-convexity. Monte Carlo Tree Search (MCTS) successfully tackles such issues in game-theoretic problems. However, as the interaction game tree grows exponentially, the general MCTS still requires a huge amount of iterations to reach the optima. In this paper, we introduce an efficient game-theoretic trajectory planning algorithm based on general MCTS by incorporating a prediction algorithm as a heuristic. On top of it, a social-compliant reward and a Bayesian inference algorithm are designed to generate diverse driving behaviors and identify the other driver's driving preference. Results demonstrate the effectiveness of the proposed framework with datasets containing naturalistic driving behavior in highly interactive scenarios.