default search action
Shuai D. Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Baichuan Huang
, Shuai D. Han
Visual Foresight Trees for Object Retrieval From Clutter With Nonprehensile Rearrangement. IEEE Robotics Autom. Lett. 7(1): 231-238 (2022) - [c12]Shuai D. Han, Jingjin Yu:
Optimizing Space Utilization for More Effective Multi-Robot Path Planning. ICRA 2022: 10709-10715 - 2021
- [c11]Shuai D. Han, Baichuan Huang, Sijie Ding, Changkyu Song, Si Wei Feng, Ming Xu, Hao Lin, Qingze Zou, Abdeslam Boularias, Jingjin Yu:
Toward Fully Automated Metal Recycling using Computer Vision and Non-Prehensile Manipulation. CASE 2021: 891-898 - [c10]Baichuan Huang, Shuai D. Han, Abdeslam Boularias, Jingjin Yu:
DIPN: Deep Interaction Prediction Network with Application to Clutter Removal. ICRA 2021: 4694-4701 - [c9]Teng Guo, Shuai D. Han, Jingjin Yu:
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning. ICRA 2021: 8009-8015 - [i15]Teng Guo, Shuai D. Han, Jingjin Yu:
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning. CoRR abs/2103.14111 (2021) - [i14]Baichuan Huang, Shuai D. Han, Jingjin Yu, Abdeslam Boularias:
Visual Foresight Tree for Object Retrieval from Clutter with Nonprehensile Rearrangement. CoRR abs/2105.02857 (2021) - [i13]Shuai D. Han, Jingjin Yu:
Optimizing Space Utilization for More Effective Multi-Robot Path Planning. CoRR abs/2109.04677 (2021) - 2020
- [j4]Shuai D. Han
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor. IEEE Robotics Autom. Lett. 5(2): 446-453 (2020) - [j3]Shuai D. Han
DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics. IEEE Robotics Autom. Lett. 5(2): 1350-1357 (2020) - [c8]Wei N. Tang, Shuai D. Han, Jingjin Yu:
Computing High-Quality Clutter Removal Solutions for Multiple Robots. IROS 2020: 7963-7970 - [i12]Wei N. Tang, Shuai D. Han, Jingjin Yu:
Computing High-Quality Clutter Removal Solutions for Multiple Robots. CoRR abs/2007.04856 (2020) - [i11]Baichuan Huang, Shuai D. Han, Abdeslam Boularias, Jingjin Yu:
DIPN: Deep Interaction Prediction Network with Application to Clutter Removal. CoRR abs/2011.04692 (2020)
2010 – 2019
- 2019
- [c7]Shuai D. Han, Jingjin Yu:
Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications. IROS 2019: 1890-1897 - [c6]Shuai D. Han, Jingjin Yu:
Effective Heuristics for Multi-Robot Path Planning in Warehouse Environments. MRS 2019: 10-12 - [c5]Si Wei Feng, Shuai D. Han, Jingjin Yu:
Efficient Algorithms for Optimal Perimeter Guarding. Robotics: Science and Systems 2019 - [i10]Shuai D. Han, Jingjin Yu:
Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles and Best Practices. CoRR abs/1902.02652 (2019) - [i9]Shuai D. Han, Jingjin Yu:
DDM*: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics. CoRR abs/1904.02598 (2019) - [i8]Si Wei Feng, Shuai D. Han, Kai Gao, Jingjin Yu:
Efficient Algorithms for Optimal Perimeter Guarding. CoRR abs/1905.04434 (2019) - [i7]Shuai D. Han, Si Wei Feng, Jingjin Yu:
Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor. CoRR abs/1912.08009 (2019) - 2018
- [j2]Shuai D. Han
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps. Int. J. Robotics Res. 37(13-14) (2018) - [j1]Shuai D. Han
Efficient, High-Quality Stack Rearrangement. IEEE Robotics Autom. Lett. 3(3): 1608-1615 (2018) - [c4]Shuai D. Han, Edgar J. Rodriguez, Jingjin Yu:
SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee. IROS 2018: 1-9 - [c3]Rupesh Chinta, Shuai D. Han, Jingjin Yu:
Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density. WAFR 2018: 817-834 - [i6]Rupesh Chinta, Shuai D. Han, Jingjin Yu:
Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density. CoRR abs/1807.03347 (2018) - 2017
- [c2]Jingjin Yu, Shuai D. Han, Wei N. Tang, Daniela Rus:
A portable, 3D-printing enabled multi-vehicle platform for robotics research and education. ICRA 2017: 1475-1480 - [c1]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods. Robotics: Science and Systems 2017 - [i5]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods. CoRR abs/1705.09180 (2017) - [i4]Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris, Jingjin Yu:
Efficient, High-Quality Stack Rearrangement. CoRR abs/1706.09949 (2017) - [i3]Shuai D. Han, Edgar J. Rodriguez, Jingjin Yu:
SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning. CoRR abs/1709.08215 (2017) - [i2]Shuai D. Han, Nicholas M. Stiffler, Athanasios Krontiris, Kostas E. Bekris, Jingjin Yu:
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps. CoRR abs/1711.07369 (2017) - 2016
- [i1]Jingjin Yu, Shuai D. Han, Daniela Rus:
A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics Research and Education. CoRR abs/1609.04745 (2016)
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-04-25 05:50 CEST 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: