Search Results for author:
Found 10 papers, 2 papers with code
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
To tackle this issue, we propose a new approach for MAPF where agents are guided to their destination by following congestion-avoiding paths.
Reducing Redundant Work in Jump Point Search
JPS (Jump Point Search) is a state-of-the-art optimal algorithm for online grid-based pathfinding.
Enhanced Methods for the Weight Constrained Shortest Path Problem
This paper leverages the recent state-of-the-art techniques in both constrained pathfinding and bi-objective search and presents two new solution approaches to the WCSPP on the basis of A* search, both capable of solving hard WCSPP instances on very large graphs.
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications.
Bi-objective Search with Bi-directional A*
Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain.
Pairwise 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.
Symmetry Breaking for k-Robust Multi-Agent Path Finding
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed by unexpected events.
Organising a Successful AI Online Conference: Lessons from SoCS 2020
The 13th Symposium on Combinatorial Search (SoCS) was held May 26-28, 2020.
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D environment.
Searching with Consistent Prioritization for Multi-Agent Path Finding
We study prioritized planning for Multi-Agent Path Finding (MAPF).
