JLJyh-Ming Lien

Jyh-Ming Lien

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jyh-Ming Lien has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Improving Human-Robot Collaboration via Computational Design

    by Jixuan Zhi, Jyh-Ming Lien

    When robots enter our day-to-day lives, the shared space surrounding humans and robots is critical for facilitating Human-Robot collaboration. The design of shared space should satisfy humans' preferences and robots' efficiency. This work uses the kitchen as an example to illustrate the importance of good space designs in enhancing collaboration. Given the kitchen boundary, food stations, counters, and recipes, the proposed method determines the optimal placement of stations and counters that meet the requirements of kitchen design rules and improve performance. The key technical challenge is that the optimization method usually evaluates thousands of designs, and each evaluation analyzes the traffic flow of the space, which must solve many motion planning problems. To address this technical challenge, we use a decentralized motion planner that can solve multi-agent motion planning efficiently. Our results indicate that optimized kitchen designs can provide noticeable performance improvement to Human-Robot collaboration.


  • Open Access

    Zygote structure enables pluripotent shape-transforming deployable structure

    by Yu-Ki Lee, Yue Hao, Zhonghua Xi, Woongbae Kim, Youngmin Park, Kyu-Jin Cho, Jyh-Ming Lien, In-Suk Choi

    We propose an algorithmic framework of a pluripotent structure evolving from a simple compact structure into diverse complex 3D structures for designing the shape-transformable, reconfigurable, and deployable structures and robots. Our algorithmic approach suggests a way of transforming a compact structure consisting of uniform building blocks into a large, desired 3D shape. Analogous to a fertilized egg cell that can grow into a preprogrammed shape according to coded information, compactly stacked panels named the zygote structure can evolve into arbitrary 3D structures by programming their connection path. Our stacking algorithm obtains this coded sequence by inversely stacking the voxelized surface of the desired structure into a tree. Applying the connection path obtained by the stacking algorithm, the compactly stacked panels named the zygote structure can be deployed into diverse large 3D structures. We conceptually demonstrated our pluripotent evolving structure by energy-releasing commercial spring hinges and thermally actuated shape memory alloy hinges, respectively. We also show that the proposed concept enables the fabrication of large structures in a significantly smaller workspace.


  • Open Access

    Origami-based Zygote structure enables pluripotent shape-transforming deployable structure

    by Yu-Ki Lee, Yue Hao, Zhonghua Xi, Woongbae Kim, Youngmin Park, Kyu-Jin Cho, Jyh-Ming Lien, In-Suk Choi

    We propose an algorithmic framework of a pluripotent structure evolving from a simple compact structure into diverse complex 3-D structures for designing the shape transformable, reconfigurable, and deployable structures and robots. Our algorithmic approach suggests a way of transforming a compact structure consisting of uniform building blocks into a large, desired 3-D shape. Analogous to the pluripotent stem cells that can grow into a preprogrammed shape according to coded information, which we call DNA, compactly stacked panels named the zygote structure can evolve into arbitrary 3-D structures by programming their connection path. Our stacking algorithm obtains this coded sequence by inversely stacking the voxelized surface of the desired structure into a tree. Applying the connection path obtained by the stacking algorithm, the compactly stacked panels named the zygote structure can be deployed into diverse large 3-D structures. We conceptually demonstrated our pluripotent evolving structure by energy releasing commercial spring hinges and thermally actuated shape memory alloy (SMA) hinges, respectively. We also show that the proposed concept enables the fabrication of large structures in a significantly smaller workspace.

  • Designing Human-Robot Coexistence Space

    by Jixuan Zhi, Lap-Fai Yu, Jyh-Ming Lien

    When the human-robot interactions become ubiquitous, the environment surrounding these interactions will have significant impact on the safety and comfort of the human and the effectiveness and efficiency of the robot. Although most robots are designed to work in the spaces created for humans, many environments, such as living rooms and offices, can be and should be redesigned to enhance and improve human-robot collaboration and interactions. This letter uses autonomous wheelchair as an example and investigates the computational design in the human-robot coexistence spaces. Given the room size and the objects O in the room, the proposed framework computes the optimal layouts of O that satisfy both human preferences and navigation constraints of the wheelchair. The key enabling technique is a motion planner that can efficiently evaluate hundreds of similar motion planning problems. Our implementation shows that the proposed framework can produce a design around three to five minutes on average comparing to 10 to 20 minutes without the proposed motion planner. Our results also show that the proposed method produces reasonable designs even for tight spaces and for users with different preferences.


  • Learning to Herd Agents Amongst Obstacles: Training Robust Shepherding Behaviors Using Deep Reinforcement Learning

    by Jixuan Zhi, Jyh-Ming Lien

    Robotic shepherding problem considers the control and navigation of a group of coherent agents (e.g., a flock of bird or a fleet of drones) through the motion of an external robot, called shepherd. Machine learning based methods have successfully solved this problem in an environment with no obstacles. Rule-based methods, on the other hand, can handle more complex scenarios in which environments are cluttered with obstacles and allow multiple shepherds to work collaboratively. However, these rule-based methods are fragile due to the difficulty in defining a comprehensive set of behavioral rules. To overcome these limitations, we propose the first known learning-based method that can herd agents amongst obstacles. By using deep reinforcement learning techniques combined with the probabilistic roadmaps, we train a shepherding model using noisy but controlled environmental and behavioral parameters. Our experimental results show that the trained shepherding controller is robust, namely, it is insensitive to the uncertainties originated from both environmental and behavioral models. Consequently, the proposed method has a higher success rate, shorter completion time and path length than the rule-based behavioral methods have. These advantages are particularly prominent in more challenging scenarios involving more difficult groups and strenuous passages.


  • Persistent Covering With Latency and Energy Constraints

    by Jyh-Ming Lien, Samuel Rodriguez, Marco Morales

    Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limited battery power and long charging time. Thus, they cannot accomplish some practical tasks such as providing service to cover an area for an extended time, also known as persistent covering. Algorithmic approaches are limited mostly due to the computational complexity and intractability of the problem. Approximation algorithms that assume unlimited energy have been considered to segment a large area into smaller cells that require periodic visits under the latency constraints. In this letter, we explore geometric and topological properties that allow us to significantly reduce the size of the optimization problem. Consequently, the proposed method can efficiently determine the minimum number of UAVs needed and schedule their routes to cover an area persistently. We experimentally demonstrate that the proposed algorithm has better performance than the baseline.


  • Open Access

    Computational wrapping: A universal method to wrap 3D-curved surfaces with nonstretchable materials for conformal devices

    by Yu-Ki Lee, Zhonghua Xi, Young-Joo Lee, Yun-Hyeong Kim, Yue Hao, Hongjin Choi, Myoung-Gyu Lee, Young-Chang Joo, Changsoon Kim, Jyh-Ming Lien, et al.

    Computational wrapping provides a universal method to wrap arbitrary curved 3D shapes with 2D-based brittle materials.


  • Compacting Voxelized Polyhedra via Tree Stacking

    by Yue Hao, Jyh‐Ming Lien

    Volume compaction is a geometric problem that aims to reduce the volume of a polyhedron via shape transform. Compactable structures are easier to transport and in some cases easier to manufacture, therefore, they are commonly found in our daily life (e.g. collapsible containers) and advanced technology industries (e.g., the recent launch of 60 Starlink satellites compacted in a single rocket by SpaceX). It is known in the literature that finding a universal solution to compact an arbitrary 3D shape is computationally challenging. Previous approaches showed that stripifying mesh surface can lead to optimal compaction, but the resulting structures were often impractical. In this paper, we propose an algorithm that cuts the 3D orthogonal polyhedron, tessellated by thick square panels, into a tree structure that can be transformed into compact piles by folding and stacking. We call this process tree stacking. Our research found that it is possible to decompose the problem into a pipeline of several solvable local optimizations. We also provide an efficient algorithm to check if the solution exists by avoiding the computational bottleneck of the pipeline. Our results show that tree stacking can efficiently generate stackable structures that have better folding accuracy and similar compactness comparing to the most compact stacking using strips.


  • Computing 3-D From-Region Visibility Using Visibility Integrity

    by Jixuan Zhi, Yue Hao, Christopher Vo, Marco Morales, Jyh-Ming Lien

    Visibility integrity (VI) is a measurement of similarity between the visibilities of regions. VI can be used to approximate the visibility of moving regions, called group visibility. It has been shown that computing visibility integrity using agglomerative clustering takes O(n^4 log n) for n samples. In this paper, we present a method that speeds up the computation of visibility integrity and reduces the time complexity from O(n^4 log n) to O(n^2). Based on the idea of visibility integrity, we show that, for the first time, the visibilityintegrity roadmap (VIR), a data structure that partitions a space into zones, can be calculated efficiently in 3D. In addition, we will demonstrate through the application of VIR to solve group visibility and group following problems in 3D. More specifically, we offer two different offline approaches, a naive and a kernelbased, to compute the VIR. We propose the planning algorithms for the camera to maintain visibility of group targets by querying the VIR. We evaluate the methods in different 3D simulation environments and compare the operation of the VIR and other planning methods.


  • Open Access

    Computational paper wrapping transforms non-stretchable 2D devices into wearable and conformable 3D devices

    by Yu-Ki Lee, Zhonghua Xi, Young-Joo Lee, Yun-Hyeong Kim, Yue Hao, Young-Chang Joo, Changsoon Kim, Jyh-Ming Lien, In-Suk Choi

    This study starts from the counter-intuitive question of how we can render a conventional stiff, non-stretchable and even brittle material conformable so that it can fully wrap around a curved surface, such as a sphere, without failure. Here, we answer this conundrum by extending geometrical design in computational kirigami (paper cutting and folding) to paper wrapping. Our computational paper wrapping-based approach provides the more robust and reliable fabrication of conformal devices than paper folding approaches. This in turn leads to a significant increase in the applicability of computational kirigami to real-world fabrication. This new computer-aided design transforms 2D-based conventional materials, such as Si and copper, into a variety of targeted conformal structures that can fully wrap the desired 3D structure without plastic deformation or fracture. We further demonstrated that our novel approach enables a pluripotent design platform to transform conventional non-stretchable 2D-based devices, such as electroluminescent lighting and a paper battery, into wearable and conformable 3D curved devices.