Jungyun Bae

Dr. Jungyun Bae

Michigan Technological University, Houghton, Michigan, USA
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
7 June 2017 in International Journal of Precision Engineering and Manufacturing
Verified
Journal Article
Closed access
PDF file
JBJungyun Bae
Jungyun Bae
WCWoojin Chung
Woojin Chung

26 November 2018 in International Journal of Precision Engineering and Manufacturing
Verified
Journal Article
Closed access
PDF file
JBJungyun Bae
Jungyun Bae
WCWoojin Chung
Woojin Chung

18 March 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
JBJungyun Bae
Jungyun Bae
MPMyoungkuk Park
Myoungkuk Park
The letter deals with a path planning problem that commonly arises in many applications involving multiple heterogeneous robots called a Multiple Depot Heterogeneous Traveling Salesman Problem (MDHTSP). Specifically, the authors seek to provide good quality of feasible solutions for a path planning problem for a given set of structurally heterogeneous mobile robots located in distinctive depots and a set of targets to visit while minimizing the maximum travel cost (min-max). A solution for MDHTSP with min-max objectives is in great demand for many applications, such as transportation and surveillance, because it is directly related to a significant reduction in the mission completion time. However, no reliable algorithm running in a reasonable computation time has been published for this specific problem. As an extension of our preliminary research on two heterogeneous robots, this letter presents a heuristic approach based on a primal-dual technique for the problem while focusing on the target assignment. The computational results of the implementation verify that the proposed algorithm produces a good quality of feasible solution within a relatively short computation time.

27 October 2010 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
JBJungyun Bae
Jungyun Bae
SRSivakumar Rathinam
Sivakumar Rathinam

28 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
APAbhishek Patil
Abhishek Patil
JBJungyun Bae
Jungyun Bae
MPMyoungkuk Park
Myoungkuk Park
This paper proposes an algorithm that provides operational strategies for multiple heterogeneous mobile robot systems utilized in many real-world applications, such as deliveries, surveillance, search and rescue, monitoring, and transportation. Specifically, the authors focus on developing an algorithm that solves a min–max multiple depot heterogeneous asymmetric traveling salesperson problem (MDHATSP). The algorithm is designed based on a primal–dual technique to operate given multiple heterogeneous robots located at distinctive depots by finding a tour for each robot such that all the given targets are visited by at least one robot while minimizing the last task completion time. Building on existing work, the newly developed algorithm can solve more generalized problems, including asymmetric cost problems with a min–max objective. Though producing optimal solutions requires high computational loads, the authors aim to find reasonable sub-optimal solutions within a short computation time. The algorithm was repeatedly tested in a simulation with varying problem sizes to verify its effectiveness. The computational results show that the algorithm can produce reliable solutions to apply in real-time operations within a reasonable time.

1 May 2019
Verified
Conference Paper
Closed access
JBJungyun Bae
Jungyun Bae
JLJungho Lee
Jungho Lee
WCWoojin Chung
Woojin Chung