Soojeong Hyeon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Soojeong Hyeon has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hyungbo Shim
Department of Electrical and Computer Engineering, ASRI, Seoul National University, Seoul, South Korea
2 shared publications - DongKi Noh
Advanced Robotics Laboratory, CTO Division, LG Electronics Inc., Seoul, Republic of Korea
1 shared publication - Hyuntae Kim
Department of Engineering Science, University of Oxford, Oxford, UK
1 shared publication - Jiyeon Nam
ASRI, Department of Electrical and Computer Engineering, Seoul National University, Seoul, Republic of Korea
1 shared publication - Youngjun Joo
Department of Electrical Engineering and Institute of Advanced Materials and Systems, Sookmyung Women’s University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 115167-115177
Data-Driven Displacement-Based Formation Control With Range-Only Measurements
This paper proposes an algorithm to coordinate a displacement-based formation of a multi-agent system when their local frames are not aligned. Agents can measure neither the relative positions nor orientations, but only the range (distance) to their neighbors. We demonstrate that persistently exciting data exchanged between two agents can be used to infer relative positions and orientations. In the proposed method, we address discrete-time distributed orientation estimation based on an averaging consensus protocol. An asymptotic stability analysis of the desired formation shape is presented and the proposed strategy is validated through simulation results.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 115167-115177
Open AccessData-Driven Displacement-Based Formation Control With Range-Only Measurements
This paper proposes an algorithm to coordinate a displacement-based formation of a multi-agent system when their local frames are not aligned. Agents can measure neither the relative positions nor orientations, but only the range (distance) to their neighbors. We demonstrate that persistently exciting data exchanged between two agents can be used to infer relative positions and orientations. In the proposed method, we address discrete-time distributed orientation estimation based on an averaging consensus protocol. An asymptotic stability analysis of the desired formation shape is presented and the proposed strategy is validated through simulation results.
- 30 November 2023
- Published by Institute of Control, Robotics and Systems in Journal of Institute of Control, Robotics and Systems
- Vol. 29 (11) , 880-886
Distributed Estimation of the Geometric Center of Multi-target by a Group of Agents With Bearing Measurements
This paper presents a distributed estimation scheme for determining the geometric center of multiple targets by a group of agents in 2-dimensional space. These agents have the knowledge of bearing measurements to a part of the targets and communicate with each other. Specifically, we utilize a continuous-time dynamics with strong coupling among agents to process local information. This approach allows us to assign the equilibrium point of the dynamics describing collective behavior of the agents to the geometric center of the targets. The benefits of this approach include: (i) no initialization process is required and (ii) global information, such as the numbers of targets and agents, is not required. These properties make the proposed estimation method suitable for plug-and-play operation.
- 30 November 2023
- Published by Institute of Control, Robotics and Systems in Journal of Institute of Control, Robotics and Systems
- Vol. 29 (11) , 880-886
Distributed Estimation of the Geometric Center of Multi-target by a Group of Agents With Bearing Measurements
This paper presents a distributed estimation scheme for determining the geometric center of multiple targets by a group of agents in 2-dimensional space. These agents have the knowledge of bearing measurements to a part of the targets and communicate with each other. Specifically, we utilize a continuous-time dynamics with strong coupling among agents to process local information. This approach allows us to assign the equilibrium point of the dynamics describing collective behavior of the agents to the geometric center of the targets. The benefits of this approach include: (i) no initialization process is required and (ii) global information, such as the numbers of targets and agents, is not required. These properties make the proposed estimation method suitable for plug-and-play operation.
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (1) , 723-730
Spectral Trade-Off for Measurement Sparsification of Pose-Graph SLAM
In this letter, we propose a trade-off optimization algorithm to compute an appropriate number of edges for measurement (edge) sparsification in pose-graph simultaneous localization and mapping (SLAM). The greater the amount of measurement data, the larger is the computational burden. To reduce computational burden, one can remove a portion of measurements. However, reliable data, such as odometric measurements, can be lost if measurements are removed without any principle. To remove measurements which is redundant, we propose a trade-off optimization algorithm between maximization of the Fiedler value and minimization of the largest eigenvalue of adjacency matrix for measurement graph. This problem formulation gives virtues twofold. First, it is scalable. For any dataset, when a weight for trade-off is given, this algorithm determines the appropriate number of edges since this is a trade-off optimization problem. Second, the edges of the measurement graph can be distributed evenly. The algorithm considers the minimization of the largest eigenvalue of the adjacency matrix, so it suppresses the upper bound of the maximum degree of the measurement graph. It removes the redundant information concentrated on a few nodes, and improves the estimation accuracy of the sparsified graph. To validate the performance of the proposed trade-off optimization algorithm, we apply our approach to CSAIL, Intel, and Manhattan datasets.
- 29 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (1) , 723-730
Spectral Trade-Off for Measurement Sparsification of Pose-Graph SLAM
In this letter, we propose a trade-off optimization algorithm to compute an appropriate number of edges for measurement (edge) sparsification in pose-graph simultaneous localization and mapping (SLAM). The greater the amount of measurement data, the larger is the computational burden. To reduce computational burden, one can remove a portion of measurements. However, reliable data, such as odometric measurements, can be lost if measurements are removed without any principle. To remove measurements which is redundant, we propose a trade-off optimization algorithm between maximization of the Fiedler value and minimization of the largest eigenvalue of adjacency matrix for measurement graph. This problem formulation gives virtues twofold. First, it is scalable. For any dataset, when a weight for trade-off is given, this algorithm determines the appropriate number of edges since this is a trade-off optimization problem. Second, the edges of the measurement graph can be distributed evenly. The algorithm considers the minimization of the largest eigenvalue of the adjacency matrix, so it suppresses the upper bound of the maximum degree of the measurement graph. It removes the redundant information concentrated on a few nodes, and improves the estimation accuracy of the sparsified graph. To validate the performance of the proposed trade-off optimization algorithm, we apply our approach to CSAIL, Intel, and Manhattan datasets.