The concept of form in architectural design has been debated since prehistoric times. In its most straightforward meaning, form can be defined as the shape, shell, and inhabited volume of a structure. This study aims to explore the historical process of the transformation and evolution of form, as well as to discover new meanings and potentials of form through analysis, and to develop a critical perspective on form. The study is structured around three main axes. In the first stage, a mapping is designed to analyze the evolution of form throughout history. This mapping focuses on the changes in the approach to form, design, and making techniques chronologically. This stage reveals that form is no longer merely a final product represented by drawings or statically produced, but rather a concept that involves process and dynamism in a temporal-spatial dimension, whether in its design or production. In the second stage, the evolution of form is discussed through a new concept called ‘vital form’. While form represents something static or stationary, vital form signifies a dynamic and fluid state. While form is symbolically designed or produced by the designer from top to bottom, vital form represents a bottom-up, autonomous state formed by the influence of actors involved in design or production. Subsequently, the relationships, transitions, interactions, and changes between form and vital form, as well as their interpretations, are discussed within the proposed model in the study, based on conceptual sets derived from theoretical debates and the implications in design and making processes. It is believed that such exploration and awareness of form in architecture will bring new dimensions to the contemporary understanding, design, and making practices of form.
{"title":"Mimari Formun Evrim Anlatısı ve Canlı Form Hali","authors":"Betül UÇKAN, Pelin DURSUN, Ahsen ÖZSOY","doi":"10.53710/jcode.1325535","DOIUrl":"https://doi.org/10.53710/jcode.1325535","url":null,"abstract":"The concept of form in architectural design has been debated since prehistoric times. In its most straightforward meaning, form can be defined as the shape, shell, and inhabited volume of a structure. This study aims to explore the historical process of the transformation and evolution of form, as well as to discover new meanings and potentials of form through analysis, and to develop a critical perspective on form. The study is structured around three main axes. In the first stage, a mapping is designed to analyze the evolution of form throughout history. This mapping focuses on the changes in the approach to form, design, and making techniques chronologically. This stage reveals that form is no longer merely a final product represented by drawings or statically produced, but rather a concept that involves process and dynamism in a temporal-spatial dimension, whether in its design or production. In the second stage, the evolution of form is discussed through a new concept called ‘vital form’. While form represents something static or stationary, vital form signifies a dynamic and fluid state. While form is symbolically designed or produced by the designer from top to bottom, vital form represents a bottom-up, autonomous state formed by the influence of actors involved in design or production. Subsequently, the relationships, transitions, interactions, and changes between form and vital form, as well as their interpretations, are discussed within the proposed model in the study, based on conceptual sets derived from theoretical debates and the implications in design and making processes. It is believed that such exploration and awareness of form in architecture will bring new dimensions to the contemporary understanding, design, and making practices of form.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136278146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bu çalışmada, mekânsal artırılmış gerçeklik sunumlarında kullanılacak görselleri üretmek için mimari cephelere ilişkin genetik algoritma tabanlı bir model geliştirilmiştir. Öncelikle, mimari cepheye atıfta bulunan projeksiyon haritalama görselleri çalışma kapsamında incelenmiştir. Mimari cephelerin doluluk/boşluk ilişkisi, yapı elemanları ve 3. boyut etkisi üzerinden tanımlanabildiği görülmüştür. Bu çıkarıma dayalı olarak, cephenin mimari diline ilişkin projeksiyon haritalamalarının öncü örneklerinden birinde de kullanılan Hamburger Kunsthalle'nin cephesi çalışmada mimari cepheyi yeniden tanımlamak için kullanılmıştır. Modele dayalı görsellerin üretilmesi için genetik algoritma tabanlı bir çerçeve geliştirilmiştir. Hamburger Kunsthalle'nin yeniden tanımlanan cephesinde doluluk-boşluk ilişkisi, yapı elemanları ve 3. boyut etkisi üzerinden model sunulmuştur. Model, tanımlanan başlangıç görsel bileşenlerinden farklı görsel olasılıkların türetilmesine izin vermektedir. Tanımlanan başlangıç görsel bileşenleri, gen popülasyonunun üretilmesinde temel alınmaktadır. Seçilen mimari cepheye özgü olarak tanımlanan uygunluk fonksiyonları aracılığıyla üretilecek görsellerin belirlenmesini ve sınırlanması sağlanmaktadır. Üretilen görsellerin değerlendirme sıralamasına bağlı olarak uygun görseller seçilirken, uygun bulunmayanlar genetik işlemlerden geçirilerek gen havuzu zenginleştirilir. Bu aşamadaki değerlendirme sıralaması, döngüsel süreç içerisinde üretilecek görseller üzerinde etkili olmaktadır. Bu nedenle model kullanıcısı üretilecek görsellerde belirleyici bir role sahiptir ve kullanıcının cephenin mimari diline uygun görsel seçiminde uzman olması gerekmektedir. Bu model, genetik algoritma ve mekansal artırılmış gerçeklik kesişiminde mimari cephelerin dilini taşıyan sanal varyasyonlarını üretme ve sunma imkanı sağlamaktadır.
{"title":"Genetik algoritma aracılığıyla mimari cephelere ilişkin görsellerin üretimi için bir model","authors":"Faruk Can ÜNAL","doi":"10.53710/jcode.1340880","DOIUrl":"https://doi.org/10.53710/jcode.1340880","url":null,"abstract":"Bu çalışmada, mekânsal artırılmış gerçeklik sunumlarında kullanılacak görselleri üretmek için mimari cephelere ilişkin genetik algoritma tabanlı bir model geliştirilmiştir. Öncelikle, mimari cepheye atıfta bulunan projeksiyon haritalama görselleri çalışma kapsamında incelenmiştir. Mimari cephelerin doluluk/boşluk ilişkisi, yapı elemanları ve 3. boyut etkisi üzerinden tanımlanabildiği görülmüştür. Bu çıkarıma dayalı olarak, cephenin mimari diline ilişkin projeksiyon haritalamalarının öncü örneklerinden birinde de kullanılan Hamburger Kunsthalle'nin cephesi çalışmada mimari cepheyi yeniden tanımlamak için kullanılmıştır. Modele dayalı görsellerin üretilmesi için genetik algoritma tabanlı bir çerçeve geliştirilmiştir. Hamburger Kunsthalle'nin yeniden tanımlanan cephesinde doluluk-boşluk ilişkisi, yapı elemanları ve 3. boyut etkisi üzerinden model sunulmuştur. Model, tanımlanan başlangıç görsel bileşenlerinden farklı görsel olasılıkların türetilmesine izin vermektedir. Tanımlanan başlangıç görsel bileşenleri, gen popülasyonunun üretilmesinde temel alınmaktadır. Seçilen mimari cepheye özgü olarak tanımlanan uygunluk fonksiyonları aracılığıyla üretilecek görsellerin belirlenmesini ve sınırlanması sağlanmaktadır. Üretilen görsellerin değerlendirme sıralamasına bağlı olarak uygun görseller seçilirken, uygun bulunmayanlar genetik işlemlerden geçirilerek gen havuzu zenginleştirilir. Bu aşamadaki değerlendirme sıralaması, döngüsel süreç içerisinde üretilecek görseller üzerinde etkili olmaktadır. Bu nedenle model kullanıcısı üretilecek görsellerde belirleyici bir role sahiptir ve kullanıcının cephenin mimari diline uygun görsel seçiminde uzman olması gerekmektedir. Bu model, genetik algoritma ve mekansal artırılmış gerçeklik kesişiminde mimari cephelerin dilini taşıyan sanal varyasyonlarını üretme ve sunma imkanı sağlamaktadır.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136278002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Data-driven approaches are widely used to gain insight in urban dynamics and support urban decisions with pervasive adoption of information technologies. In the presented study, the students adopt data data-driven approaches to observe, and analyze public spaces, and make conceptual decisions for urban furniture in the context of the workshop. This workshop is developed within the scope of the Environmental Computing course. It is conducted with 27 students in Beyazıt Square as a case study area. In the scope of the study, open public spaces were observed and analyzed using data-driven approaches. Based on the analysis results, the students were expected to develop urban furniture design that would enhance user experience and activities in the area. This study questions how data-driven approaches aid in exploring public spaces and support design decisions. The objective of the study was to explore user-generated urban dynamics using multiple data and make decisions for urban furniture that augments urban dynamics. The conceptual design process of urban furniture is shaped as results of data-driven approach. The students were introduced to the Public Life Tools developed by the Gehl Institute for site observation. They were divided into particular groups and used relevant digital tracking applications to measure user activities, user profiles, and live traffic in the area. They evaluated the quality of place based on predetermined criteria by Gehl Institute. The phases of the study involve (1) the exploration of digital observation methods, (2) mapping observational, data, urban data, and locative media data in Geographic Information System (GIS), and (3) defining the relationships between the parameters affecting urban dynamics. (4) This was followed by making conceptual design decisions and (5) developing the design of urban furniture considering data analysis results. According to the findings, the use of data-driven observation and analysis methods has been effective in developing user scenarios, determining user profiles, identifying needs, and taking functional decisions in urban furniture design. Based on the students’ evaluation, the data-driven decision-making process was effective in identifying needs, problems, and potentials in the area. As the limitations of the study, the students stated that the use of digital observation methods and the learning process of GIS software were challenging. This study contributes to the field of urban computing through its conducted fieldwork.
{"title":"An Exploration of Public Open Spaces with Data Driven Approaches: A Case Study of Beyazıt Square","authors":"Gülce KIRDAR","doi":"10.53710/jcode.1325188","DOIUrl":"https://doi.org/10.53710/jcode.1325188","url":null,"abstract":"Data-driven approaches are widely used to gain insight in urban dynamics and support urban decisions with pervasive adoption of information technologies. In the presented study, the students adopt data data-driven approaches to observe, and analyze public spaces, and make conceptual decisions for urban furniture in the context of the workshop. This workshop is developed within the scope of the Environmental Computing course. It is conducted with 27 students in Beyazıt Square as a case study area. In the scope of the study, open public spaces were observed and analyzed using data-driven approaches. Based on the analysis results, the students were expected to develop urban furniture design that would enhance user experience and activities in the area. This study questions how data-driven approaches aid in exploring public spaces and support design decisions. The objective of the study was to explore user-generated urban dynamics using multiple data and make decisions for urban furniture that augments urban dynamics. The conceptual design process of urban furniture is shaped as results of data-driven approach. The students were introduced to the Public Life Tools developed by the Gehl Institute for site observation. They were divided into particular groups and used relevant digital tracking applications to measure user activities, user profiles, and live traffic in the area. They evaluated the quality of place based on predetermined criteria by Gehl Institute. The phases of the study involve (1) the exploration of digital observation methods, (2) mapping observational, data, urban data, and locative media data in Geographic Information System (GIS), and (3) defining the relationships between the parameters affecting urban dynamics. (4) This was followed by making conceptual design decisions and (5) developing the design of urban furniture considering data analysis results. According to the findings, the use of data-driven observation and analysis methods has been effective in developing user scenarios, determining user profiles, identifying needs, and taking functional decisions in urban furniture design. Based on the students’ evaluation, the data-driven decision-making process was effective in identifying needs, problems, and potentials in the area. As the limitations of the study, the students stated that the use of digital observation methods and the learning process of GIS software were challenging. This study contributes to the field of urban computing through its conducted fieldwork.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136278007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Inverse kinematics is one of the most complicated problems in robotics. The inverse kinematics calculation is the basis for any industrial robot's ability to plan and follow a trajectory. This paper proposes a hybrid algorithm, e3GSA, based on the Gravitational Search Algorithm for solving the inverse kinematics problem of an n-link redundant robot manipulator. The algorithm's efficiency was evaluated using a fitness function comprising of position error, orientation error, and collision error, and it was found to perform better than the conventional GSA algorithm in simulations. A generalised framework was proposed and tested by simulating a 6-link, 8-link and 12-link robot manipulators. Experimental validation is carried out using a 6-link robot manipulator, which shows that the simulation data are on par with the experimental data. The proposed algorithm was also found to perform adaptively with faster convergence rates and lesser computation time, making it a better choice for other engineering problems that can be transformed into optimization problems.
{"title":"Gravitation Search based Hybrid Algorithm for solving Inverse Kinematics of an <i>n</i>-link Redundant Manipulator","authors":"S A R Sheik Masthan, G Kanagaraj, F Yu Vincent","doi":"10.1093/jcde/qwad087","DOIUrl":"https://doi.org/10.1093/jcde/qwad087","url":null,"abstract":"Abstract Inverse kinematics is one of the most complicated problems in robotics. The inverse kinematics calculation is the basis for any industrial robot's ability to plan and follow a trajectory. This paper proposes a hybrid algorithm, e3GSA, based on the Gravitational Search Algorithm for solving the inverse kinematics problem of an n-link redundant robot manipulator. The algorithm's efficiency was evaluated using a fitness function comprising of position error, orientation error, and collision error, and it was found to perform better than the conventional GSA algorithm in simulations. A generalised framework was proposed and tested by simulating a 6-link, 8-link and 12-link robot manipulators. Experimental validation is carried out using a 6-link robot manipulator, which shows that the simulation data are on par with the experimental data. The proposed algorithm was also found to perform adaptively with faster convergence rates and lesser computation time, making it a better choice for other engineering problems that can be transformed into optimization problems.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135425448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Virtual try-on is a technology that enables users to preview the effect of wearing a target garment without wearing the actual garment. However, existing image-based virtual try-on methods often require additional human parsing or segmentation operations to generate intermediate representations required for garment deformation and texture fusion. These operations not only increase the computational complexity and memory consumption, but also limit the real-time and portability of virtual try-on. Additionally, inaccurate parsing results can lead to misleading final generated images. To overcome these challenges, we propose a self-supervised feature matched virtual try-on network, which can directly generate high-quality try-on results from human body images and target clothing images without any additional input. Specifically, we design an optical flow warp module, which focuses on the optical flow changes between the person image and the clothing image to achieve accurate clothing alignment and deformation. Furthermore, a feature refine warp module is designed to enhance the features of the extracted optical flow information and the original character segmentation and analysis operations, reducing the influence of background clutter features on the content, and ensuring that the wrinkles and deformation of the replacement clothes are close to the original clothes. The feature match module is developed to calculate the feature matching loss of the converted clothing and the generated results of the teacher network and the student network, and the corresponding knowledge is distilled and passed to the student network to assist in self-supervised training. We conduct experiments on the VITON dataset and show that our model can generate high quality and high resolution, and our proposed method outperforms the state-of-the-art virtual try-on methods both qualitatively and quantitatively.
{"title":"Self-supervised feature matched virtual try-on","authors":"Shiyi Jiang, Yang Xu, Danyang Li, Runze Fan","doi":"10.1093/jcde/qwad085","DOIUrl":"https://doi.org/10.1093/jcde/qwad085","url":null,"abstract":"Abstract Virtual try-on is a technology that enables users to preview the effect of wearing a target garment without wearing the actual garment. However, existing image-based virtual try-on methods often require additional human parsing or segmentation operations to generate intermediate representations required for garment deformation and texture fusion. These operations not only increase the computational complexity and memory consumption, but also limit the real-time and portability of virtual try-on. Additionally, inaccurate parsing results can lead to misleading final generated images. To overcome these challenges, we propose a self-supervised feature matched virtual try-on network, which can directly generate high-quality try-on results from human body images and target clothing images without any additional input. Specifically, we design an optical flow warp module, which focuses on the optical flow changes between the person image and the clothing image to achieve accurate clothing alignment and deformation. Furthermore, a feature refine warp module is designed to enhance the features of the extracted optical flow information and the original character segmentation and analysis operations, reducing the influence of background clutter features on the content, and ensuring that the wrinkles and deformation of the replacement clothes are close to the original clothes. The feature match module is developed to calculate the feature matching loss of the converted clothing and the generated results of the teacher network and the student network, and the corresponding knowledge is distilled and passed to the student network to assist in self-supervised training. We conduct experiments on the VITON dataset and show that our model can generate high quality and high resolution, and our proposed method outperforms the state-of-the-art virtual try-on methods both qualitatively and quantitatively.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135346615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Pareto dominance-based many-objective evolutionary algorithms (MaOEAs) face a significant challenge from many-objective problems (MaOPs). The selection pressure reduces as the number of objectives rises, while the non-dominated solution grows exponentially. Pareto dominance-based MaOEA increases the selection pressure by designing diversity-related environmental strategies. However, it still struggles to strike a good balance between population diversity and convergence. Moreover, the diversity-selection method increases the likelihood that dominance-resistant solutions (DRSs) will be chosen, which is detrimental to the performance of MaOEAs. To address the aforementioned problems, a many-objective optimization algorithm based on population preprocessing and projection distance-assisted elimination mechanism (PPEA) is proposed. In PPEA, first, the population preprocessing method is designed to lessen the negative impacts of DRSs. Second, to further improve the ability to balance population diversity and convergence of Pareto dominance-based MaOEAs, a projection distance-assisted elimination mechanism is proposed to remove the poorer individuals one by one until the population size satisfies the termination condition. The performance of PPEA was compared with seven excellent MaOEAs on a series of benchmark problems with 3–15 objectives and a real-world application problem. The experimental results indicate that PPEA is competitive and can effectively balance the diversity and convergence of the population when dealing with MaOPs.
{"title":"A many-objective evolutionary algorithm with population preprocessing and projection distance-assisted elimination mechanism","authors":"Li-sen Wei, Er-chao Li","doi":"10.1093/jcde/qwad088","DOIUrl":"https://doi.org/10.1093/jcde/qwad088","url":null,"abstract":"Abstract Pareto dominance-based many-objective evolutionary algorithms (MaOEAs) face a significant challenge from many-objective problems (MaOPs). The selection pressure reduces as the number of objectives rises, while the non-dominated solution grows exponentially. Pareto dominance-based MaOEA increases the selection pressure by designing diversity-related environmental strategies. However, it still struggles to strike a good balance between population diversity and convergence. Moreover, the diversity-selection method increases the likelihood that dominance-resistant solutions (DRSs) will be chosen, which is detrimental to the performance of MaOEAs. To address the aforementioned problems, a many-objective optimization algorithm based on population preprocessing and projection distance-assisted elimination mechanism (PPEA) is proposed. In PPEA, first, the population preprocessing method is designed to lessen the negative impacts of DRSs. Second, to further improve the ability to balance population diversity and convergence of Pareto dominance-based MaOEAs, a projection distance-assisted elimination mechanism is proposed to remove the poorer individuals one by one until the population size satisfies the termination condition. The performance of PPEA was compared with seven excellent MaOEAs on a series of benchmark problems with 3–15 objectives and a real-world application problem. The experimental results indicate that PPEA is competitive and can effectively balance the diversity and convergence of the population when dealing with MaOPs.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135639046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaokun Hu, Qiangqiang Zhao, Yitao Yang, Shaoke Wan, Yanhui Sun, Jun Hong
Abstract The rotation accuracy of a machine tool spindle is essential for ensuring the machining precision. Due to the existence of manufacturing and assembly errors, the rotation accuracy of the spindle will be inevitably impacted and degraded. Therefore, to reduce the influence of the errors and improve the work performance, this paper focuses on accuracy analysis for the spindle and a novel optimization-oriented skin model shape method to tackle this highly complex problem. First, a structural analysis of the spindle is carried out to elaborate the intractable full parallel collections in the assembly. Then, based on the iterative closest point method, the deviation propagation of the spindle considering complex full parallel collections is transformed into an optimization problem, in which the skin model shapes and small displacement torsor are utilized to represent the form and pose errors of the part, respectively. By solving the optimization problem, assembly accuracy analysis for the spindle in terms of full parallel connections and form errors is accordingly achieved. On this basis, the tolerance analysis model of the spindle is also comprehensively established by employing the corresponding error simulation. Finally, measurement experiments are conducted to validate the effectiveness of the proposed method. The experiments show the predicted rotation runout and tolerance magnitude are close to the testing results, therefore indicating the proposed method can provide effective accuracy analysis for spindles.
{"title":"Accuracy analysis for machine tool spindles considering full parallel connections and form errors based on skin model shapes","authors":"Xiaokun Hu, Qiangqiang Zhao, Yitao Yang, Shaoke Wan, Yanhui Sun, Jun Hong","doi":"10.1093/jcde/qwad086","DOIUrl":"https://doi.org/10.1093/jcde/qwad086","url":null,"abstract":"Abstract The rotation accuracy of a machine tool spindle is essential for ensuring the machining precision. Due to the existence of manufacturing and assembly errors, the rotation accuracy of the spindle will be inevitably impacted and degraded. Therefore, to reduce the influence of the errors and improve the work performance, this paper focuses on accuracy analysis for the spindle and a novel optimization-oriented skin model shape method to tackle this highly complex problem. First, a structural analysis of the spindle is carried out to elaborate the intractable full parallel collections in the assembly. Then, based on the iterative closest point method, the deviation propagation of the spindle considering complex full parallel collections is transformed into an optimization problem, in which the skin model shapes and small displacement torsor are utilized to represent the form and pose errors of the part, respectively. By solving the optimization problem, assembly accuracy analysis for the spindle in terms of full parallel connections and form errors is accordingly achieved. On this basis, the tolerance analysis model of the spindle is also comprehensively established by employing the corresponding error simulation. Finally, measurement experiments are conducted to validate the effectiveness of the proposed method. The experiments show the predicted rotation runout and tolerance magnitude are close to the testing results, therefore indicating the proposed method can provide effective accuracy analysis for spindles.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135298168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Correction to: A novel feed rate scheduling method with acc-jerk-continuity and round-off error elimination for non-uniform rational B-spline interpolation","authors":"","doi":"10.1093/jcde/qwad084","DOIUrl":"https://doi.org/10.1093/jcde/qwad084","url":null,"abstract":"","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yu Gu, Ziqian Wang, Shihao Feng, Haoran Sun, Haibo Lu, Jia Pan, F. Wan, Chaoyang Song
Legged robots are constantly evolving, and energy efficiency is a major driving factor in their design. However, combining mechanism efficiency and trajectory planning can be challenging. This work proposes a computational optimization framework for optimizing leg design during basic walking while maximizing energy efficiency. We generalize the robotic limb design as a four-bar linkage-based design pool and optimize the leg using an evolutionary algorithm. The leg configuration and design parameters are optimized based on user-defined objective functions. Our framework was validated by comparing it to measured data on our prototype quadruped robot for forward trotting. The Bennett robotic leg was advantageous for omni-directional locomotion with enhanced energy efficiency.
{"title":"Computational design towards energy efficient optimization in overconstrained robotic limbs","authors":"Yu Gu, Ziqian Wang, Shihao Feng, Haoran Sun, Haibo Lu, Jia Pan, F. Wan, Chaoyang Song","doi":"10.1093/jcde/qwad083","DOIUrl":"https://doi.org/10.1093/jcde/qwad083","url":null,"abstract":"\u0000 Legged robots are constantly evolving, and energy efficiency is a major driving factor in their design. However, combining mechanism efficiency and trajectory planning can be challenging. This work proposes a computational optimization framework for optimizing leg design during basic walking while maximizing energy efficiency. We generalize the robotic limb design as a four-bar linkage-based design pool and optimize the leg using an evolutionary algorithm. The leg configuration and design parameters are optimized based on user-defined objective functions. Our framework was validated by comparing it to measured data on our prototype quadruped robot for forward trotting. The Bennett robotic leg was advantageous for omni-directional locomotion with enhanced energy efficiency.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"35 1","pages":"1941-1956"},"PeriodicalIF":4.9,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72375551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a set of improved algorithms for recovering CAD-type surface models from 3D images. The goal of the proposed framework is to generate B-Spline or NURBS surfaces, which are standard mathematical representations of solid objects in digital engineering. To create a NURBS surface, we first compute a control network (a quadrilateral mesh) from a triangular mesh using the Marching Cubes algorithm and Discrete Morse theory. To create a NURBS surface, we first compute a triangular mesh using the Marching Cubes algorithm, then the control network (a quadrilateral mesh) is determined from the triangular mesh by using discrete Morse theory. Discrete Morse theory uses the critical points of a specific scalar field defined over the triangulation to generate a quad mesh. Such a scalar field is obtained by solving a graph Laplacian eigenproblem over the triangulation. However, the resulting surface is not optimal. We therefore introduce an optimisation algorithm to better approximate the geometry of the object. In addition, we propose a statistical method for selecting the most appropriate eigenfunction of the graph Laplacian to generate a control network that is neither too coarse nor too fine, given the precision of the 3D image. To do this, we set up a regression model and use an information criterion to choose the best surface. Finally, we extend our approach by taking into account both model and data uncertainty using probabilistic regression and sampling the posterior distribution with Hamiltonian MCMC.
{"title":"NURBS-based surface generation from 3D images: spectral construction and data-driven model selection","authors":"A. Perney, S. Bordas, P. Kerfriden","doi":"10.1093/jcde/qwad082","DOIUrl":"https://doi.org/10.1093/jcde/qwad082","url":null,"abstract":"\u0000 In this paper, we present a set of improved algorithms for recovering CAD-type surface models from 3D images. The goal of the proposed framework is to generate B-Spline or NURBS surfaces, which are standard mathematical representations of solid objects in digital engineering. To create a NURBS surface, we first compute a control network (a quadrilateral mesh) from a triangular mesh using the Marching Cubes algorithm and Discrete Morse theory. To create a NURBS surface, we first compute a triangular mesh using the Marching Cubes algorithm, then the control network (a quadrilateral mesh) is determined from the triangular mesh by using discrete Morse theory. Discrete Morse theory uses the critical points of a specific scalar field defined over the triangulation to generate a quad mesh. Such a scalar field is obtained by solving a graph Laplacian eigenproblem over the triangulation. However, the resulting surface is not optimal. We therefore introduce an optimisation algorithm to better approximate the geometry of the object. In addition, we propose a statistical method for selecting the most appropriate eigenfunction of the graph Laplacian to generate a control network that is neither too coarse nor too fine, given the precision of the 3D image. To do this, we set up a regression model and use an information criterion to choose the best surface. Finally, we extend our approach by taking into account both model and data uncertainty using probabilistic regression and sampling the posterior distribution with Hamiltonian MCMC.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":"4 1","pages":"1856-1867"},"PeriodicalIF":4.9,"publicationDate":"2023-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75268052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：