91 citations · 384 across the 15 of their papers we have counts for
22 papers
Exploring the environment, magnetic fields, and feedback effects of massive high-redshift galaxies with [CII]
K. Kade, K. K. Knudsen, W. Vlemmings +3
Massive galaxies are expected to grow through different transformative evolutionary phases where high-redshift starburst galaxies and quasars are examples of such phases. The physi…
Co-Design of Topology, Scheduling, and Path Planning in Automated Warehouses
Christopher Leet, Chanwook Oh, Michele Lora +2
We address the warehouse servicing problem (WSP) in automated warehouses, which use teams of mobile agents to bring products from shelves to packing stations. Given a list of produ…
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems
Sumedh Pendurkar, Taoan Huang, Sven Koenig +1
The A* algorithm is commonly used to solve NP-hard combinatorial optimization problems. When provided with a completely informed heuristic function, A* solves many NP-hard minimum-…
Multi-Agent Path Finding with Capacity Constraints
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vert…
Automatic Algorithm Selection In Multi-agent Pathfinding
Devon Sigurdson, Vadim Bulitko, Sven Koenig +2
In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…