← Search

Young J. Kim

17 accepted papers

2025

Fast and Accurate Task Planning using Neuro-Symbolic Language Models and Multi-Level Goal Decomposition

ICRA 2025

In robotic task planning, symbolic planners using rule-based representations like PDDL are effective but struggle with long-sequential tasks in complicated environments due to exponentially increasing search space. Meanwhile, LLM-based approaches, which are grounded in artificial neural networks, of

Cited by 14SourceScholar
2023

Stroke-Based Rendering and Planning for Robotic Performance of Artistic Drawing

IROS 2023poster

We present a new robotic drawing system based on stroke-based rendering (SBR). Our motivation is the artistic quality of the whole performance. Not only should the generated strokes in the final drawing resemble the input image, but the stroke sequence should also exhibit a human artist's planning p…

Cited by 3SourceScholar
2022

Autoexplorer: Autonomous Exploration of Unknown Environments using Fast Frontier-Region Detection and Parallel Path Planning

IROS 2022poster

We propose a fully autonomous system for mobile robot exploration in unknown environments. Our system employs a novel frontier detection algorithm based on the fast front propagation (FFP) technique and uses parallel path planning to reach the detected front regions. Given an occupancy grid map in 2…

Cited by 10SourceScholar
2021

Accelerating Probabilistic Volumetric Mapping using Ray-Tracing Graphics Hardware

ICRA 2021poster

Probabilistic volumetric mapping (PVM) represents a 3D environmental map for an autonomous robotic navigational task. A popular implementation such as Octomap is widely used in the robotics community for such a purpose. The Octomap relies on an octree to represent a PVM and its main bottleneck lies…

Cited by 9SourceScholar
2015

Hybrid penetration depth computation using local projection and machine learning

IROS 2015poster

We present a new hybrid approach to computing penetration depth (PD) for general polygonal models. Our approach exploits both local and global approaches to PD computation and can compute error-bounded PD approximations for both deep and shallow penetrations. We use a two-step formulation: the first…

Cited by 5SourceScholar