Multi-lane unsignalized intersection cooperation with flexible lane direction based on multi-vehicle formation control
Unsignalized intersection cooperation of connected and automated vehicles (CAVs) is able
to eliminate green time loss of signalized intersections and improve traffic efficiency. Most of …
to eliminate green time loss of signalized intersections and improve traffic efficiency. Most of …
Visuomotor reinforcement learning for multirobot cooperative navigation
This article investigates the multirobot cooperative navigation problem based on raw visual
observations. A fully end-to-end learning framework is presented, which leverages graph …
observations. A fully end-to-end learning framework is presented, which leverages graph …
Which MAPF model works best for automated warehousing?
Abstract Multi-Agent Path Finding (MAPF) algorithms and their variants can find high-quality
collision-free plans for automated warehousing under simplified assumptions about the …
collision-free plans for automated warehousing under simplified assumptions about the …
Learning team-based navigation: a review of deep reinforcement learning techniques for multi-agent pathfinding
Multi-agent pathfinding (MAPF) is a critical field in many large-scale robotic applications,
often being the fundamental step in multi-agent systems. The increasing complexity of MAPF …
often being the fundamental step in multi-agent systems. The increasing complexity of MAPF …
Downwash-aware trajectory planning for large quadrotor teams
We describe a method for formation-change trajectory planning for large quadrotor teams in
obstacle-rich environments. Our method decomposes the planning problem into two stages …
obstacle-rich environments. Our method decomposes the planning problem into two stages …
Multi-robot path planning with due times
H Wang, W Chen - IEEE Robotics and Automation Letters, 2022 - ieeexplore.ieee.org
We formulate the problem of multi-robot path planning with due times (MRPP-DT), which is a
variant of the classical path planning problem with task due times explicitly considered. The …
variant of the classical path planning problem with task due times explicitly considered. The …
Probabilistic robust multi-agent path finding
In a multi-agent path finding (MAPF) problem, the task is to move a set of agents to their goal
locations without conflicts. In the real world, unexpected events may delay some of the …
locations without conflicts. In the real world, unexpected events may delay some of the …
Improving lacam for scalable eventually optimal multi-agent pathfinding
K Okumura - arXiv preprint arXiv:2305.03632, 2023 - arxiv.org
This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding
(MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor …
(MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor …
[PDF][PDF] Extended Increasing Cost Tree Search for Non-Unit Cost Domains.
Multi-agent pathfinding (MAPF) has applications in navigation, robotics, games and
planning. Most work on search-based optimal algorithms for MAPF has focused on simple …
planning. Most work on search-based optimal algorithms for MAPF has focused on simple …
SCRIMP: Scalable communication for reinforcement-and imitation-learning-based multi-agent pathfinding
Y Wang, B Xiang, S Huang… - 2023 IEEE/RSJ …, 2023 - ieeexplore.ieee.org
Trading off performance guarantees in favor of scalability, the Multi-Agent Path Finding
(MAPF) community has recently started to embrace Multi-Agent Reinforcement Learning …
(MAPF) community has recently started to embrace Multi-Agent Reinforcement Learning …