Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
1,931 results
RBE 550: Motion Planning Project Proposal Presentation Team: Dheeraj Bhogisetty, Shiva Surya Lolla and Siyuan Huang ...
1,495 views
3y ago
Short presentation of the paper: Shaull Almagor and Morteza Lahijanian, "Explainable Multi Agent Path Finding," Int. Conf. on ...
630 views
5y ago
J. Kottinger, S. Almagor, and M. Lahijanian, “Conflict-Based Search for Explainable Multi-Agent Path Finding,” in Int'l Conference ...
7,634 views
4y ago
SoCS 2020 From Multi-Agent Pathfinding to 3D Pipe Routing (Long), Gleb Belov, Wenbo Du, Maria Garcia De La Banda, Daniel ...
455 views
6y ago
Any-Angle Pathfinding For Multiple Agents Based On SIPP Algorithm Konstantin Yakovlev and Anton Andreychuk Multi Robot ...
902 views
8y ago
ICAPS 2020 talk on the paper Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar. Multi-Agent Path Finding ...
1,234 views
Multi-Agent Path Finding (MAPF) is a combinatorial problem that asks us to compute collision-free paths for teams of cooperative ...
757 views
In this video, we discuss what we mean by Classical MAPF: the core problem studied in multi-agent pathfinding. This will lay the ...
320 views
5mo ago
This is a poster teaser talk for the paper "A Hierarchical Approach to Multi-Agent Path Finding" by Han Zhang, Mingze Yao, Ziang ...
743 views
Advances in Multi-Agent Path Finding and Coordination Strategies https://a.co/d/2RNkwin This collection of research excerpts ...
180 views
9mo ago
54 views
1y ago
SoCS 2020 On Modelling Multi-Agent Path Finding as a Classical Planning Problem (Abstract), Jindřich Vodrážka, Roman Barták, ...
108 views
Presented at the 2021 AI for Urban Mobility Workshop, co-located with AAAI http://aium2021.felk.cvut.cz/ Jonathan Morag, Roni ...
282 views
Conflict-Based Search (CBS) and Heuristics for Multi-Agent Path Finding.
128 views
7mo ago
Video report for Computer Science Honors research.
440 views
... we can _improve_ CBS with Disjoint Splitting: https://youtu.be/lIXGO3Wuv-I Explore my *Multi-Agent Pathfinding Course* here: ...
384 views
2mo ago
Prioritised Planning is perhaps the simplest, most intuitive approach to solving MAPF problems; simply plan agents one-by-one!
413 views
4mo ago
We present background and detailed overview of the Windowed Anytime Multiagent Planning Framework (WAMPF), a framework ...
138 views
Operator Decomposition (OD) is a simple and intuitive approach to that reframes a joint-space MAPF problem by subdividing each ...
216 views
Presented at the 2019 Amazon Research Awards Robotics Symposium. In this talk we describe recent progress in the area of ...
336 views