default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRishi Veerapaneni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Yifan Su, Rishi Veerapaneni, Jiaoyang Li:
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution. AAAI 2024: 17559-17566- [c11]Rishi Veerapaneni, Qian Wang, Kevin Ren, Arthur Jakobsson, Jiaoyang Li, Maxim Likhachev:
Improving Learnt Local MAPF Policies with Heuristic Search. ICAPS 2024: 597-606 - [c10]Qian Wang, Rishi Veerapaneni, Yu Wu, Jiaoyang Li, Maxim Likhachev:
MAPF in 3D Warehouses: Dataset and Analysis. ICAPS 2024: 623-632 - [c9]Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev, Jiaoyang Li:
Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality. SOCS 2024: 109-117 - [c8]Rishi Veerapaneni, Jonathan Park, Muhammad Suhail Saleem, Maxim Likhachev:
A Data Efficient Framework for Learning Local Heuristics. SOCS 2024: 223-227 - [c7]Jiang He, Yulun Zhang, Rishi Veerapaneni, Jiaoyang Li:
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities. SOCS 2024: 234-242 - [c6]Yu Wu, Rishi Veerapaneni, Jiaoyang Li, Maxim Likhachev:
From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS (Extended Abstract). SOCS 2024: 293-294 - [i13]Yifan Su, Rishi Veerapaneni, Jiaoyang Li:
Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution. CoRR abs/2401.00315 (2024) - [i12]Rishi Veerapaneni, Qian Wang, Kevin Ren, Arthur Jakobsson, Jiaoyang Li, Maxim Likhachev:
Improving Learnt Local MAPF Policies with Heuristic Search. CoRR abs/2403.20300 (2024) - [i11]Rishi Veerapaneni, Jonathan Park, Muhammad Suhail Saleem, Maxim Likhachev:
A Data Efficient Framework for Learning Local Heuristics. CoRR abs/2404.06728 (2024) - [i10]Yu Wu, Rishi Veerapaneni, Jiaoyang Li, Maxim Likhachev:
From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS. CoRR abs/2404.15137 (2024) - [i9]Jiang He, Yulun Zhang, Rishi Veerapaneni, Jiaoyang Li:
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities. CoRR abs/2404.16162 (2024) - [i8]Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev, Jiaoyang Li:
Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality. CoRR abs/2405.01772 (2024) - [i7]Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev:
A preprocessing-based planning framework for utilizing contacts in high-precision insertion tasks. CoRR abs/2406.05522 (2024) - [i6]Rishi Veerapaneni, Arthur Jakobsson, Kevin Ren, Samuel Kim, Jiaoyang Li, Maxim Likhachev:
Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF. CoRR abs/2409.14491 (2024) - [i5]Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev:
A POMDP-based hierarchical planning framework for manipulation under pose uncertainty. CoRR abs/2409.18775 (2024) - 2023
- [j2]Muhammad Suhail Saleem
, Rishi Veerapaneni, Maxim Likhachev:
Preprocessing-Based Planning for Utilizing Contacts in Semi-Structured High-Precision Insertion Tasks. IEEE Robotics Autom. Lett. 8(11): 6947-6954 (2023) - [c5]Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev:
Effective Integration of Weighted Cost-to-Go and Conflict Heuristic within Suboptimal CBS. AAAI 2023: 11691-11698 - [c4]Rishi Veerapaneni, Muhammad Suhail Saleem, Maxim Likhachev:
Learning Local Heuristics for Search-Based Navigation Planning. ICAPS 2023: 634-638 - [i4]Rishi Veerapaneni, Muhammad Suhail Saleem, Maxim Likhachev:
Learning Local Heuristics for Search-Based Navigation Planning. CoRR abs/2303.09477 (2023) - 2022
- [c3]Aidan Wagner, Rishi Veerapaneni, Maxim Likhachev:
Minimizing Coordination in Multi-Agent Path Finding with Dynamic Execution. AIIDE 2022: 61-69 - [c2]Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev:
Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract). SOCS 2022: 326-328 - [i3]Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev:
Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS. CoRR abs/2205.11624 (2022) - [i2]Rishi Veerapaneni, Maxim Likhachev:
Non-Blocking Batch A* (Technical Report). CoRR abs/2208.07031 (2022)
2010 – 2019
- 2019
- [c1]Rishi Veerapaneni, John D. Co-Reyes, Michael Chang, Michael Janner, Chelsea Finn, Jiajun Wu, Joshua B. Tenenbaum, Sergey Levine:
Entity Abstraction in Visual Model-Based Reinforcement Learning. CoRL 2019: 1439-1456 - [i1]Rishi Veerapaneni, John D. Co-Reyes, Michael Chang, Michael Janner, Chelsea Finn, Jiajun Wu, Joshua B. Tenenbaum, Sergey Levine:
Entity Abstraction in Visual Model-Based Reinforcement Learning. CoRR abs/1910.12827 (2019) - 2017
- [j1]Assaf Hoogi, Arjun Subramaniam, Rishi Veerapaneni, Daniel L. Rubin:
Adaptive Estimation of Active Contour Parameters Using Convolutional Neural Networks and Texture Analysis. IEEE Trans. Medical Imaging 36(3): 781-791 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
