2016 IEEE Intelligent Vehicles Symposium (IV) 2016
DOI: 10.1109/ivs.2016.7535424
|View full text |Cite
|
Sign up to set email alerts
|

Tactical cooperative planning for autonomous highway driving using Monte-Carlo Tree Search

Abstract: Human drivers use nonverbal communication and anticipation of other drivers' actions to master conflicts occurring in everyday driving situations. Without a high penetration of vehicle-to-vehicle communication an autonomous vehicle has to have the possibility to understand intentions of others and share own intentions with the surrounding traffic participants. This paper proposes a cooperative combinatorial motion planning algorithm without the need for inter vehicle communication based on Monte Carlo Tree Sea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
57
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
4
2

Relationship

1
9

Authors

Journals

citations
Cited by 79 publications
(57 citation statements)
references
References 18 publications
0
57
0
Order By: Relevance
“…Since each agent's reward depends not only on its own reward and actions but also on all other agents' actions at the previous stages, the tree grows exponentially with the number of agents. To achieve faster optimization for an optimal (or approximately optimal) solution, other tree search algorithms, such as Monte Carlo tree search (92), may be applied. To reduce computational complexity, Schwarting & Pascheka (93) assumed that the following vehicles' actions are dominated by their predecessors and used this assumption to formulate a recursive conflict-resolution algorithm to achieve only quadratic complexity in the number of agents.…”
Section: Game-theoretic Approachesmentioning
confidence: 99%
“…Since each agent's reward depends not only on its own reward and actions but also on all other agents' actions at the previous stages, the tree grows exponentially with the number of agents. To achieve faster optimization for an optimal (or approximately optimal) solution, other tree search algorithms, such as Monte Carlo tree search (92), may be applied. To reduce computational complexity, Schwarting & Pascheka (93) assumed that the following vehicles' actions are dominated by their predecessors and used this assumption to formulate a recursive conflict-resolution algorithm to achieve only quadratic complexity in the number of agents.…”
Section: Game-theoretic Approachesmentioning
confidence: 99%
“…The problem of behavior planning is challenging due to the high-dimensional continuous state space, non-linear motion dynamics, interactions with other agents and their unobservable intentions. This has led to researchers investigating collaborative approaches [6], game-theoretic approaches [7], as well as probabilistic approaches [8]. However, since these new approaches try to incorporate reactive predictions into the decision making process, the complexity is growing and it becomes even harder to fuse them with classic rule-based systems to abide by the traffic regulations and specifications.…”
Section: A Motivationmentioning
confidence: 99%
“…The potential of MCTS for cooperative driving is first presented in [16]. Based on Information-Set MCTS presented in ( [17], [18]) they ensure decoupled decision making and conduct decentralized planning.…”
Section: A Cooperative Drivingmentioning
confidence: 99%