Shuai D. Han

Orcid: 0000-0001-7741-2378

According to our database1, Shuai D. Han authored at least 22 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Visual Foresight Trees for Object Retrieval From Clutter With Nonprehensile Rearrangement.
IEEE Robotics Autom. Lett., 2022

Optimizing Space Utilization for More Effective Multi-Robot Path Planning.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022

2021
Visual Foresight Tree for Object Retrieval from Clutter with Nonprehensile Rearrangement.
CoRR, 2021

DIPN: Deep Interaction Prediction Network with Application to Clutter Removal.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Toward Fully Automated Metal Recycling using Computer Vision and Non-Prehensile Manipulation.
Proceedings of the 17th IEEE International Conference on Automation Science and Engineering, 2021

2020
DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics.
IEEE Robotics Autom. Lett., 2020

Toward Fast and Optimal Robotic Pick-and-Place on a Moving Conveyor.
IEEE Robotics Autom. Lett., 2020

Computing High-Quality Clutter Removal Solutions for Multiple Robots.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020

2019
Efficient Algorithms for Optimal Perimeter Guarding.
CoRR, 2019

Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles and Best Practices.
CoRR, 2019

Efficient Algorithms for Optimal Perimeter Guarding.
Proceedings of the Robotics: Science and Systems XV, 2019

Effective Heuristics for Multi-Robot Path Planning in Warehouse Environments.
Proceedings of the 2019 International Symposium on Multi-Robot and Multi-Agent Systems, 2019

Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications.
Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

2018
Efficient, High-Quality Stack Rearrangement.
IEEE Robotics Autom. Lett., 2018

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps.
Int. J. Robotics Res., 2018

Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density.
Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee.
Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

2017
SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning.
CoRR, 2017

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods.
Proceedings of the Robotics: Science and Systems XIII, 2017

A portable, 3D-printing enabled multi-vehicle platform for robotics research and education.
Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

2016
A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics Research and Education.
CoRR, 2016


  Loading...