Jinhwi Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jinhwi Lee has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- ChangHwan Kim
Korea Institute of Science and Technology, Seoul, South Korea
3 shared publications - Changjoo Nam
Department of Electronic Engineering, Sogang University, Seoul, South Korea
3 shared publications - Jong Hyeon Park
School of Mechanical Engineering, Hanyang University, Seoul 04763, Republic of Korea
2 shared publications ChangHwan Kim
Korea Institute of Science and Technology, Seoul, South Korea
1 shared publication- Dong Hwan Kim
Center for Intelligent and Interactive Robotics, Korea Institute of Science and Technology, Seoul 02792, Korea
1 shared publication - Minjun Bhang1 shared publication
Latest Publications
- 31 August 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (3) , 325-332
Context-Driven Task and Motion Planning with Language Models
- 31 August 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (3) , 325-332
Context-Driven Task and Motion Planning with Language Models
- 29 May 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (2) , 239-244
Synthetic Data Generation Using Physically-Based Rendering for Segmentation and Performance Analysis
- 29 May 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (2) , 239-244
Synthetic Data Generation Using Physically-Based Rendering for Segmentation and Performance Analysis
- Open Access
- 11 June 2025
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 193
Task and Motion Planning for grasping targets with object rearrangement in confined workspaces
- 11 June 2025
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 193
Open AccessTask and Motion Planning for grasping targets with object rearrangement in confined workspaces
- Open Access
- 26 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 134899-134911
Local and Global Search-Based Planning for Object Rearrangement in Clutter
We propose two algorithms based on local and global searches for a Task and Motion Planning (TAMP) problem, which considers a robotic manipulator to rearrange obstacles and grasp a target in clutter. In the problem, no collision-free path for a robotic manipulator is available unless some obstacles blocking a target are relocated. The two algorithms determine the sequence of obstacles to be removed for grasping a target without collisions. The local search algorithm determines the sequence quickly in an online manner but could be suboptimal in the number of removed obstacles. The global search algorithm based on tree search needs upfront computation but runs in polynomial time. In numerical simulation settings, we consider objects in various shapes, which could make reachable directions bounded. From the simulations the planning time of local search algorithm is faster than that of global search, whereas the global search algorithm removes the less number of obstacles than the local search. In addition, we show that the global search algorithm with a heuristic cost is faster than without the cost but the minimum number of removed obstacles is still obtained from the global search algorithm without the heuristic cost. Practical experiments show the applicability of our algorithms in real environments.
- 26 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 134899-134911
Open AccessLocal and Global Search-Based Planning for Object Rearrangement in Clutter
We propose two algorithms based on local and global searches for a Task and Motion Planning (TAMP) problem, which considers a robotic manipulator to rearrange obstacles and grasp a target in clutter. In the problem, no collision-free path for a robotic manipulator is available unless some obstacles blocking a target are relocated. The two algorithms determine the sequence of obstacles to be removed for grasping a target without collisions. The local search algorithm determines the sequence quickly in an online manner but could be suboptimal in the number of removed obstacles. The global search algorithm based on tree search needs upfront computation but runs in polynomial time. In numerical simulation settings, we consider objects in various shapes, which could make reachable directions bounded. From the simulations the planning time of local search algorithm is faster than that of global search, whereas the global search algorithm removes the less number of obstacles than the local search. In addition, we show that the global search algorithm with a heuristic cost is faster than without the cost but the minimum number of removed obstacles is still obtained from the global search algorithm without the heuristic cost. Practical experiments show the applicability of our algorithms in real environments.
- 24 September 2022
- Published by Springer Nature in Intelligent Service Robotics
- Vol. 15 (5) , 649-660
High dimensional object rearrangement for a robot manipulation in highly dense configurations
- 24 September 2022
- Published by Springer Nature in Intelligent Service Robotics
- Vol. 15 (5) , 649-660
High dimensional object rearrangement for a robot manipulation in highly dense configurations
- 21 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 37 (5) , 1539-1552
Fast and Resilient Manipulation Planning for Object Retrieval in Cluttered and Confined Environments
In this article, we present a task and motion planning method for retrieving a target object from clutter using a robotic manipulator. We consider dense and cluttered environments where some objects must be removed in order to retrieve the target without collisions. To ensure a successful execution, the interplay between task planning ( what to remove in what order ) and motion planning ( how to remove ) is crucial. Thus, the task and motion planning approach combining a symbolic task planner and a geometric motion planner becomes one of the major paradigms in manipulation planning. However, motion planning in dense clutter often leads to frequent failures, so repetitive task replanning is inevitable. Although symbolic task planners are general and domain-independent, they do not scale; so we need an efficient task planner specialized for dense clutter for fast completion of tasks. We propose a polynomial-time task planner for object manipulation in clutter that can be combined with any motion planner. We aim to optimize the number of pick-and-place actions which often determines the efficiency of object manipulation tasks. We consider common situations that could occur in clutter: 1) all object locations are known, 2) some hidden objects are revealed while relocating some front objects, and 3) the target is hidden until some objects are removed. Our method is shown to reduce the number of pick-and-place actions compared to baseline methods (e.g., at least 28.0% of reduction in a known static environment with 20 objects). We also deploy the proposed method to two physical robots with vision systems to show that our method can solve real-world problems.
- 21 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 37 (5) , 1539-1552
Fast and Resilient Manipulation Planning for Object Retrieval in Cluttered and Confined Environments
In this article, we present a task and motion planning method for retrieving a target object from clutter using a robotic manipulator. We consider dense and cluttered environments where some objects must be removed in order to retrieve the target without collisions. To ensure a successful execution, the interplay between task planning ( what to remove in what order ) and motion planning ( how to remove ) is crucial. Thus, the task and motion planning approach combining a symbolic task planner and a geometric motion planner becomes one of the major paradigms in manipulation planning. However, motion planning in dense clutter often leads to frequent failures, so repetitive task replanning is inevitable. Although symbolic task planners are general and domain-independent, they do not scale; so we need an efficient task planner specialized for dense clutter for fast completion of tasks. We propose a polynomial-time task planner for object manipulation in clutter that can be combined with any motion planner. We aim to optimize the number of pick-and-place actions which often determines the efficiency of object manipulation tasks. We consider common situations that could occur in clutter: 1) all object locations are known, 2) some hidden objects are revealed while relocating some front objects, and 3) the target is hidden until some objects are removed. Our method is shown to reduce the number of pick-and-place actions compared to baseline methods (e.g., at least 28.0% of reduction in a known static environment with 20 objects). We also deploy the proposed method to two physical robots with vision systems to show that our method can solve real-world problems.