Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"MAPF"”.

  1. Experimental and numerical study of flow characteristics and segregation in flow enhanced systems

    … called the Magnetically Assisted Powder Flow (MAPF) method. In the MAPF, small magnetic particles and powders are placed in a test hopper. A mesh is placed at the bottom of the hopper to hold the magnetic particles while the powder is discharged through the mesh. It is shown that this method …

    njit Repository record for Experimental and numerical study of flow characteristics and segregation in flow enhanced systems (opens in a new tab)

  2. Optimizing Priority-Based Search for Lifelong Multi-Agent Path Finding

    The lifelong Multi-Agent Path Finding (MAPF) problem requires planning collision-free trajectories for agents operating continuously in dynamic environments. Traditional solvers such as Priority-Based Search (PBS) use fixed branching heuristics, which can be inefficient in high-congestion …

    mit Repository record for Optimizing Priority-Based Search for Lifelong Multi-Agent Path Finding (opens in a new tab)

  3. Towards Learning-guided Search for Coordination of Multi-agent Transportation at Scale

    … problems (VRPs) to multi-agent path finding (MAPF), we find that, while the design of well-suited search-based algorithm is important, deep neural networks policies consistently accelerates or improves the solution quality of state-of-the-art search algorithms while eliminating the need for …

    mit Repository record for Towards Learning-guided Search for Coordination of Multi-agent Transportation at Scale (opens in a new tab)

  4. Abstraction Hierarchies for Multi-Agent Pathfinding

    <p>Multi-Agent Pathfinding is an NP-Complete search problem with a branching factor that is exponential in the number of agents. Because of this exponential feature, it can be difficult to solve optimally using traditional search techniques, even for relatively small problems. Many recent optimal …

    denver Repository record for Abstraction Hierarchies for Multi-Agent Pathfinding (opens in a new tab)