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 5 of 5 for “"Multi-Agent Path Finding"”.
-
Multi-Agent Path Finding Per Partes: Automatic Warehouses
… a new partitioning method for the online Multi-Agent Pickup and Delivery (MAPD) problem in a large automatic warehouse. The method divides the workspace into independent regions and introduces transfer zones as controlled hand-off points for tasks spanning multiple regions. Agents operate …
-
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 …
-
Subdimensional expansion method for multi-agent path finding with long narrow corridors
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-08-01
-
Towards Learning-guided Search for Coordination of Multi-agent Transportation at Scale
… challenges? In this thesis, I highlight multiple levels of decision-making in large-scale transportation problems, ranging from assignment of tasks to collision-free path/motion planning and everything in between (e.g. order of goals, routing, order of crossing, lane changing, continuous …
-
Solving General Game Playing with Incomplete Information Problem using Iterative Tree Search and Language Learning
… an experiment using GLTS by providing it with a Multi-Agent Path Finding with Destination Uncertainty problem. The GLTS algorithm successfully discovers the desired strategies by utilising the implicit communication among agents.