Papers Multi-Agent Path Finding
“Multi-Agent Path Finding” 태그가 달린 논문 140편 · 필터 해제
Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks
Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple agents from their start locations to end locations. We consider an extension to this problem, Precedence Constrained Multi-Agent…
Multi-Agent Path FindingvalidDPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
In multi-agent path finding (MAPF), the task is to find non-conflicting paths for multiple agents from their initial positions to given individual goal positions. MAPF represents a classical artificial intelligence probl…
Heuristic SearchMulti-Agent Path FindingCoordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networks
We address the problem of routing a team of drones and trucks over large-scale urban road networks. To conserve their limited flight energy, drones can use trucks as temporary modes of transit en route to their own desti…
Multi-Agent Path FindingSubdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding
Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple agents from their respective start to goal locations. MAPF is challenging as the joint configuration space grows exponentially with respect to the nu…
Multi-Agent Path FindingFormalisation of Action with Durations in Answer Set Programming
In this paper, I will discuss the work I am currently doing as a Ph.D. student at the University of Potsdam, under the tutoring of T. Schaub. I'm currently looking into action description in ASP. More precisely, my goal …
Multi-Agent Path FindingFlexible and Explainable Solutions for Multi-Agent Path Finding Problems
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collid…
Multi-Agent Path FindingLearning Selective Communication for Multi-Agent Path Finding
Learning communication via deep reinforcement learning (RL) or imitation learning (IL) has recently been shown to be an effective way to solve Multi-Agent Path Finding (MAPF). However, existing communication based MAPF s…
Decision MakingDeep Reinforcement LearningImitation LearningMulti-Agent Path Finding+1Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints
Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics and Artificial Intelligence in which one needs to find a set of collision-free paths for a group of mobile agents (robots) operating in the shared wo…
Multi-Agent Path FindingMulti-objective Conflict-based Search Using Safe-interval Path Planning
This paper addresses a generalization of the well known multi-agent path finding (MAPF) problem that optimizes multiple conflicting objectives simultaneously such as travel time and path risk. This generalization, referr…
Multi-Agent Path FindingA Competitive Analysis of Online Multi-Agent Path Finding
We study online Multi-Agent Path Finding (MAPF), where new agents are constantly revealed over time and all agents must find collision-free paths to their given goal locations. We generalize existing complexity results o…
Multi-Agent Path FindingDistributed Heuristic Multi-Agent Path Finding with Communication
Multi-Agent Path Finding (MAPF) is essential to large-scale robotic systems. Recent methods have applied reinforcement learning (RL) to learn decentralized polices in partially observable environments. A fundamental chal…
Multi-Agent Path FindingQ-LearningReinforcement Learning (RL)Decentralised Approach for Multi Agent Path Finding
Multi Agent Path Finding (MAPF) requires identification of conflict free paths for agents which could be point-sized or with dimensions. In this paper, we propose an approach for MAPF for spatially-extended agents. These…
Multi-Agent Path FindingSchedulingCooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a group of autonomous agents operate in a …
Collision AvoidanceMulti-Agent Path FindingCompilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities
Multi-agent path finding (MAPF) attracts considerable attention in artificial intelligence community as well as in robotics, and other fields such as warehouse logistics. The task in the standard MAPF is to find paths th…
Multi-Agent Path FindingNavigateRevisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds
The problem of Multi-Agent Path Finding (MAPF) calls for finding a set of conflict-free paths for a fleet of agents operating in a given environment. Arguably, the state-of-the-art approach to computing optimal solutions…
Multi-Agent Path FindingMS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding
In multi-agent applications such as surveillance and logistics, fleets of mobile agents are often expected to coordinate and safely visit a large number of goal locations as efficiently as possible. The multi-agent plann…
CPUMulti-Agent Path FindingPairwise Symmetry Reasoning for Multi-Agent Path Finding Search
Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks us to plan collision-free paths for a team of cooperative agents. In this work, we show that one of the reasons why MAPF is so hard to solv…
Multi-Agent Path FindingLoosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions
Multi-agent path finding (MAPF) determines an ensemble of collision-free paths for multiple agents between their respective start and goal locations. Among the available MAPF planners for workspace modeled as a graph, A*…
Computational EfficiencyMulti-Agent Path FindingMAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings
Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization. While many algorithms have been developed to solve MAPF problems, there is no d…
Multi-Agent Path FindingSymmetry Breaking for k-Robust Multi-Agent Path Finding
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed by unexpected events. To address such situations recent work describes k-Robust Conflict-BasedSearch (k-CBS): an algorithm that produces coordinated …
Multi-Agent Path Finding