Myoungkuk Park

Prof. Myoungkuk Park

Michigan Technological University, Houghton, Michigan, USA
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
20 November 2011 in Journal of Mechanical Science and Technology
Verified
Journal Article
Closed access
PDF file
WCWoojin Chung
Woojin Chung
MPMyoungkuk Park
Myoungkuk Park
KYKwanghyun Yoo
Kwanghyun Yoo
JRJae Il Roh
Jae Il Roh
JCJongsuk Choi
Jongsuk Choi

1 January 2004
Verified
Conference Paper
Closed access
MPMyoungkuk Park
Myoungkuk Park
WCWoojin Chung
Woojin Chung
MKMunsang Kim
Munsang Kim
JSJaebok Song
Jaebok Song
A mobile service robot can achieve reconfigurability by exploiting passive trailer systems. Reconfigurability provides significant practical advantages in order to deal with various service tasks. However, a motion control problem of a passive multiple trailer system is difficult, mainly because a kinematic model is highly nonlinear. It is shown how a robot with n passive trailers can be controlled in backward direction. Once a desired trajectory of a last trailer is computed, then the control input of a pushing robot is obtained by the proposed control scheme. A kinematic design of a trailer system is proposed in our prior work. It is shown that the high performance of trajectory tracking is also valid for the backward motion control problem. Experimental verifications were carried out with the PSR-2 (public service robot) with three passive trailers. Experimental result showed that the backward motion control could be successfully carried out using the proposed control scheme.

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.

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.

25 November 2023 in Machines
Verified
Journal Article
Open access
PDF file
KVKonchanok Vorasawad
Konchanok Vorasawad
MPMyoungkuk Park
Myoungkuk Park
CKChangwon Kim
Changwon Kim
The rise of smart factories and warehouses has ushered in an era of intelligent manufacturing, with autonomous robots playing a pivotal role. This study focuses on improving the navigation and control of autonomous forklifts in warehouse environments. It introduces an innovative approach that combines a modified Linear Segment with Parabolic Blends (LSPB) trajectory planning with Model Predictive Control (MPC) to ensure efficient and secure robot movement. To validate the performance of our proposed path-planning method, MATLAB-based simulations were conducted in various scenarios, including rectangular and warehouse-like environments, to demonstrate the feasibility and effectiveness of the proposed method. The results demonstrated the feasibility of employing Mecanum wheel-based robots in automated warehouses. Also, to show the superiority of the proposed control algorithm performance, the navigation results were compared with the performance of a system using the PID control as a lower-level controller. By offering an optimized path-planning approach, our study enhances the operational efficiency and effectiveness of Mecanum wheel robots in real-world applications such as automated warehousing systems.

13 June 2023 in Robotics
Verified
Journal Article
Open access
PDF file
APAbhishek Patil
Abhishek Patil
MPMyoungkuk Park
Myoungkuk Park
JBJungyun Bae
Jungyun Bae
This paper proposes an algorithm that provides operational strategies for multiple tethered autonomous underwater vehicle (T-AUV) systems for entanglement-free navigation. T-AUVs can perform underwater tasks under reliable communication and power supply, which is the most substantial benefit of their operation. Thus, if one can overcome the entanglement issues while utilizing multiple tethered vehicles, the potential applications of the system increase including ecosystem exploration, infrastructure inspection, maintenance, search and rescue, underwater construction, and surveillance. In this study, we focus on developing strategies for task allocation, path planning, and scheduling that ensure entanglement-free operations while considering workload balancing among the vehicles. We do not impose restrictions on the size or shape of the vehicles at this stage; our primary focus is on efficient tether management as an initial work on the topic. To achieve entanglement-free navigation, we propose a heuristic based on the primal-dual technique, which enables initial task allocation and path planning while minimizing the maximum travel cost of the vehicles. Although this heuristic often generates sectioned paths due to its workload-balancing nature, we also propose a mixed approach to provide feasible solutions for non-sectioned initial paths. This approach combines entanglement avoidance techniques with time scheduling and sectionalization methods. To evaluate the effectiveness of our algorithm, extensive simulations were conducted with varying problem sizes. The computational results demonstrate the potential of our algorithm to be applied in real-time operations, as it consistently generates reliable solutions within a reasonable time frame.