Makoto Ohsaki

dblp:23/1625 · DBLP profile ↗
← Back
14ranked-venue papers
0as first author
8since 2021 · last 2026
0000-0003-4935-8874ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021
YearPublicationVenuePosition
2026 A unified evaluation framework for reinforcement learning paradigms in bi-objective truss optimization
Chi-tathon Kupwiwat, Makoto Ohsaki
Adv. Eng. Informatics2
2026 Erratum to "A unified evaluation framework for reinforcement learning paradigms in bi-objective truss optimization" [Adv. Eng. Inform. 74(Part C) (2026) 104750, ISSN 1474-0346]
Chi-tathon Kupwiwat, Makoto Ohsaki
Adv. Eng. Informatics2
2025 Hierarchical graph-based machine learning model for optimization of three-dimensional braced steel frame
Chi-tathon Kupwiwat, Kazuki Hayashi, Makoto Ohsaki
Eng. Appl. Artif. Intell.3
2024 Multi-objective optimization of truss structure using multi-agent reinforcement learning and graph representation
Chi-tathon Kupwiwat, Kazuki Hayashi, Makoto Ohsaki
Eng. Appl. Artif. Intell.3
2023 Deep deterministic policy gradient and graph attention network for geometry optimization of latticed shells
Chi-tathon Kupwiwat, Kazuki Hayashi, Makoto Ohsaki
Appl. Intell.3
2023 Mean curvature flow for generating discrete surfaces with piecewise constant mean curvatures
abstract
Piecewise constant mean curvature (P-CMC) surfaces are generated using the mean curvature flow (MCF). As an extension of the known fact that a CMC surface is the stationary point of an energy functional, a P-CMC surface can be obtained as the stationary point of an energy functional of multiple patch surfaces and auxiliary surfaces between them. A new formulation is presented for the MCF as the negative gradient flow of the energy functional for multiple patch continuous surfaces, which are further discretized so as to determine the change in the vertex positions of triangular meshes on the surface as well as along the internal boundaries between patches. Numerical examples show that multiple patch surfaces approximately reach the specified mean curvatures through the proposed method, which can diversify the options for the shape design using CMC surfaces.
Kazuki Hayashi, Yoshiki Jikumaru, Makoto Ohsaki, Takashi Kagaya, Yohei Yokosuka
Comput. Aided Geom. Des.3
2022 Graph-based reinforcement learning for discrete cross-section optimization of planar steel frames
abstract
A combined method of graph embedding (GE) and reinforcement learning (RL) is developed for discrete cross-section optimization of planar steel frames, in which the section size of each member is selected from a prescribed list of standard sections. The RL agent aims to minimize the total structural volume under various practical constraints. GE is a method for extracting features from data with irregular connectivity. While most of the existing GE methods aim at extracting node features, an improved GE formulation is developed for extracting features of edges associated with members in this study. Owing to the proposed GE operations, the agent is capable of grasping the structural property of columns and beams considering their connectivity in a frame with an arbitrary size as feature vectors of the same size. Using the feature vectors, the agent is trained to estimate the accurate return associated with each action and to take proper actions on which members to reduce or increase their size using an RL algorithm. The applicability of the proposed method is versatile because various frames different in the numbers of nodes and members can be used for both training and application phases. In the numerical examples, the trained agents outperform a particle swarm optimization method as a benchmark in terms of both computational cost and design quality for cross-sectional design changes; the agents successfully assign reasonable cross-sections considering the geometry, connectivity, and support and load conditions of the frames.
Kazuki Hayashi, Makoto Ohsaki
Adv. Eng. Informatics2
2021 Discrete Gaussian Curvature Flow for Piecewise Constant Gaussian Curvature Surface
abstract
A method is presented for generating a discrete piecewise constant Gaussian curvature (CGC) surface. An energy functional is first formulated so that its stationary point is the linear Weingarten (LW) surface, which has a property such that the weighted sum of mean and Gaussian curvatures is constant. The CGC surface is obtained using the gradient derived from the first variation of a special type of the energy functional of the LW surface and updating the surface shape based on the Gaussian curvature flow. A filtering method is incorporated to prevent oscillation and divergence due to unstable property of the discretized Gaussian curvature flow. Two techniques are proposed to generate a discrete piecewise CGC surface with preassigned internal boundaries. The step length of Gaussian curvature flow is adjusted by introducing a line search algorithm to minimize the energy functional. The effectiveness of the proposed method is demonstrated through numerical examples of generating various shapes of CGC surfaces.
Kazuki Hayashi, Yoshiki Jikumaru, Makoto Ohsaki, Takashi Kagaya, Yohei Yokosuka
Comput. Aided Des.3
2008 Enumerating Constrained Non-crossing Minimally Rigid Frameworks
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Discret. Comput. Geom.3
2007 Triangulating a convex polygon with fewer number of non-standard bars
Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
Theor. Comput. Sci.4
2006 Enumerating Non-crossing Minimally Rigid Frameworks
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
COCOON3
2005 Triangulating a Convex Polygon with Small Number of Non-standard Bars
Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
COCOON4
2002 Approximating uniform triangular meshes in polygons
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
Theor. Comput. Sci.4
2000 Approximating Uniform Triangular Meshes in Polygons
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
COCOON4