Yiyang Jia

Prof. Dr. Yiyang Jia

Department of Information Systems, Tokyo City University, Tokyo, Japan
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
30 May 2021
Verified
Conference Paper
Closed access
LZLifeng Zhu
Lifeng Zhu
SYShuai Yao
Shuai Yao
BLBoyang Li
Boyang Li
ASAiguo Song
Aiguo Song
YJYiyang Jia
Yiyang Jia
JMJun Mitani
Jun Mitani
Conventional coverage path planning algorithms are mainly based on the zigzag and spiral patterns or their combinations. The traversal order is limited by the linear or inside-outside manner. We propose a new set of coverage patterns induced from geometric folding operations, called the geometric folding pattern, to make coverage paths with more flexible traversal order. We study the modeling and parameterization of the geometric folding patterns. Then, a sampling operator is introduced. Based on the computational tools, we demonstrate the application of the proposed patterns in designing coverage paths. We show that the simple geometric folding patterns are flexible and controllable, which enables more choices for the coverage path planning problem.

10 March 2025 in Axioms
Verified
Journal Article
Open access
PDF file
YJYiyang Jia
Yiyang Jia
GPGuohong Peng
Guohong Peng
ZYZheng Yang
Zheng Yang
TCTianhao Chen
Tianhao Chen
In this survey, we provide an overview of category theory-derived machine learning from four mainstream perspectives: gradient-based learning, probability-based learning, invariance and equivalence-based learning, and topos-based learning. For the first three topics, we primarily review research in the past five years, updating and expanding on the previous survey by Shiebler et al. The fourth topic, which delves into higher category theory, particularly topos theory, is surveyed for the first time in this paper. In certain machine learning methods, the compositionality of functors plays a vital role, prompting the development of specific categorical frameworks. However, when considering how the global properties of a network reflect in local structures and how geometric properties and semantics are expressed with logic, the topos structure becomes particularly significant and profound.

25 July 2022 in Journal of Computational Design and Engineering
Verified
Journal Article
Open access
PDF file
YZYan Zhao
Yan Zhao
YWYinglei Wei
Yinglei Wei
YJYiyang Jia
Yiyang Jia
SLShiling Li
Shiling Li
MZMingyue Zhang
Mingyue Zhang
JMJun Mitani
Jun Mitani
Origami tessellations have shown the potential to be utilized for approximating curved target surfaces by folding a set of elemental units. As those units are in partially folded states, the origami approximation captures the outline of the target while demonstrating a corrugated surface. In this paper, we focus on the cylindrical surface and propose a method for constructing its discrete version via square or rectangular units with crease patterns inspired by the waterbomb tessellation. We unify the unit size through optimization to realize cost-efficient constructions. Three-dimensional curved structures are deployed by folding collinear creases between adjacent rows of units and the other creases in each row are remained unfolded. The deployed structure can still be folded to a compact state by folding all creases. To flexibly approximate the outline of the target surface, we analyse relationships between the width and height of the rectangular unit and utilize variations of the waterbomb tessellation to control the region of the origami structure when fully folded. The proposed method provides a novel solution to the so-called inverse-origami-design problem for generating foldable cylindrical surfaces using unfolded waterbomb origami units.

1 January 2020 in Journal of Information Processing
Verified
Journal Article
Closed access
PDF file
YJYiyang Jia
Yiyang Jia
JMJun Mitani
Jun Mitani
RURyuhei Uehara
Ryuhei Uehara
In this work, we consider a decision problem on whether an overlapping order of all the squares of an m × n map is valid under a particular context called simple folding. This problem belongs to the field of map folding. It is a variation of both the decision problem of valid orders of a 1 × n map under the context of simple folds and the decision problem of valid orders of an m × n map under the context of general folds. We provide a method and its corresponding linear-time algorithm to solve this problem, which is based on the construction of a directed graph representing the adjacency relations among squares.

1 September 2021 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Closed access
PDF file
YJYiyang Jia
Yiyang Jia
JMJun Mitani
Jun Mitani
RURyuhei Uehara
Ryuhei Uehara
Folding an m × n square grid pattern along the edges of a grid is called map folding. We consider a decision problem in terms of whether a partial overlapping order of the squares aligning on the boundary of an m × n map is valid in a particular fold model called simple fold. This is a variation of the decision problem of valid total orders of the map in a simple fold model. We provide a linear-time algorithm to solve this problem, by defining an equivalence relation and computing the folding sequence sequentially, either uniquely or representatively.

13 December 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YJYiyang Jia
Yiyang Jia
JMJun Mitani
Jun Mitani
In this paper, we compare the performance of three different folding models when they are applied to three different map folding settings. Precisely, the three folding models include the simple folding model, the simple folding–unfolding model, and the general folding model. The different map folding settings are discussed by comparing different folded states, i.e., different overlapping orders on the set of the squares of 1 × n maps, the squares of m × n maps, and the squares lying on the boundary of m × n maps. These folding models are abstracts of manual works and robotics. We clarify the relationship between their reachable final folded states under different settings and give proof of all the inclusion relationships between every two of these sets. In addition, there are nine distinct problems with the three folding models applied to three folding settings. We give the optimal linear time solutions to all the unsolved ones: the valid total overlapping order problems of 1 × n maps, m × n maps, as well as the valid boundary overlapping order problems of m × n maps with the three different folding models. Our work gives the conclusion of the research field where the folding models and the overlapping orders of map folding are concerned.