32 citations · 72 across the 24 of their papers we have counts for
12 papers · 1 filter
ANAVI: Audio Noise Awareness using Visuals of Indoor environments for NAVIgation
Vidhi Jain, Rishi Veerapaneni, Yonatan Bisk
We propose Audio Noise Awareness using Visuals of Indoors for NAVIgation for quieter robot path planning. While humans are naturally aware of the noise they make and its impact on…
Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding
He Jiang, Yutong Wang, Rishi Veerapaneni +3
Lifelong Multi-Agent Path Finding (LMAPF) repeatedly finds collision-free paths for multiple agents that are continually assigned new goals when they reach current ones. Recently,…
Windowed MAPF with Completeness Guarantees
Rishi Veerapaneni, Muhammad Suhail Saleem, Jiaoyang Li +1
Traditional multi-agent path finding (MAPF) methods try to compute entire start-goal paths which are collision free. However, computing an entire path can take too long for MAPF sy…
A POMDP-based hierarchical planning framework for manipulation under pose uncertainty
Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev
Robots often face challenges in domestic environments where visual feedback is ineffective, such as retrieving objects obstructed by occlusions or finding a light switch in the dar…
Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF
Rishi Veerapaneni, Arthur Jakobsson, Kevin Ren +3
Multi-Agent Path Finding (MAPF) is the problem of effectively finding efficient collision-free paths for a group of agents in a shared workspace. The MAPF community has largely foc…
A preprocessing-based planning framework for utilizing contacts in high-precision insertion tasks
Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev
In manipulation tasks like plug insertion or assembly that have low tolerance to errors in pose estimation (errors of the order of 2mm can cause task failure), the utilization of t…
A Data Efficient Framework for Learning Local Heuristics
Rishi Veerapaneni, Jonathan Park, Muhammad Suhail Saleem +1
With the advent of machine learning, there have been several recent attempts to learn effective and generalizable heuristics. Local Heuristic A* (LoHA*) is one recent method that i…
Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality
Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev +1
Multi-Robot-Arm Motion Planning (M-RAMP) is a challenging problem featuring complex single-agent planning and multi-agent coordination. Recent advancements in extending the popular…
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
He Jiang, Yulun Zhang, Rishi Veerapaneni +1
Multi-Agent Path Finding (MAPF) is the problem of moving multiple agents from starts to goals without collisions. Lifelong MAPF (LMAPF) extends MAPF by continuously assigning new g…
From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS
Yu Wu, Rishi Veerapaneni, Jiaoyang Li +1
The majority of multi-agent path finding (MAPF) methods compute collision-free space-time paths which require agents to be at a specific location at a specific discretized timestep…
Improving Learnt Local MAPF Policies with Heuristic Search
Rishi Veerapaneni, Qian Wang, Kevin Ren +3
Multi-agent path finding (MAPF) is the problem of finding collision-free paths for a team of agents to reach their goal locations. State-of-the-art classical MAPF solvers typically…
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
Yifan Su, Rishi Veerapaneni, Jiaoyang Li
The Multi-Agent Path Finding (MAPF) problem involves planning collision-free paths for multiple agents in a shared environment. The majority of MAPF solvers rely on the assumption…