Byeong-Min Jeong

Byeong-Min Jeong

Auto-generated profile, based on publicly available information

Byeong-Min Jeong

Division of Aerospace Engineering KAIST 305-701 Daejeon Republic of Korea

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 August 2024 in International Journal of Control, Automation, and Systems
Verified
Journal Article
Closed access
PDF file
DJDae-Sung Jang
Dae-Sung Jang
DCDoohyun Cho
Doohyun Cho
WLWoo-Cheol Lee
Woo-Cheol Lee
SRSeung-Keol Ryu
Seung-Keol Ryu
BJByeongmin Jeong
Byeongmin Jeong
HCHan-Lim Choi
Han-Lim Choi

14 December 2023 in Aerospace
Verified
Journal Article
Open access
PDF file
BJByeong-Min Jeong
Byeong-Min Jeong
YOYun-Seo Oh
Yun-Seo Oh
DJDae-Sung Jang
Dae-Sung Jang
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
JKJoon-Won Kim
Joon-Won Kim
HCHan-Lim Choi
Han-Lim Choi
Task allocation is an essential element for determining the capability of multi-UAV systems to perform various tasks. This paper presents a procedure called a “rebalancing algorithm” for generating task-performing routes in heterogeneous multi-UAV systems. The algorithm adopts a greedy-based heuristic approach to find solutions efficiently in dynamically changing environments. A novel variable named “loitering” is introduced to satisfy temporal constraints, resulting in improved performance compared to heuristic algorithms: a sequential greedy algorithm, a genetic algorithm, and simulated annealing. The rebalancing algorithm is divided into two phases to minimize the makespan, i.e., the initial allocation and reallocation phases. Simulation results demonstrate the proposed algorithm’s effectiveness in highly constrained conditions and its suitability for heterogeneous systems. Additionally, the results show a reduction in calculation time and improved performance compared to the heuristic algorithms.

19 December 2025 in International Journal of Systems Science
Verified
Journal Article
Closed access
BJByeong-Min Jeong
Byeong-Min Jeong
DJDae-Sung Jang
Dae-Sung Jang
HCHan-Lim Choi
Han-Lim Choi

25 February 2023 in arXiv
Verified
Preprint
Open access
PDF file
JHJuyeop Han
Juyeop Han
YMYoung-Jae Min
Young-Jae Min
HCHyeok-Joo Chae
Hyeok-Joo Chae
BJByeong-Min Jeong
Byeong-Min Jeong
HCHan-Lim Choi
Han-Lim Choi
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 experiments.

14 May 2013 in arXiv
Verified
Preprint
Open access
PDF file
PTPiyush M. Tagade
Piyush M. Tagade
BJByeong-Min Jeong
Byeong-Min Jeong
HCHan-Lim Choi
Han-Lim Choi
This paper explores a Gaussian process emulator based approach for rapid Bayesian inference of contaminant source location and characteristics in an indoor environment. In the pre-event detection stage, the proposed approach represents transient contaminant fate and transport as a random function with multivariate Gaussian process prior. Hyper-parameters of the Gaussian process prior are inferred using a set of contaminant fate and transport simulation runs obtained at predefined source locations and characteristics. This paper uses an integrated multizone-CFD model to simulate contaminant fate and transport. Mean of the Gaussian process, conditional on the inferred hyper-parameters, is used as an computationally efficient statistical emulator of the multizone-CFD simulator. In the post event-detection stage, the Bayesian framework is used to infer the source location and characteristics using the contaminant concentration data obtained through a sensor network. The Gaussian process emulator of the contaminant fate and transport is used for Markov Chain Monte Carlo sampling to efficiently explore the posterior distribution of source location and characteristics. Efficacy of the proposed method is demonstrated for a hypothetical contaminant release through multiple sources in a single storey seven room building. The method is found to infer location and characteristics of the multiple sources accurately. The posterior distribution obtained using the proposed method is found to agree closely with the posterior distribution obtained by directly coupling the multizone-CFD simulator with the Markov Chain Monte Carlo sampling.

5 January 2026 in International Journal of Aeronautical and Space Sciences
Verified
Journal Article
Open access
BJByeong-Min Jeong
Byeong-Min Jeong
DJDae-Sung Jang
Dae-Sung Jang
HCHan-Lim Choi
Han-Lim Choi
This paper proposes a novel decentralized task assignment algorithm, called constrained task assignment and scheduling via approximate message passing (CTAS-AMP), for solving the constrained task assignment with scheduling (CTAS) problem, where tasks must be assigned to agents while respecting precedence constraints. Existing decentralized methods such as consensus-based bundle algorithm (CBBA) and its variants are limited in handling complex temporal dependencies. To address this, we model CTAS as a maximum a posteriori (MAP) estimation problem within a graphical model that includes agent, task, and constraint nodes. Using max-product belief propagation, we derive four types of messages and propose an iterative algorithm that computes, exchanges, and refines these messages under practical approximations. To satisfy constraints, the proposed method incorporates dedicated conflict resolution and refinement steps. Simulation results show that CTAS-AMP consistently generates feasible solutions that fully satisfy all precedence constraints, and demonstrates strong performance and robustness, particularly in scenarios with high variance in task rewards, compared to existing approaches such as coupled constrained CBBA.