Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hyeok-Joo Chae

dblp:166/3894 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-3028-0010ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 since 2021Systems, architecture and hardware · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Motion planning and robot control · 35% Reinforcement learning · 26% Robot navigation and mapping · 17%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › hierarchical reinforcement learning
hierarchical policy learning
0.512021
Distilling a Hierarchical Policy for Planning and Control via Representation and Reinforcement Learning · ICRA 2021
Robotics › Motion planning and robot control
motion planning
0.512021
Distilling a Hierarchical Policy for Planning and Control via Representation and Reinforcement Learning · ICRA 2021
Robotics › Motion planning and robot control
robot learning
0.512021
Distilling a Hierarchical Policy for Planning and Control via Representation and Reinforcement Learning · ICRA 2021
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
latent dynamics learning
0.312018
Adaptive Path-Integral Autoencoders: Representation Learning and Planning for Dynamical Systems · NeurIPS 2018
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.312018
Adaptive Path-Integral Autoencoders: Representation Learning and Planning for Dynamical Systems · NeurIPS 2018
Machine learning › Reinforcement learning
model-based reinforcement learning
0.312018
Adaptive Path-Integral Autoencoders: Representation Learning and Planning for Dynamical Systems · NeurIPS 2018
Robotics › Motion planning and robot control › stochastic optimal control
path integral control
0.312018
Adaptive Path-Integral Autoencoders: Representation Learning and Planning for Dynamical Systems · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
random finite set
0.212023
DS-K3DOM: 3-D Dynamic Occupancy Mapping with Kernel Inference and Dempster-Shafer Evidential Theory · ICRA 2023
Machine learning › Reinforcement learning
representation learning for control
0.112021
Distilling a Hierarchical Policy for Planning and Control via Representation and Reinforcement Learning · ICRA 2021

Methods — techniques the papers use, named apart from their topics

kernel inference · 0.7dirichlet basic belief assignment · 0.7dempster-shafer evidential theory · 0.7reinforcement learning · 0.5latent variable model · 0.5imitation learning · 0.5path integral control · 0.3amortized variational inference · 0.3
YearPublicationVenuePosition
2023 DS-K3DOM: 3-D Dynamic Occupancy Mapping with Kernel Inference and Dempster-Shafer Evidential Theory
abstract
Occupancy mapping has been widely utilized to represent the surroundings for autonomous robots to perform tasks such as navigation and manipulation. While occupancy mapping in 2-D environments has been well-studied, there have been few approaches suitable for 3-D dynamic occupancy mapping which is essential for aerial robots. This paper presents a novel 3-D dynamic occupancy mapping algorithm called DS-K3DOM. We first establish a Bayesian method to sequentially update occupancy maps for a stream of measurements based on the random finite set theory. Then, we approximate it with particles in the Dempster-Shafer domain to enable real-time computation. Moreover, the algorithm applies kernel-based inference with Dirichlet basic belief assignment to enable dense mapping from sparse measurements. The efficacy of the proposed algorithm is demonstrated through simulations and real experimentsiiThe code is available at: https://github.com/JuyeopHan/dsk3dom_public.
Juyeop Han, Youngjae Min, Hyeok-Joo Chae, Byeong-Min Jeong, Han-Lim Choi
ICRA3
2021 Distilling a Hierarchical Policy for Planning and Control via Representation and Reinforcement Learning
abstract
We present a hierarchical planning and control framework that enables an agent to perform various tasks and adapt to a new task flexibly. Rather than learning an individual policy for each particular task, the proposed framework, DISH, distills a hierarchical policy from a set of tasks by representation and reinforcement learning. The framework is based on the idea of latent variable models that represent high-dimensional observations using low-dimensional latent variables. The resulting policy consists of two levels of hierarchy: (i) a planning module that reasons a sequence of latent intentions that would lead to an optimistic future and (ii) a feedback control policy, shared across the tasks, that executes the inferred intention. Because the planning is performed in low-dimensional latent space, the learned policy can immediately be used to solve or adapt to new tasks without additional training. We demonstrate the proposed framework can learn compact representations (3- and 1-dimensional latent states and commands for a humanoid with 197- and 36-dimensional state features and actions) while solving a small number of imitation tasks, and the resulting policy is directly applicable to other types of tasks, i.e., navigation in cluttered environments.
Jung-Su Ha, Young-Jin Park, Hyeok-Joo Chae, Soon-Seo Park, Han-Lim Choi
ICRA3
2018 Adaptive Path-Integral Autoencoders: Representation Learning and Planning for Dynamical Systems
abstract
We present a representation learning algorithm that learns a low-dimensional latent dynamical system from high-dimensional sequential raw data, e.g., video. The framework builds upon recent advances in amortized inference methods that use both an inference network and a refinement procedure to output samples from a variational distribution given an observation sequence, and takes advantage of the duality between control and inference to approximately solve the intractable inference problem using the path integral control approach. The learned dynamical model can be used to predict and plan the future states; we also present the efficient planning method that exploits the learned low-dimensional latent dynamics. Numerical experiments show that the proposed path-integral control based variational inference method leads to tighter lower bounds in statistical model learning of sequential data. Supplementary video: https://youtu.be/xCp35crUoLQ
Jung-Su Ha, Young-Jin Park, Hyeok-Joo Chae, Soon-Seo Park, Han-Lim Choi
NeurIPS3