Byeong-Min Jeong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Byeong-Min Jeong has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Han-Lim Choi
Korea Advanced Institute of Science and Technology
7 shared publications - Dae-Sung Jang
Department of Aerospace Engineering, Korea Aerospace University, Goyang, Republic of Korea
4 shared publications - Changkyo Shin1 shared publication
- Doo-Hyun Cho
KAIST
1 shared publication - Duckhyun Suh
LIG Defense & Aerospace, Seongnam 13488, Republic of Korea
1 shared publication - Hyeok-Joo Chae
Korea Advanced Institute of Science and Technology, Daejeon 34141, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 5 January 2026
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 27 (4) , 3674-3693
Decentralized Task Assignment with Precedence Constraints Using Approximate Message Passing Algorithm
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.
- 5 January 2026
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 27 (4) , 3674-3693
Open AccessDecentralized Task Assignment with Precedence Constraints Using Approximate Message Passing Algorithm
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.
- 19 December 2025
- Published by Taylor & Francis in International Journal of Systems Science
- p. 1-21
Approximate message passing algorithm for decentralised task assignment and scheduling
- 19 December 2025
- Published by Taylor & Francis in International Journal of Systems Science
- p. 1-21
Approximate message passing algorithm for decentralised task assignment and scheduling
- 28 November 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (4) , 555-561
Decentralized Frontier-based Exploration Method Under Constrained Global Information
- 28 November 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (4) , 555-561
Decentralized Frontier-based Exploration Method Under Constrained Global Information
- 2 August 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (8) , 2341-2384
Unlocking Robotic Autonomy: A Survey on the Applications of Foundation Models
- 2 August 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (8) , 2341-2384
Unlocking Robotic Autonomy: A Survey on the Applications of Foundation Models
- Open Access
Makespan-Minimizing Heterogeneous Task Allocation under Temporal Constraints
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.
Open AccessMakespan-Minimizing Heterogeneous Task Allocation under Temporal Constraints
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.
- Open Access
DS-K3DOM: 3-D Dynamic Occupancy Mapping with Kernel Inference and Dempster-Shafer Evidential Theory
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.
Open AccessDS-K3DOM: 3-D Dynamic Occupancy Mapping with Kernel Inference and Dempster-Shafer Evidential Theory
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.
- Open Access
A Gaussian Process Emulator Approach for Rapid Contaminant Characterization with an Integrated Multizone-CFD Model
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.
Open AccessA Gaussian Process Emulator Approach for Rapid Contaminant Characterization with an Integrated Multizone-CFD Model
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.