14 citations · 30 across the 12 of their papers we have counts for
4 papers · 1 filter
A Contact-Driven Framework for Manipulating in the Blind
Muhammad Suhail Saleem, Lai Yuan, Maxim Likhachev
Robots often face manipulation tasks in environments where vision is inadequate due to clutter, occlusions, or poor lighting--for example, reaching a shutoff valve at the back of a…
A-MHA*: Anytime Multi-Heuristic A*
Ramkumar Natarajan, Muhammad Suhail Saleem, William Xiao +3
Designing good heuristic functions for graph search requires adequate domain knowledge. It is often easy to design heuristics that perform well and correlate with the underlying tr…
Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions
Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev
Heuristic search solvers like RTDP-Bel and LAO* have proven effective for computing optimal and bounded sub-optimal solutions for Partially Observable Markov Decision Processes (PO…
Anytime Single-Step MAPF Planning with Anytime PIBT
Nayesha Gandotra, Rishi Veerapaneni, Muhammad Suhail Saleem +3
PIBT is a popular Multi-Agent Path Finding (MAPF) method at the core of many state-of-the-art MAPF methods including LaCAM, CS-PIBT, and WPPL. The main utility of PIBT is that it i…