Search Results for author:
Found 5 papers, 3 papers with code
ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem
The Combined Target-Assignment and Path-Finding (TAPF) problem, a variant of MAPF, requires one to simultaneously assign targets to agents and plan collision-free paths for agents.
Caching-Augmented Lifelong Multi-Agent Path Finding
In this paper, we present a novel mechanism named Caching-Augmented Lifelong MAPF (CAL-MAPF), designed to improve the performance of Lifelong MAPF.
Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree
As a leading approach to address TAPF, Conflict-Based Search with Target Assignment (CBS-TA) leverages both K-best target assignments to create multiple search trees and Conflict-Based Search (CBS) to resolve collisions in each search tree.
Multi-modal Transfer Learning for Grasping Transparent and Specular Objects
State-of-the-art object grasping methods rely on depth sensing to plan robust grasps, but commercially available depth sensors fail to detect transparent and specular objects.
Robotics
A Minesweeper Solver Using Logic Inference, CSP and Sampling
Minesweeper as a puzzle video game and is proved that it is an NPC problem.
