Pub Date : 2023-12-20DOI: 10.3390/computation12010001
Junlong Zheng, C. Jettanasen, P. Chiradeja
Our research focused on an optimization algorithm. Our work makes three contributions. First, a new optimization algorithm, the Maritime Search and Rescue Algorithm (MSRA), is creatively proposed. The algorithm not only has better optimization performance, but also has the ability to plan the path to the best site. For other existing intelligent optimization algorithms, it has never been found that they have both of these performances. Second, the mathematical model of the MSRA was established, and the computer program pseudo-code was created. Third, the MSRA was verified by experiments.
{"title":"Performance and Application Analysis of a New Optimization Algorithm","authors":"Junlong Zheng, C. Jettanasen, P. Chiradeja","doi":"10.3390/computation12010001","DOIUrl":"https://doi.org/10.3390/computation12010001","url":null,"abstract":"Our research focused on an optimization algorithm. Our work makes three contributions. First, a new optimization algorithm, the Maritime Search and Rescue Algorithm (MSRA), is creatively proposed. The algorithm not only has better optimization performance, but also has the ability to plan the path to the best site. For other existing intelligent optimization algorithms, it has never been found that they have both of these performances. Second, the mathematical model of the MSRA was established, and the computer program pseudo-code was created. Third, the MSRA was verified by experiments.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"15 5","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138954973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-16DOI: 10.3390/computation11120255
S. Brogi, Ilaria Guarino, L. Flori, Hajar Sirous, Vincenzo Calderone
In this study, we applied a computer-based protocol to identify novel antioxidant agents that can reduce oxidative stress (OxS), which is one of the main hallmarks of several disorders, including cancer, cardiovascular disease, and neurodegenerative disorders. Accordingly, the identification of novel and safe agents, particularly natural products, could represent a valuable strategy to prevent and slow down the cellular damage caused by OxS. Employing two chemical libraries that were properly prepared and enclosing both natural products and world-approved and investigational drugs, we performed a high-throughput docking campaign to identify potential compounds that were able to target the KEAP1 protein. This protein is the main cellular component, along with NRF2, that is involved in the activation of the antioxidant cellular pathway. Furthermore, several post-search filtering approaches were applied to improve the reliability of the computational protocol, such as the evaluation of ligand binding energies and the assessment of the ADMET profile, to provide a final set of compounds that were evaluated by molecular dynamics studies for their binding stability. By following the screening protocol mentioned above, we identified a few undisclosed natural products and drugs that showed great promise as antioxidant agents. Considering the natural products, isoxanthochymol, gingerenone A, and meranzin hydrate showed the best predicted profile for behaving as antioxidant agents, whereas, among the drugs, nedocromil, zopolrestat, and bempedoic acid could be considered for a repurposing approach to identify possible antioxidant agents. In addition, they showed satisfactory ADMET properties with a safe profile, suggesting possible long-term administration. In conclusion, the identified compounds represent a valuable starting point for the identification of novel, safe, and effective antioxidant agents to be employed in cell-based tests and in vivo studies to properly evaluate their action against OxS and the optimal dosage for exerting antioxidant effects.
{"title":"In Silico Identification of Natural Products and World-Approved Drugs Targeting the KEAP1/NRF2 Pathway Endowed with Potential Antioxidant Profile","authors":"S. Brogi, Ilaria Guarino, L. Flori, Hajar Sirous, Vincenzo Calderone","doi":"10.3390/computation11120255","DOIUrl":"https://doi.org/10.3390/computation11120255","url":null,"abstract":"In this study, we applied a computer-based protocol to identify novel antioxidant agents that can reduce oxidative stress (OxS), which is one of the main hallmarks of several disorders, including cancer, cardiovascular disease, and neurodegenerative disorders. Accordingly, the identification of novel and safe agents, particularly natural products, could represent a valuable strategy to prevent and slow down the cellular damage caused by OxS. Employing two chemical libraries that were properly prepared and enclosing both natural products and world-approved and investigational drugs, we performed a high-throughput docking campaign to identify potential compounds that were able to target the KEAP1 protein. This protein is the main cellular component, along with NRF2, that is involved in the activation of the antioxidant cellular pathway. Furthermore, several post-search filtering approaches were applied to improve the reliability of the computational protocol, such as the evaluation of ligand binding energies and the assessment of the ADMET profile, to provide a final set of compounds that were evaluated by molecular dynamics studies for their binding stability. By following the screening protocol mentioned above, we identified a few undisclosed natural products and drugs that showed great promise as antioxidant agents. Considering the natural products, isoxanthochymol, gingerenone A, and meranzin hydrate showed the best predicted profile for behaving as antioxidant agents, whereas, among the drugs, nedocromil, zopolrestat, and bempedoic acid could be considered for a repurposing approach to identify possible antioxidant agents. In addition, they showed satisfactory ADMET properties with a safe profile, suggesting possible long-term administration. In conclusion, the identified compounds represent a valuable starting point for the identification of novel, safe, and effective antioxidant agents to be employed in cell-based tests and in vivo studies to properly evaluate their action against OxS and the optimal dosage for exerting antioxidant effects.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"34 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138967852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-14DOI: 10.3390/computation11120254
Anton Tolstikhin
Currently, the sampling problem has gained wide popularity in the field of autonomous mobile agent control due to the wide range of practical and fundamental problems described with its framework. This paper considers a combined decentralized control strategy that incorporates both elements of biologically inspired and gradient-based approaches. Its key feature is multitasking, consisting in the possibility of solving several tasks in parallel included in the sampling problem: localization and monitoring of several sources and restoration of the given level line boundaries.
{"title":"Bioinspired Multipurpose Approach to the Sampling Problem","authors":"Anton Tolstikhin","doi":"10.3390/computation11120254","DOIUrl":"https://doi.org/10.3390/computation11120254","url":null,"abstract":"Currently, the sampling problem has gained wide popularity in the field of autonomous mobile agent control due to the wide range of practical and fundamental problems described with its framework. This paper considers a combined decentralized control strategy that incorporates both elements of biologically inspired and gradient-based approaches. Its key feature is multitasking, consisting in the possibility of solving several tasks in parallel included in the sampling problem: localization and monitoring of several sources and restoration of the given level line boundaries.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"6 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138973052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-10DOI: 10.3390/computation11120249
Muratkan Madiyarov, Nurlan Temirbekov, N. Alimbekova, Y. Malgazhdarov, Yerlan Yergaliyev
This paper proposes a new approach to predicting the distribution of harmful substances in the atmosphere based on the combined use of the parameter estimation technique and machine learning algorithms. The essence of the proposed approach is based on the assumption that the concentration values predicted by machine learning algorithms at observation points can be used to refine the pollutant concentration field when solving a differential equation of the convection-diffusion-reaction type. This approach reduces to minimizing an objective functional on some admissible set by choosing the atmospheric turbulence coefficient. We consider two atmospheric turbulence models and restore its unknown parameters by using the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. Three ensemble machine learning algorithms are analyzed for the prediction of concentration values at observation points, and comparison of the predicted values with the measurement results is presented. The proposed approach has been tested on an example of two cities in the Republic of Kazakhstan. In addition, due to the lack of data on pollution sources and their intensities, an approach for identifying this information is presented.
{"title":"A Combined Approach for Predicting the Distribution of Harmful Substances in the Atmosphere Based on Parameter Estimation and Machine Learning Algorithms","authors":"Muratkan Madiyarov, Nurlan Temirbekov, N. Alimbekova, Y. Malgazhdarov, Yerlan Yergaliyev","doi":"10.3390/computation11120249","DOIUrl":"https://doi.org/10.3390/computation11120249","url":null,"abstract":"This paper proposes a new approach to predicting the distribution of harmful substances in the atmosphere based on the combined use of the parameter estimation technique and machine learning algorithms. The essence of the proposed approach is based on the assumption that the concentration values predicted by machine learning algorithms at observation points can be used to refine the pollutant concentration field when solving a differential equation of the convection-diffusion-reaction type. This approach reduces to minimizing an objective functional on some admissible set by choosing the atmospheric turbulence coefficient. We consider two atmospheric turbulence models and restore its unknown parameters by using the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. Three ensemble machine learning algorithms are analyzed for the prediction of concentration values at observation points, and comparison of the predicted values with the measurement results is presented. The proposed approach has been tested on an example of two cities in the Republic of Kazakhstan. In addition, due to the lack of data on pollution sources and their intensities, an approach for identifying this information is presented.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"58 14","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138982515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-10DOI: 10.3390/computation11120251
Sergei Abramovich
The paper deals with the exploration of subsequences of polygonal numbers of different sides derived through step-by-step elimination of terms of the original sequences. Eliminations are based on special rules similarly to how the classic sieve of Eratosthenes was developed through the elimination of multiples of primes. These elementary number theory activities, appropriate for technology-enhanced secondary mathematics education courses, are supported by a spreadsheet, Wolfram Alpha, Maple, and the Online Encyclopedia of Integer Sequences. General formulas for subsequences of polygonal numbers referred to in the paper as polygonal number sieves of order k, that include base-two exponential functions of k, have been developed. Different problem-solving approaches to the derivation of such and other sieves based on the technology-immune/technology-enabled framework have been used. The accuracy of computations and mathematical reasoning is confirmed through the technique of computational triangulation enabled by using more than one digital tool. A few relevant excerpts from the history of mathematics are briefly featured.
本文探讨了通过逐步消去原始序列的项而得到的不同边的多边形数的子序列。消除是基于特殊的规则，类似于通过消除质数的倍数来发展埃拉托塞尼斯的经典筛子。电子表格、Wolfram Alpha、Maple 和《整数序列在线百科全书》为这些适合技术强化中学数学教育课程的初级数论活动提供了支持。论文中将多边形数的子序列称为 k 阶多边形数筛，其中包括 k 的基 2 指数函数。在技术免疫/技术赋能框架的基础上，采用了不同的问题解决方法来推导此类和其他数筛。计算和数学推理的准确性通过使用一种以上数字工具的计算三角测量技术得到确认。下面简要介绍数学史上的一些相关节选。
{"title":"Exploring Polygonal Number Sieves through Computational Triangulation","authors":"Sergei Abramovich","doi":"10.3390/computation11120251","DOIUrl":"https://doi.org/10.3390/computation11120251","url":null,"abstract":"The paper deals with the exploration of subsequences of polygonal numbers of different sides derived through step-by-step elimination of terms of the original sequences. Eliminations are based on special rules similarly to how the classic sieve of Eratosthenes was developed through the elimination of multiples of primes. These elementary number theory activities, appropriate for technology-enhanced secondary mathematics education courses, are supported by a spreadsheet, Wolfram Alpha, Maple, and the Online Encyclopedia of Integer Sequences. General formulas for subsequences of polygonal numbers referred to in the paper as polygonal number sieves of order k, that include base-two exponential functions of k, have been developed. Different problem-solving approaches to the derivation of such and other sieves based on the technology-immune/technology-enabled framework have been used. The accuracy of computations and mathematical reasoning is confirmed through the technique of computational triangulation enabled by using more than one digital tool. A few relevant excerpts from the history of mathematics are briefly featured.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"1114 ","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138982653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-06DOI: 10.3390/computation11120248
Jonathan K Sinclair, P. Taylor
This study examined the effects of minimal, maximal and conventional running footwear on tibial strains and stress fracture probability using finite element and probabilistic analyses. The current investigation examined fifteen males running in three footwear conditions (minimal, maximal and conventional). Kinematic data were collected during overground running at 4.0 m/s using an eight-camera motion-capture system and ground reaction forces using a force plate. Tibial strains were quantified using finite element modelling and stress fracture probability calculated via probabilistic modelling over 100 days of running. Ninetieth percentile tibial strains were significantly greater in minimal (4681.13 με) (p < 0.001) and conventional (4498.84 με) (p = 0.007) footwear compared to maximal (4069.65 με). Furthermore, tibial stress fracture probability was significantly greater in minimal footwear (0.22) (p = 0.047) compared to maximal (0.15). The observations from this investigation show that compared to minimal footwear, maximal running shoes appear to be effective in attenuating runners’ likelihood of developing a tibial stress fracture.
{"title":"Effects of Running in Minimal, Maximal and Conventional Footwear on Tibial Stress Fracture Probability: An Examination Using Finite Element and Probabilistic Analyses","authors":"Jonathan K Sinclair, P. Taylor","doi":"10.3390/computation11120248","DOIUrl":"https://doi.org/10.3390/computation11120248","url":null,"abstract":"This study examined the effects of minimal, maximal and conventional running footwear on tibial strains and stress fracture probability using finite element and probabilistic analyses. The current investigation examined fifteen males running in three footwear conditions (minimal, maximal and conventional). Kinematic data were collected during overground running at 4.0 m/s using an eight-camera motion-capture system and ground reaction forces using a force plate. Tibial strains were quantified using finite element modelling and stress fracture probability calculated via probabilistic modelling over 100 days of running. Ninetieth percentile tibial strains were significantly greater in minimal (4681.13 με) (p < 0.001) and conventional (4498.84 με) (p = 0.007) footwear compared to maximal (4069.65 με). Furthermore, tibial stress fracture probability was significantly greater in minimal footwear (0.22) (p = 0.047) compared to maximal (0.15). The observations from this investigation show that compared to minimal footwear, maximal running shoes appear to be effective in attenuating runners’ likelihood of developing a tibial stress fracture.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"54 13","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138595284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-05DOI: 10.3390/computation11120246
Catur Supriyanto, Abu Salam, Junta Zeniarja, Adi Wijaya
This research paper presents a deep-learning approach to early detection of skin cancer using image augmentation techniques. We introduce a two-stage image augmentation process utilizing geometric augmentation and a generative adversarial network (GAN) to differentiate skin cancer categories. The public HAM10000 dataset was used to test how well the proposed model worked. Various pre-trained convolutional neural network (CNN) models, including Xception, Inceptionv3, Resnet152v2, EfficientnetB7, InceptionresnetV2, and VGG19, were employed. Our approach demonstrates an accuracy of 96.90%, precision of 97.07%, recall of 96.87%, and F1-score of 96.97%, surpassing the performance of other state-of-the-art methods. The paper also discusses the use of Shapley Additive Explanations (SHAP), an interpretable technique for skin cancer diagnosis, which can help clinicians understand the reasoning behind the diagnosis and improve trust in the system. Overall, the proposed method presents a promising approach to automated skin cancer detection that could improve patient outcomes and reduce healthcare costs.
{"title":"Two-Stage Input-Space Image Augmentation and Interpretable Technique for Accurate and Explainable Skin Cancer Diagnosis","authors":"Catur Supriyanto, Abu Salam, Junta Zeniarja, Adi Wijaya","doi":"10.3390/computation11120246","DOIUrl":"https://doi.org/10.3390/computation11120246","url":null,"abstract":"This research paper presents a deep-learning approach to early detection of skin cancer using image augmentation techniques. We introduce a two-stage image augmentation process utilizing geometric augmentation and a generative adversarial network (GAN) to differentiate skin cancer categories. The public HAM10000 dataset was used to test how well the proposed model worked. Various pre-trained convolutional neural network (CNN) models, including Xception, Inceptionv3, Resnet152v2, EfficientnetB7, InceptionresnetV2, and VGG19, were employed. Our approach demonstrates an accuracy of 96.90%, precision of 97.07%, recall of 96.87%, and F1-score of 96.97%, surpassing the performance of other state-of-the-art methods. The paper also discusses the use of Shapley Additive Explanations (SHAP), an interpretable technique for skin cancer diagnosis, which can help clinicians understand the reasoning behind the diagnosis and improve trust in the system. Overall, the proposed method presents a promising approach to automated skin cancer detection that could improve patient outcomes and reduce healthcare costs.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"55 2","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138598332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-05DOI: 10.3390/computation11120247
Louis H. Kauffman
This paper explores a formal model of autopoiesis as presented by Maturana, Uribe and Varela, and analyzes this model and its implications through the lens of the notions of eigenforms (fixed points) and the intricacies of Goedelian coding. The paper discusses the connection between autopoiesis and eigenforms and a variety of different perspectives and examples. The paper puts forward original philosophical reflections and generalizations about its various conclusions concerning specific examples, with the aim of contributing to a unified way of understanding (formal models of) living systems within the context of natural sciences, and to see the role of such systems and the formation of information from the point of view of analogs of biological construction. To this end, we pay attention to models for fixed points, self-reference and self-replication in formal systems and in the description of biological systems.
{"title":"Autopoiesis and Eigenform","authors":"Louis H. Kauffman","doi":"10.3390/computation11120247","DOIUrl":"https://doi.org/10.3390/computation11120247","url":null,"abstract":"This paper explores a formal model of autopoiesis as presented by Maturana, Uribe and Varela, and analyzes this model and its implications through the lens of the notions of eigenforms (fixed points) and the intricacies of Goedelian coding. The paper discusses the connection between autopoiesis and eigenforms and a variety of different perspectives and examples. The paper puts forward original philosophical reflections and generalizations about its various conclusions concerning specific examples, with the aim of contributing to a unified way of understanding (formal models of) living systems within the context of natural sciences, and to see the role of such systems and the formation of information from the point of view of analogs of biological construction. To this end, we pay attention to models for fixed points, self-reference and self-replication in formal systems and in the description of biological systems.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"124 35","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138599209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-04DOI: 10.3390/computation11120244
Stefan Hensel, M. Marinov, Raphael Panter
In recent years, the advancement of micro-aerial vehicles has been rapid, leading to their widespread utilization across various domains due to their adaptability and efficiency. This research paper focuses on the development of a camera-based tracking system specifically designed for low-cost drones. The primary objective of this study is to build up a system capable of detecting objects and locating them on a map in real time. Detection and positioning are achieved solely through the utilization of the drone’s camera and sensors. To accomplish this goal, several deep learning algorithms are assessed and adopted because of their suitability with the system. Object detection is based upon a single-shot detector architecture chosen for maximum computation speed, and the tracking is based upon the combination of deep neural-network-based features combined with an efficient sorting strategy. Subsequently, the developed system is evaluated using diverse metrics to determine its performance for detection and tracking. To further validate the approach, the system is employed in the real world to show its possible deployment. For this, two distinct scenarios were chosen to adjust the algorithms and system setup: a search and rescue scenario with user interaction and precise geolocalization of missing objects, and a livestock control scenario, showing the capability of surveying individual members and keeping track of number and area. The results demonstrate that the system is capable of operating in real time, and the evaluation verifies that the implemented system enables precise and reliable determination of detected object positions. The ablation studies prove that object identification through small variations in phenotypes is feasible with our approach.
{"title":"Design and Implementation of a Camera-Based Tracking System for MAV Using Deep Learning Algorithms","authors":"Stefan Hensel, M. Marinov, Raphael Panter","doi":"10.3390/computation11120244","DOIUrl":"https://doi.org/10.3390/computation11120244","url":null,"abstract":"In recent years, the advancement of micro-aerial vehicles has been rapid, leading to their widespread utilization across various domains due to their adaptability and efficiency. This research paper focuses on the development of a camera-based tracking system specifically designed for low-cost drones. The primary objective of this study is to build up a system capable of detecting objects and locating them on a map in real time. Detection and positioning are achieved solely through the utilization of the drone’s camera and sensors. To accomplish this goal, several deep learning algorithms are assessed and adopted because of their suitability with the system. Object detection is based upon a single-shot detector architecture chosen for maximum computation speed, and the tracking is based upon the combination of deep neural-network-based features combined with an efficient sorting strategy. Subsequently, the developed system is evaluated using diverse metrics to determine its performance for detection and tracking. To further validate the approach, the system is employed in the real world to show its possible deployment. For this, two distinct scenarios were chosen to adjust the algorithms and system setup: a search and rescue scenario with user interaction and precise geolocalization of missing objects, and a livestock control scenario, showing the capability of surveying individual members and keeping track of number and area. The results demonstrate that the system is capable of operating in real time, and the evaluation verifies that the implemented system enables precise and reliable determination of detected object positions. The ablation studies prove that object identification through small variations in phenotypes is feasible with our approach.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"84 23","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138604429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-04DOI: 10.3390/computation11120245
M. Juříček, Roman Parák, J. Kůdela
The significance of robot manipulators in engineering applications and scientific research has increased substantially in recent years. The utilization of robot manipulators to save labor and increase production accuracy is becoming a common practice in industry. Evolutionary computation (EC) techniques are optimization methods that have found their use in diverse engineering fields. This state-of-the-art review focuses on recent developments and progress in their applications for industrial robotics, especially for path planning problems that need to satisfy various constraints that are implied by both the geometry of the robot and its surroundings. We discuss the most-used EC method and the modifications that suit this particular purpose, as well as the different simulation environments that are used for their development. Lastly, we outline the possible research gaps and the expected directions future research in this area will entail.
{"title":"Evolutionary Computation Techniques for Path Planning Problems in Industrial Robotics: A State-of-the-Art Review","authors":"M. Juříček, Roman Parák, J. Kůdela","doi":"10.3390/computation11120245","DOIUrl":"https://doi.org/10.3390/computation11120245","url":null,"abstract":"The significance of robot manipulators in engineering applications and scientific research has increased substantially in recent years. The utilization of robot manipulators to save labor and increase production accuracy is becoming a common practice in industry. Evolutionary computation (EC) techniques are optimization methods that have found their use in diverse engineering fields. This state-of-the-art review focuses on recent developments and progress in their applications for industrial robotics, especially for path planning problems that need to satisfy various constraints that are implied by both the geometry of the robot and its surroundings. We discuss the most-used EC method and the modifications that suit this particular purpose, as well as the different simulation environments that are used for their development. Lastly, we outline the possible research gaps and the expected directions future research in this area will entail.","PeriodicalId":52148,"journal":{"name":"Computation","volume":"73 19","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138604758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：