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 15 of 15 for “"Multi-agent pathfinding"”.
-
Abstraction Hierarchies for Multi-Agent Pathfinding
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 …
-
Scalable cooperative multi-agent pathfinding with tractability and completeness guarantees
Pathfinding is the technique of finding a sequence of moves, forming a continuous path, to reach a goal. Multi-agent pathfinding is a challenging problem with numerous important applications, including robotics, logistics, military operations planning, disaster rescue, and computer games. Running a …
-
Multi-Agent Pathfinding in Mixed Discrete-Continuous Time and Space
In the multi-agent pathfinding (MAPF) problem, agents must move from their current locations to their individual destinations while avoiding collisions. Ideally, agents move to their destinations as quickly and efficiently as possible. MAPF has many real-world applications such as navigation, …
-
World model based multi-agent proximal policy optimization framework for multi-agent pathfinding
Multi-agent pathfinding plays a crucial role in various robot applications. Recently, deep reinforcement learning methods have been adopted to solve large-scale planning problems in a decentralized manner. Nonetheless, such approaches pose challenges such as non-stationarity and partial …
-
Multi-agent pathfinding with discrete speeds - and its application for vehicle road networks
This work contributes to the multi-agent path-finding problem (MAPF) by extending existing algorithms with optimal and efficient routing for roads with multiple lanes and intersections. It also considers the continuous case, where agents are forbidden from performing actions during a non-discrete …
-
Goal Distribution in Conflict-Based Search for Multi-Agent Pathfinding and its Implications to Monte-Carlo Sampling
… a common two-level search framework for solving MultiAgent Path Finding (MAPF). At its high-level, CBS searches over a Constraint Tree (CT). A body of publications looked at various approaches to perform the high-level search and find a goal (conflict-free) node efficiently. The performance of …
-
Bipartite Matching and Routing with Congestion Costs: A convex approach to robot task assignment and the multi-agent pathfinding problem
… from traffic assignment, ride-sharing, and multi-robot task assignment problems, this thesis incorporates shortest path and assignment problems with congestion by formulating them as a convex optimization problem to minimize the overall matching and routing cost. Two problem settings …
-
Daugelio agentų kelio paieškos algoritmų analizė /
This work is dedicated to examining the multi-agent pathfinding Conflict-Based Search (CBS) and Improved Conflict-Based Search algorithms. The work first explores and defines what the multi-agent pathfinding problem is, whereby agents have to move in a graph to reach their destination vertices in …
-
Automatic parameter selection for multi-speedmulti-agent pathfinding solver
Multi-agent pathfinding is a study focused on finding collision-free paths for multiple agents in a shared environment in order for the agents to reach designated destinations. As the problem is well researched, more and more sophisticated algorithms are available that utilize different parameters …
-
TEAM-INSPIRED REPRESENTATION LEARNING FOR DECENTRALIZED MULTI-ROBOT COORDINATION
… these systems, this thesis studies decentralized multi-agent systems (MAS) for large-scale autonomy in applications such as logistics and healthcare. By distributing perception, reasoning, and control across agents, decentralized MAS reduce reliance on central controllers and improve robustness. …
-
Resource allocation for constrained multi-agent systems
… explore the challenges of resource allocation in multi-agent systems. In particular, we consider resource allocation for multi-agent planning, where agents make a series of independent decisions to achieve their own goals. We focus on three main challenges: uncertain domains, differing resource …
-
Multi-Agent Navigation: A Study of CBS and CBSS on Turtlebots
Multi-Agent Pathfinding (MAPF) and its generalized counterpart, Multi-Agent Combinatorial Pathfinding (MCPF), are critical problems in robotics where multiple agents must navigate efficiently while avoiding collisions with static obstacles or with other agents. MAPF focuses on planning …
-
A Spatiotemporal Ontology for Semantic Trajectories
… its applications in robot path planning and multi-agent pathfinding problems. The ontology models the spatiotemporal evolution of entities, identifying relevant events and participants across space-time. Through ontological formalization, the study ensures consistency and alignment between …
-
Pathfinding Algorithm Optimization Via Evolution
Pathfinding is a popular computer science problem in both academic research and industrial development. The objective of pathfinding is to search for a path, often the shortest path, from one location to another on a graph. Many real world applications can be considered as pathfinding problems, …
-
Studies in constraint-based search for multi-robot planning
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms