default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandip Aine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Shohin Mukherjee
, Sandip Aine, Maxim Likhachev:
MPLP: Massively Parallelized Lazy Planning. IEEE Robotics Autom. Lett. 7(3): 6067-6074 (2022)- [c24]Guru Koushik Senthil Kumar, Sandip Aine, Maxim Likhachev:
Euclidean Distance-Optimal Post-processing of Grid-Based Paths. ICAPS 2022: 321-328 - [c23]Shohin Mukherjee, Sandip Aine, Maxim Likhachev:
ePA*SE: Edge-Based Parallel A* for Slow Evaluations. SOCS 2022: 136-144 - [i4]Shohin Mukherjee, Sandip Aine, Maxim Likhachev:
ePA*SE: Edge-based Parallel A* for Slow Evaluations. CoRR abs/2203.01369 (2022) - 2021
- [c22]Sandip Aine, Yash Oza, Maxim Likhachev:
Disruption-Limited Planning for Robot Navigation in Dynamic Environments. IROS 2021: 377-383 - [i3]Guru Koushik Senthil Kumar, Sandip Aine, Maxim Likhachev:
Euclidean Distance-Optimal Post-Processing of Grid-Based Paths. CoRR abs/2105.03833 (2021) - [i2]Manash Pratim Das, Anirudh Vemula, Mayank Pathak, Sandip Aine, Maxim Likhachev:
Learning Optimal Decision Making for an Industrial Truck Unloading Robot using Minimal Simulator Runs. CoRR abs/2105.05019 (2021) - [i1]Shohin Mukherjee, Sandip Aine, Maxim Likhachev:
MPLP: Massively Parallelized Lazy Planning. CoRR abs/2107.02826 (2021)
2010 – 2019
- 2019
- [c21]Ramkumar Natarajan, Muhammad Suhail Saleem, Sandip Aine, Maxim Likhachev, Howie Choset:
A-MHA*: Anytime Multi-Heuristic A. SOCS 2019: 192-193 - 2018
- [c20]Nishant Sharma, Shivam Thukral, Sandip Aine, P. B. Sujit:
A virtual bug planning technique for 2D robot path planning. ACC 2018: 5062-5069 - 2017
- [c19]Ankita Raj, Pravesh Biyani, Sandip Aine:
A* algorithm based power minimization for discontinuous operations in G.fast. ICC 2017: 1-6 - 2016
- [j8]Sandip Aine, Maxim Likhachev:
Truncated incremental search. Artif. Intell. 234: 49-77 (2016) - [j7]Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev:
Multi-Heuristic A. Int. J. Robotics Res. 35(1-3): 224-243 (2016) - [j6]Satya Gautam Vadlamudi, Sandip Aine, Partha Pratim Chakrabarti:
Anytime pack search. Nat. Comput. 15(3): 395-414 (2016) - [c18]Sandip Aine, Maxim Likhachev:
Search Portfolio with Sharing. ICAPS 2016: 11-19 - [c17]Sandip Aine, P. B. Sujit:
Integrating Planning and Control for Efficient Path Planning in the Presence of Environmental Disturbances. ICAPS 2016: 441-449 - 2015
- [c16]Mike Phillips, Venkatraman Narayanan, Sandip Aine, Maxim Likhachev:
Efficient Search with an Ensemble of Heuristics. IJCAI 2015: 784-791 - [c15]Venkatraman Narayanan, Sandip Aine, Maxim Likhachev:
Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics. SOCS 2015: 78-86 - [c14]Sandip Aine, Charupriya Sharma, Maxim Likhachev:
Learning to Search More Efficiently from Experience: A Multi-Heuristic Approach. SOCS 2015: 141-145 - 2014
- [c13]Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev:
Multi-Heuristic A. Robotics: Science and Systems 2014 - [c12]Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, Maxim Likhachev:
Multi-Heuristic A. SOCS 2014: 207-208 - 2013
- [j5]Satya Gautam Vadlamudi, Sandip Aine, P. P. Chakrabarti:
Incremental Beam search. Inf. Process. Lett. 113(22-24): 888-893 (2013) - [c11]Sandip Aine, Maxim Likhachev:
Truncated Incremental Search: Faster Replanning by Exploiting Suboptimality. AAAI 2013: 16-24 - [c10]Satya Gautam Vadlamudi, Sandip Aine, Partha Pratim Chakrabarti:
Anytime Pack Heuristic Search. PReMI 2013: 628-634 - [c9]Sandip Aine, Maxim Likhachev:
Anytime Truncated D* : Anytime Replanning with Truncation. SOCS 2013: 2-10 - 2012
- [c8]Satya Gautam Vadlamudi, Piyush Gaurav, Sandip Aine, Partha Pratim Chakrabarti:
Anytime Column Search. Australasian Conference on Artificial Intelligence 2012: 254-265 - 2011
- [j4]Satya Gautam Vadlamudi, Sandip Aine, Partha Pratim Chakrabarti:
$\hbox {MAWA}^{\ast }$ - A Memory-Bounded Anytime Heuristic-Search Algorithm. IEEE Trans. Syst. Man Cybern. Part B 41(3): 725-735 (2011) - 2010
- [j3]Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
Heuristic search under contract. Comput. Intell. 26(4): 386-419 (2010) - [c7]Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
Contract Search: Heuristic Search under Node Expansion Constraints. ECAI 2010: 733-738 - [c6]Sandip Aine, P. P. Chakrabarti:
An analysis of breadth-first beam search using uniform cost trees. ISAIM 2010
2000 – 2009
- 2009
- [j2]Sandip Aine, Rajeev Kumar, P. P. Chakrabarti:
Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off. Appl. Soft Comput. 9(2): 527-540 (2009) - [c5]Partha Pratim Chakrabarti, Sandip Aine:
New Approaches to Design and Control of Time Limited Search Algorithms. PReMI 2009: 1-6 - 2007
- [j1]Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
An Automated Meta-Level Control Framework for Optimizing the Quality-Time Tradeoff of VLSI Algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(11): 1992-2008 (2007) - [c4]Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
AWA* - A Window Constrained Anytime Heuristic Search Algorithm. IJCAI 2007: 2250-2255 - 2006
- [c3]Sandip Aine, P. P. Chakrabarti, Rajeev Kumar:
Improving the Performance of CAD Optimization Algorithms Using On-Line Meta-Level Control. VLSI Design 2006: 683-688 - 2005
- [c2]Sandip Aine, Rajeev Kumar, P. P. Chakrabarti:
An Adaptive Framework for Solving Multiple Hard Problems Under Time Constraints. CIS (1) 2005: 57-64 - [c1]Sandip Aine, Rajeev Kumar, P. P. Chakrabarti:
Adaptive Control of Anytime Algorithm Parameters. IICAI 2005: 72-87
Coauthor Index
aka: Partha Pratim Chakrabarti
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 2025-01-21 00:13 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:
