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 18 of 18 for “"multi-agent path finding"”.
-
Framework for multi-agent path finding A framework for multi-agent path finding with focus on transport systems
It is desirable to apply multi agent path finding (MAPF) algorithms to vehicles in transport systems, as it has the potential to reduce transit time and fuel consumption. However, the application is hampered by the high level of abstraction that these problems are typically solved at. This work …
-
Delay-tolerant Multi-Agent Path Finding: Delay-tolerant methods for solving multi-agent path finding problems in autonomous systems
Multi-agent path finding algorithms find collision-free paths that agents should follow according to a schedule. The schedules found by multi-agent path finding algorithms are strict, meaning that when a robot in an autonomous system is delayed and fall behind schedule, the schedule is invalidated …
-
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
-
Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems
… notions of relevancy to more efficiently solve path planning, motion planning and multi-agent path finding problems. The main focus of this thesis is to demonstrate how using generalized heuristics based on the relaxed notions of relevancy helps the hereto developed search algorithms focus their …
-
Probabilistically Robust Continuous-time Multi-Agent Path Finding Dynamic Risk Allocation and Chance-Constrained Planning under Execution Uncertainty
Automated logistics and multi-robot systems use Multi-Agent Path Finding (MAPF) algorithms to coordinate collision-free routes. In real-world industrial deployments, execution uncertainties such as mechanical variations and friction inevitably cause delays. Current robust MAPF algorithms handle …
-
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 …
-
LEARNING SCALABLE POLICIES FOR COOPERATIVE AND MIXED MULTI-AGENT SYSTEMS
Multi-Agent Systems (MAS), including competitive, cooperative, and mixed settings, address problems beyond the capability of individual agents in domains such as transportation, logistics, and robotics. Multi-Agent Path Finding (MAPF) is a representative mixed MAS problem that becomes increasingly …
-
Adaptive Planning for Robot Teams: Deep Reinforcement Learning in Dynamic Environments
… learning with Graph Neural Networks (GNN) for Multi-Agent Path Finding (MAPF) applications. In this study, the real-world environment is mapped to a topological graph with dynamic edge weights. Various solutions to this problem exist, providing both sub-optimal and optimal solutions. However, a …
-
Traffic Planning and Coordination of Automated Vehicles
… vehicles is made. This is accomplished by using multi-agent path finding to plan optimal routes for all vehicles in a closedoff road system, and coordinating their journeys in a safe manner with the help of a collaborative driving management system. The designed system consists of a continuous …
-
Planering och styrning av en flotta autonoma mobila robotar med centraliserad rörelsespårning
… is achieved through a strategy of efficient path planning and collision avoidance. An A* path planning strategy A* is implemeted which utilizes euclidean distance heuristics to minimize the cost between start and goal positions. This determines the optimal trajectory from inital, to …
-
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 …
-
Interleaving Allocation, Planning, and Scheduling for Heterogeneous Multi-Robot Coordination through Shared Constraints
… effective coordination of heterogeneous multi-robot teams is needed to solve complex problems. Effective coordination is predicated on the ability to solve the four fundamentally intertwined questions of coordination: what (task planning), who (task allocation), when (scheduling), and how …
-
Interaction-Aware Safe Planning for Human-Robot and Multi-Robot Systems
… obstacles but also with other decision-making agents, including humans and other robots. In such settings, both safety and task completion depend on the ability to reason about interaction. Two major challenges arise. In human-robot interaction, future human behavior depends on latent internal …
-
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.
-
Fotorealistisk simulering av mobila robotar i fabriksmiljöer
Modern factories handle more components than ever before, creating major logistical challenges. As a solution, autonomous mobile robots (AMRs) are now being used. Training the behavior of these robots in real-world environments is expensive and time-consuming. For this reason, the possibility of …
-
Towards Scalable and Robust Integrated Task and Motion Planning in the Real World
… cases and implicitly assume they can scale to multi-robot systems. Such assumptions usually do not hold true when more complex tasks need to be solved (e.g., when execution uncertainty cannot be ignored, or when the task requires coordinating dozens of robots). This work focuses on relaxing …
-
k-robust CBS with continuous time for multi-robot coordination
Coordinating multiple robots is crucial for various real-life applications. Many MultiAgent Path Finding (MAPF) algorithms have been proven to be successful in addressing this challenge. Nevertheless, some MAPF algorithms exhibit shortcomings when handling high-level abstractions, neglecting …
-
A UNIFIED MIXED-INTEGER CONVEX FRAMEWORK FOR COORDINATED MULTI-ROBOT TRAJECTORY PLANNING IN CLUTTERED ENVIRONMENTS
Coordinated multi-robot trajectory planning in cluttered environments couples three decisions that cannot be solved independently: the discrete choice of a route through a convex decomposition of free space, the continuous choice of a dynamically feasible trajectory along that route, and the …