Hu Cai, Baotong Chen, Hongyi Qu, Jiafu Wan, Mejdl Safran
In mixed-flow assembly lines, conflicts exist between the diverse production modes and the dynamic maintenance demand. There is an urgent demand to shift the adaptive manufacturing from passive scheduling to proactive scheduling. The uncertain evolution of the scheduling performance and the equipment state causes difficulty in balancing the production load and the predicted maintenance under the degradation effect. This paper aims at the production scheduling and mixed-flow assembly line maintenance and proposes an improved hybrid Tabu Search and Genetic Algorithm (hybrid TSGA)–based proactive scheduling method for production prediction. Initially, the method constructs a real-time state model for the equipment state, workshop manufacturing efficiency, manufacturing resource state, and manufacturing execution system feedback information. The production process status information is used as input to a mathematical modeling method, which is used to obtain the production trend of mixed flow assembly line in the workshop. Afterward, the hybrid TSGA is deployed and its sequential decision-making capability is used to generate a proactive scheduling scheme based on the production trend prediction. The proposed methodology was implemented in a robotic flexible welding automobile production line for production scheduling, with its efficacy empirically validated. Simulation results demonstrated a 6% reduction in total completion time for multimachine, multiprocess scheduling scenarios, demonstrating superior performance.
{"title":"An Improved Hybrid Tabu Search and Genetic Algorithm for Proactive Scheduling of Mixed-Flow Assembly Line Under Degradation Effects","authors":"Hu Cai, Baotong Chen, Hongyi Qu, Jiafu Wan, Mejdl Safran","doi":"10.1155/int/4600789","DOIUrl":"https://doi.org/10.1155/int/4600789","url":null,"abstract":"<p>In mixed-flow assembly lines, conflicts exist between the diverse production modes and the dynamic maintenance demand. There is an urgent demand to shift the adaptive manufacturing from passive scheduling to proactive scheduling. The uncertain evolution of the scheduling performance and the equipment state causes difficulty in balancing the production load and the predicted maintenance under the degradation effect. This paper aims at the production scheduling and mixed-flow assembly line maintenance and proposes an improved hybrid Tabu Search and Genetic Algorithm (hybrid TSGA)–based proactive scheduling method for production prediction. Initially, the method constructs a real-time state model for the equipment state, workshop manufacturing efficiency, manufacturing resource state, and manufacturing execution system feedback information. The production process status information is used as input to a mathematical modeling method, which is used to obtain the production trend of mixed flow assembly line in the workshop. Afterward, the hybrid TSGA is deployed and its sequential decision-making capability is used to generate a proactive scheduling scheme based on the production trend prediction. The proposed methodology was implemented in a robotic flexible welding automobile production line for production scheduling, with its efficacy empirically validated. Simulation results demonstrated a 6% reduction in total completion time for multimachine, multiprocess scheduling scenarios, demonstrating superior performance.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/4600789","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145038234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Accurate traffic speed prediction holds immense significance in mitigating traffic congestion and enhancing traffic safety. However, traffic data exhibit distinct patterns across different cycles (such as weekdays, weekends, and holidays), making it challenging for traditional models to effectively capture this multiperiod heterogeneity in traffic data. Furthermore, most existing research on traffic speed prediction struggles to efficiently capture the spatiotemporal characteristics of dynamic traffic data simultaneously. To tackle these challenges, this paper first introduces spatiotemporal-aware position encoding (STAPE) technology, which addresses the multiperiod heterogeneity in traffic data by integrating temporal cycle information with spatial position information. Second, a multilevel spatiotemporal feature extraction architecture is designed, leveraging graph convolutional network (GCN) to capture the topological structure and spatial features of the traffic road network. By applying gated recurrent unit (GRU) to capture the temporal dependencies of traffic data, and combining GCN and GRU in multiple stages, this architecture deeply explores the spatiotemporal features of traffic data. Additionally, this paper integrates a multihead attention mechanism, which, in conjunction with the parallelized attention channel adaptive mechanism and the multilevel spatiotemporal feature extraction architecture, enhances the model’s ability to adaptively model different spatiotemporal patterns dynamically, thereby efficiently capturing the dynamically changing spatiotemporal features. Extensive performance evaluation experiments conducted on the METR-LA and PEMS-BAY datasets demonstrate that the predictive performance of the proposed model surpasses that of nine other baseline methods.
{"title":"Utilizing Multihead Attention-Based Graph Convolution Networks for Traffic Speed Prediction","authors":"Hongbo Xiao, Beiji Zou, Jianhua Xiao, Xiaoyan Kui, Lilian Yuan","doi":"10.1155/int/3471620","DOIUrl":"https://doi.org/10.1155/int/3471620","url":null,"abstract":"<p>Accurate traffic speed prediction holds immense significance in mitigating traffic congestion and enhancing traffic safety. However, traffic data exhibit distinct patterns across different cycles (such as weekdays, weekends, and holidays), making it challenging for traditional models to effectively capture this multiperiod heterogeneity in traffic data. Furthermore, most existing research on traffic speed prediction struggles to efficiently capture the spatiotemporal characteristics of dynamic traffic data simultaneously. To tackle these challenges, this paper first introduces spatiotemporal-aware position encoding (STAPE) technology, which addresses the multiperiod heterogeneity in traffic data by integrating temporal cycle information with spatial position information. Second, a multilevel spatiotemporal feature extraction architecture is designed, leveraging graph convolutional network (GCN) to capture the topological structure and spatial features of the traffic road network. By applying gated recurrent unit (GRU) to capture the temporal dependencies of traffic data, and combining GCN and GRU in multiple stages, this architecture deeply explores the spatiotemporal features of traffic data. Additionally, this paper integrates a multihead attention mechanism, which, in conjunction with the parallelized attention channel adaptive mechanism and the multilevel spatiotemporal feature extraction architecture, enhances the model’s ability to adaptively model different spatiotemporal patterns dynamically, thereby efficiently capturing the dynamically changing spatiotemporal features. Extensive performance evaluation experiments conducted on the METR-LA and PEMS-BAY datasets demonstrate that the predictive performance of the proposed model surpasses that of nine other baseline methods.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/3471620","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Identity management (IDM) systems in cloud computing struggle to securely manage user identities and access privileges in distributed environments. However, centralized IDM solutions come with high trust costs, single points of failure, and a need for appropriate security response. This paper proposes a novel decentralized IDM framework utilizing blockchain technology and automatic provisioning (AP) techniques to improve cloud computing’s security, scalability, and operational efficiency. The framework employs Ethereum smart contracts and role-based access control (RBAC) to ensure secure, transparent, and automated management of user identities. Key features include support for single sign-on (SSO), multifactor authentication (MFA), and delegated proof-of-stake (DPoS) consensus for secure transaction validation. Our proposed scheme utilizes the Ethereum blockchain and smart contracts for managing user access, ensuring transparent and immutable record-keeping. The scheme introduces RBAC mechanisms to ensure precise privilege allocation and dynamic updates. The scheme also supports key IDM processes, including SSO, MFA, and lifecycle management of identities. The framework incorporates DPoS consensus to enhance security for efficient transaction validation and the prevention of fraud. To address fraudulent activities, the scheme uses machine learning to detect blockchain fraud with 99.1% accuracy, demonstrating robustness and efficiency for large-scale cloud infrastructures.
{"title":"Decentralized Identity Management in Cloud Computing: A Blockchain-Based Solution With Automatic Provisioning Techniques","authors":"Ayman Mohamed Mostafa, Ehab R. Mohamed, Asmaa Hanafy, Faeiz Alserhani, Ghadah Naif Alwakid, Reham Medhat, Mohamed Ezz, Amjad Alsirhani","doi":"10.1155/int/2969737","DOIUrl":"https://doi.org/10.1155/int/2969737","url":null,"abstract":"<p>Identity management (IDM) systems in cloud computing struggle to securely manage user identities and access privileges in distributed environments. However, centralized IDM solutions come with high trust costs, single points of failure, and a need for appropriate security response. This paper proposes a novel decentralized IDM framework utilizing blockchain technology and automatic provisioning (AP) techniques to improve cloud computing’s security, scalability, and operational efficiency. The framework employs Ethereum smart contracts and role-based access control (RBAC) to ensure secure, transparent, and automated management of user identities. Key features include support for single sign-on (SSO), multifactor authentication (MFA), and delegated proof-of-stake (DPoS) consensus for secure transaction validation. Our proposed scheme utilizes the Ethereum blockchain and smart contracts for managing user access, ensuring transparent and immutable record-keeping. The scheme introduces RBAC mechanisms to ensure precise privilege allocation and dynamic updates. The scheme also supports key IDM processes, including SSO, MFA, and lifecycle management of identities. The framework incorporates DPoS consensus to enhance security for efficient transaction validation and the prevention of fraud. To address fraudulent activities, the scheme uses machine learning to detect blockchain fraud with 99.1% accuracy, demonstrating robustness and efficiency for large-scale cloud infrastructures.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/2969737","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144930063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marcelo V. C. Aragão, Tiago de M. Pereira, Mateus de F. Carvalho, Felipe A. P. de Figueiredo, Samuel B. Mafra
Handling class imbalance is a fundamental challenge in supervised learning, particularly in real-world scenarios where minority classes are critical yet underrepresented. This paper presents a novel dynamic-balancing pipeline that enhances automated machine learning (AutoML) performance on imbalanced tabular datasets. The proposed approach integrates both traditional and generative resampling techniques with adaptive, class-specific thresholds, enabling automated and dataset-sensitive balancing strategies. To assess its generalizability, the pipeline is applied uniformly across binary, multiclass, and multilabel classification tasks. Each configuration is evaluated within an AutoML framework using performance and efficiency metrics, with outcomes validated through statistical testing and effect size analysis. The study also incorporates dataset complexity measures—including feature-label dependency and class overlap—to investigate how structural characteristics affect balancing efficacy. By combining principled resampling, exhaustive grid search, and rigorous evaluation, the pipeline enables more robust and efficient AutoML workflows. This work contributes a flexible and reproducible framework for addressing class imbalance, particularly in multilabel contexts, and establishes a foundation for scalable, complexity-aware resampling in automated model development.
{"title":"Dynamic-Balancing AutoML for Imbalanced Tabular Data With Adaptive Resampling and Complexity-Aware Analysis","authors":"Marcelo V. C. Aragão, Tiago de M. Pereira, Mateus de F. Carvalho, Felipe A. P. de Figueiredo, Samuel B. Mafra","doi":"10.1155/int/3986105","DOIUrl":"https://doi.org/10.1155/int/3986105","url":null,"abstract":"<p>Handling class imbalance is a fundamental challenge in supervised learning, particularly in real-world scenarios where minority classes are critical yet underrepresented. This paper presents a novel dynamic-balancing pipeline that enhances automated machine learning (AutoML) performance on imbalanced tabular datasets. The proposed approach integrates both traditional and generative resampling techniques with adaptive, class-specific thresholds, enabling automated and dataset-sensitive balancing strategies. To assess its generalizability, the pipeline is applied uniformly across binary, multiclass, and multilabel classification tasks. Each configuration is evaluated within an AutoML framework using performance and efficiency metrics, with outcomes validated through statistical testing and effect size analysis. The study also incorporates dataset complexity measures—including feature-label dependency and class overlap—to investigate how structural characteristics affect balancing efficacy. By combining principled resampling, exhaustive grid search, and rigorous evaluation, the pipeline enables more robust and efficient AutoML workflows. This work contributes a flexible and reproducible framework for addressing class imbalance, particularly in multilabel contexts, and establishes a foundation for scalable, complexity-aware resampling in automated model development.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/3986105","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144910255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The rapid growth of e-commerce has amplified the need for efficient logistics and delivery route planning. The Traveling Salesman Problem (TSP) provides a mathematical framework to address this challenge by finding optimal delivery routes. In this study, we propose a novel algorithm, DPSO-Q, which synergizes the adaptability of reinforcement learning from Ant-Q with the computational efficiency of Discrete Particle Swarm Optimization (DPSO). By leveraging swarm intelligence and adaptive learning mechanisms, DPSO-Q achieves a balance between computational efficiency and high-quality solutions. Experimental evaluations demonstrate its potential for large-scale logistics optimization, making it a promising tool for addressing the complexities of modern supply chain systems. DPSO-Q reduces tour lengths by up to 7.5% compared to DPSO and achieves execution times over 90% faster than ACO and Ant-Q on standard datasets such as ch130 and zi929.
{"title":"DPSO-Q: A Reinforcement Learning–Enhanced Swarm Algorithm for Solving the Traveling Salesman Problem","authors":"Sivayazi Kappagantula, Rohit Sangubotla, Vippagunta Vidhu Sri Varenya, Srishti Gupta, Satya Veerendra Arigela, Ramya S. Moorthy, Jeane Marina D’souza, Praveen Kumar Bonthagorla","doi":"10.1155/int/8918171","DOIUrl":"https://doi.org/10.1155/int/8918171","url":null,"abstract":"<p>The rapid growth of e-commerce has amplified the need for efficient logistics and delivery route planning. The Traveling Salesman Problem (TSP) provides a mathematical framework to address this challenge by finding optimal delivery routes. In this study, we propose a novel algorithm, DPSO-Q, which synergizes the adaptability of reinforcement learning from Ant-Q with the computational efficiency of Discrete Particle Swarm Optimization (DPSO). By leveraging swarm intelligence and adaptive learning mechanisms, DPSO-Q achieves a balance between computational efficiency and high-quality solutions. Experimental evaluations demonstrate its potential for large-scale logistics optimization, making it a promising tool for addressing the complexities of modern supply chain systems. DPSO-Q reduces tour lengths by up to 7.5% compared to DPSO and achieves execution times over 90% faster than ACO and Ant-Q on standard datasets such as ch130 and zi929.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/8918171","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144894382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marina Svičević, Nemanja Vučićević, Filip Andrić, Nenad Stojanović
Bipolar neutrosophic soft sets are powerful tools for modeling data under conditions of uncertainty and imprecision due to their rich parametric structure and the useful mathematical properties of the operations defined on them. In this paper, motivated by the limitations of existing decision-making algorithms, we introduce a new numerical characteristic, the energy of a bipolar neutrosophic soft set defined using singular values, analogous to the graph energy and nuclear norm. Our goal is to develop an efficient decision-making algorithm that successfully identifies the optimal alternative even in cases where other algorithms provide inaccurate or inconsistent results. Our research is motivated by the need for more reliable decision-making methods in complex soft environments and the potential of the energy-based approach to overcome the weaknesses of existing methods, which we demonstrate through a comparative analysis using concrete examples.
{"title":"Analyzing Decision-Making Processes Using the Energy of Bipolar Neutrosophic Soft Sets","authors":"Marina Svičević, Nemanja Vučićević, Filip Andrić, Nenad Stojanović","doi":"10.1155/int/1820548","DOIUrl":"https://doi.org/10.1155/int/1820548","url":null,"abstract":"<p>Bipolar neutrosophic soft sets are powerful tools for modeling data under conditions of uncertainty and imprecision due to their rich parametric structure and the useful mathematical properties of the operations defined on them. In this paper, motivated by the limitations of existing decision-making algorithms, we introduce a new numerical characteristic, the energy of a bipolar neutrosophic soft set defined using singular values, analogous to the graph energy and nuclear norm. Our goal is to develop an efficient decision-making algorithm that successfully identifies the optimal alternative even in cases where other algorithms provide inaccurate or inconsistent results. Our research is motivated by the need for more reliable decision-making methods in complex soft environments and the potential of the energy-based approach to overcome the weaknesses of existing methods, which we demonstrate through a comparative analysis using concrete examples.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/1820548","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144869285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaochuan Duan, Shaoping Wang, Jian Shi, Di Liu, Yaoxing Shang
The winch’s performance under complex sea conditions is significantly influenced by its collecting and releasing processes. To enhance its performance and reliability, an optimization approach considering wave disturbances and control laws is proposed to balance time efficiency and tension stability. Within a multiobjective optimization framework, the method designs constant tension control and robust adaptive speed control and introduces sinusoidal acceleration trajectories to minimize tension surges and reduce system impacts caused by rapid starts/stops. The constant tension controller reduces wave disturbances, while the speed controller manages the working process. These controllers are designed with unknown reference signals determined during the optimization process. Additionally, the objective functions in the optimization phase aim to reduce working time and tension fluctuations, with constraints ensuring system safety and mission requirements. Furthermore, an experimental platform constructed on a ship validates the accuracy of the winch model. The optimized process not only shortens operational time, as collecting same length only consumption 127.44 s compared 143.14 s without optimization, but also reduces tension and acceleration. More importantly, transitions between states become more gradual. This indicates that the proposed method is both time-efficient and effective in dampening tension fluctuations and mitigating the effects of abrupt changes during the working process.
{"title":"A Multiobjective Optimization Method for Collecting and Releasing Processes of Winch System Considering Wave Disturbance and Control Laws","authors":"Xiaochuan Duan, Shaoping Wang, Jian Shi, Di Liu, Yaoxing Shang","doi":"10.1155/int/2004983","DOIUrl":"https://doi.org/10.1155/int/2004983","url":null,"abstract":"<p>The winch’s performance under complex sea conditions is significantly influenced by its collecting and releasing processes. To enhance its performance and reliability, an optimization approach considering wave disturbances and control laws is proposed to balance time efficiency and tension stability. Within a multiobjective optimization framework, the method designs constant tension control and robust adaptive speed control and introduces sinusoidal acceleration trajectories to minimize tension surges and reduce system impacts caused by rapid starts/stops. The constant tension controller reduces wave disturbances, while the speed controller manages the working process. These controllers are designed with unknown reference signals determined during the optimization process. Additionally, the objective functions in the optimization phase aim to reduce working time and tension fluctuations, with constraints ensuring system safety and mission requirements. Furthermore, an experimental platform constructed on a ship validates the accuracy of the winch model. The optimized process not only shortens operational time, as collecting same length only consumption 127.44 s compared 143.14 s without optimization, but also reduces tension and acceleration. More importantly, transitions between states become more gradual. This indicates that the proposed method is both time-efficient and effective in dampening tension fluctuations and mitigating the effects of abrupt changes during the working process.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/2004983","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144814765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Imran Shafi, Imad Khan, Jose Brenosa, Miguel Angel Lopez Flores, Julio Cesar Martinez Espinosa, Jin-Ghoo Choi, Imran Ashraf
Cleaning and inspection of pipelines and gun barrels are crucial for ensuring safety and integrity to extend their lifespan. Existing automatic inspection approaches lack high robustness, as well as portability, and have movement restrictions and complexity. This study presents the design and development of a scalable, comprehensive automated inspection, cleaning, and evaluation mechanism (CAICEM) for large-sized pipelines and barrels with diameters in the range of 105 mm–210 mm. The proposed system is divided into electrical and mechanical assemblies that are independently designed, tested, fabricated, integrated, and controlled with industrial grid controllers and processors. These actuators are suitably programmed to provide the desired actions through toggle switches on a simple housing subassembly. The stress analysis and material specifications are obtained using ANSYS to ensure robustness and practicability. Later, on-ground testing and optimization are performed before industrial prototyping. The inspection system of the proposed mechanism includes barrel-mounted and brush-mounted cameras with sensors utilized to keep track of the pipeline deposits and monitor user activity. The experimental results demonstrate that the proposed mechanism is cost-effective and achieves the desired objectives with minimum human efforts in the least possible time for both smooth and rifled large-diameter pipes and barrels.
管道和炮管的清洁和检查对于确保其安全性和完整性以延长其使用寿命至关重要。现有的自动检测方法缺乏高鲁棒性和可移植性,并且具有运动限制和复杂性。本研究提出了一种可扩展的、全面的自动化检查、清洗和评估机制(CAICEM)的设计和开发,适用于直径在105 mm - 210 mm范围内的大型管道和桶。该系统分为电气和机械组件,分别独立设计、测试、制造、集成,并由工业网格控制器和处理器控制。这些执行器经过适当的编程,通过简单外壳组件上的拨动开关提供所需的动作。利用ANSYS软件进行了应力分析和材料规格分析,保证了结构的鲁棒性和实用性。然后,在工业原型制作之前进行地面测试和优化。拟议机制的检查系统包括装有传感器的桶式和刷式摄像机,用于跟踪管道沉积物和监测用户活动。实验结果表明,所提出的机构具有较高的成本效益,在最短的时间内以最少的人力达到了预期的目标,无论是光滑的还是膛线的大直径管和管。
{"title":"Scalable Comprehensive Automatic Inspection, Cleaning, and Evaluation Mechanism for Large-Diameter Pipes","authors":"Imran Shafi, Imad Khan, Jose Brenosa, Miguel Angel Lopez Flores, Julio Cesar Martinez Espinosa, Jin-Ghoo Choi, Imran Ashraf","doi":"10.1155/int/2441962","DOIUrl":"https://doi.org/10.1155/int/2441962","url":null,"abstract":"<p>Cleaning and inspection of pipelines and gun barrels are crucial for ensuring safety and integrity to extend their lifespan. Existing automatic inspection approaches lack high robustness, as well as portability, and have movement restrictions and complexity. This study presents the design and development of a scalable, comprehensive automated inspection, cleaning, and evaluation mechanism (CAICEM) for large-sized pipelines and barrels with diameters in the range of 105 mm–210 mm. The proposed system is divided into electrical and mechanical assemblies that are independently designed, tested, fabricated, integrated, and controlled with industrial grid controllers and processors. These actuators are suitably programmed to provide the desired actions through toggle switches on a simple housing subassembly. The stress analysis and material specifications are obtained using ANSYS to ensure robustness and practicability. Later, on-ground testing and optimization are performed before industrial prototyping. The inspection system of the proposed mechanism includes barrel-mounted and brush-mounted cameras with sensors utilized to keep track of the pipeline deposits and monitor user activity. The experimental results demonstrate that the proposed mechanism is cost-effective and achieves the desired objectives with minimum human efforts in the least possible time for both smooth and rifled large-diameter pipes and barrels.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":3.7,"publicationDate":"2025-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/2441962","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144832798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}