检索结果-内蒙古大学图书馆

A two-stage optimization approach to image-capture window positioning and path planning for automatic optical inspection

引用

SWARM AND EVOLUTIONARY COMPUTATION 2025年 92卷

作者： Yan, Xiaohui Zhang, Yukang Luo, Junwei Cheng, Shi Zhang, Zhicong Zhang, Liangwei Zhang, Zhengmin Dongguan Univ Technol Sch Mech Engn Dongguan 523808 Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian 710119 Peoples R China

Automatic optical inspection is an effective method to improve inspection efficiency in the manufacturing industry. This study has divided the automatic optical image acquisition problem into two subproblems and proposed a two-stage image acquisition method for incremental optimization to mitigate the time-consuming nature of traditional sequential image acquisition. An enhanced iterative self-organizing data algorithm is initially employed, integrating selection and crossover operators based on genetic algorithms to address the challenge of clustering image-capture windows. Regarding image acquisition path planning, a hybrid framework was introduced that dynamically combines swarm intelligence algorithms to identify optimal image-capture locations and a 2-opt algorithm to optimize the sequence of accessing these locations. Additionally, a boundary mapping strategy is introduced to reduce the search space effectively. Based on this hybrid framework, an improved brain storm optimization algorithm is proposed to accelerate convergence speed and enhance optimization precision. Furthermore, a neighborhood adjustment strategy is implemented to refine the inspection path further. Experimental results validate the efficacy of the proposed two-stage image acquisition method, demonstrating significant improvements in efficiency and performance.

关键词： Computational intelligence Brain storm optimization algorithm design Path planning Automatic optical inspection

来源：评论

学校读者我要写书评

暂无评论

On the detection of Markov decision processes

引用

AUTOMATICA 2025年 175卷

作者： Duan, Xiaoming Savas, Yagiz Yan, Rui Xu, Zhe Topcu, Ufuk Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA Beihang Univ Sch Artificial Intelligence Beijing 100191 Peoples R China Arizona State Univ Sch Engn Matter Transport & Energy Tempe AZ 85287 USA

We study the detection problem fora finite set of Markov decision processes (MDPs) where the MDPs have the same state and action spaces but possibly different probabilistic transition functions. Any one of these MDPs could be the model for some underlying controlled stochastic process, but it is unknown a priori which MDP is the ground truth. We investigate whether it is possible to asymptotically detect the ground truth MDP model perfectly based on a single observed history (state-action sequence). Since the generation of histories depends on the policy adopted to control the MDPs, we discuss the existence and synthesis of policies that allow for perfect detection. We start with the case of two MDPs and establish a necessary and sufficient condition for the existence of policies that lead to perfect detection. Based on this condition, we then develop an algorithm that efficiently (in time polynomial in the size of the MDPs) determines the existence of policies and synthesizes one when they exist. We further extend the results to the more general case where there are more than two MDPs in the candidate set, and we develop a policy synthesis algorithm based on the breadth-first search and recursion. We demonstrate the effectiveness of our algorithms through numerical examples. (c) 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： Markov decision processes Decision making Asymptotic detection Policy synthesis algorithm design

来源：评论

学校读者我要写书评

暂无评论

A Multi-Surrogate Assisted Multi-Tasking Optimization algorithm for High-Dimensional Expensive Problems

引用

algorithmS 2025年第1期18卷 4-4页

作者： Li, Hongyu Chen, Lei Zhang, Jian Li, Muxi Jiangsu Univ Fac Civil Engn & Mech Zhenjiang 212013 Peoples R China Northwestern Polytech Univ Ocean Inst Taicang 215400 Peoples R China Tianjin Univ Sch Mech Engn Tianjin 300354 Peoples R China

Surrogate-assisted evolutionary algorithms (SAEAs) are widely used in the field of high-dimensional expensive optimization. However, real-world problems are usually complex and characterized by a variety of features. Therefore, it is very challenging to choose the most appropriate surrogate. It has been shown that multiple surrogates can characterize the fitness landscape more accurately than a single surrogate. In this work, a multi-surrogate-assisted multi-tasking optimization algorithm (MSAMT) is proposed that solves high-dimensional problems by simultaneously optimizing multiple surrogates as related tasks using the generalized multi-factorial evolutionary algorithm. In the MSAMT, all exactly evaluated samples are initially grouped to form a collection of clusters. Subsequently, the search space can be divided into several areas based on the clusters, and surrogates are constructed in each region that are capable of completely describing the entire fitness landscape as a way to improve the exploration capability of the algorithm. Near the current optimal solution, a novel ensemble surrogate is adopted to achieve local search in speeding up the convergence process. In the framework of a multi-tasking optimization algorithm, several surrogates are optimized simultaneously as related tasks. As a result, several optimal solutions spread throughout disjoint regions can be found for real function evaluation. Fourteen 10- to 100-dimensional test functions and a spatial truss design problem were used to compare the proposed approach with several recently proposed SAEAs. The results show that the proposed MSAMT performs better than the comparison algorithms in most test functions and real engineering problems.

关键词： multi-tasking optimization algorithm algorithm design dynamic ensemble of surrogates decision space partition expensive optimization problem

来源：评论

学校读者我要写书评

暂无评论

High order expansion method for Kuiper's Vn statistic in goodness-of-fit test

引用

STATISTICS AND COMPUTING 2025年第4期35卷 1-19页

作者： Zhang, Hong-Yan Feng, Zhi-Qiang Liu, Haoting Lin, Rui-Jia Zhou, Yu Hainan Normal Univ Sch Informat Sci & Technol 99 Rd LongKun South Haikou 571158 Peoples R China Univ Sci & Technol Beijing Sch Automat 30 Rd Xueyuan Beijing 100083 Peoples R China Hainan Normal Univ Informat Network & Data Ctr 99 Rd LongKun South Haikou 571158 Peoples R China

Kuiper's Vn statistic, a measure for comparing the difference of ideal distribution and empirical distribution, is of great significance in the goodness-of-fit test. However, Kuiper's formulae for computing the cumulative distribution function, false positive probability, and the upper tail quantile of Vn cannot be applied to the case of small sample capacity n since the approximation error is On-1. In this work, our contributions lie in three perspectives: firstly the approximation error is reduced to On-(k+1)/2 where k is the expansion order with the high order expansion for the exponent of the differential operator;secondly, a novel high order formula with approximation error On-3 is obtained by massive calculations;thirdly, the fixed-point algorithms are designed for solving the Kuiper pair of critical values and upper tail quantiles based on the novel formula. The high order expansion method for Kuiper's Vn statistic is applicable for various applications where there are more than five samples of data. The principles, algorithms, and code for the high order expansion method are attractive for the goodness-of-fit test.

关键词： Goodness-of-fit Methods Kuiper's statistic Quantile estimation algorithm design High order expansion (HOE)

来源：评论

学校读者我要写书评

暂无评论

Towards a More Efficient Selection Monad 25th

Towards a More Efficient Selection Monad

引用

25th International Symposium on Trends in Functional Programming

作者： Hartmann, Johannes Schrijvers, Tom Gibbons, Jeremy Univ Oxford Dept Comp Sci Oxford England Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (纸本)9783031745577;9783031745584

This paper explores a novel approach to selection functions through the introduction of a generalised selection monad. The foundation is laid with the conventional selection monad J, defined as (A -> R) -> A, together with various combinators for computing new selection functions from old. However, inefficiencies in these combinators are identified. To address these issues, a specialised type K is introduced, and its isomorphism to J is demonstrated. The paper further generalises the K type to G, where performance improvements and enhanced intuitive usability are observed. The embeddings between J and G are established, offering a more efficient and expressive alternative to the well established J type for selection functions. The findings emphasise the advantages of the generalised selection monad and its applicability in diverse scenarios, paving the way for further exploration and optimisation.

关键词： Selection monad Functional programming algorithm design Performance Optimisation Monads

来源：评论

学校读者我要写书评

暂无评论

design of a multi-hop dynamic consensus algorithm over wireless sensor networks

引用

CONTROL ENGINEERING PRACTICE 2013年第4期21卷 381-394页

作者： Manfredi, Sabato Univ Naples Federico II Dept Elect Engn & Informat Technol I-80125 Naples Italy

In the last few years great attention has been concentrated on the consensus algorithm in a network of agents. A consensus problem in which the agreement value is a distributed estimation of some non-constant quantity of interest is referred to as a dynamic consensus. In practical applications an effective network architecture to support sensing and communication between agents is based on a Wireless Sensor Network (WSN). This paper deals with the design of a fast dynamic consensus algorithm when it is implemented over the WSN. A sufficient stability condition of the dynamic consensus algorithm in the presence of heterogeneous time delays affecting communication through the multi hops of the WSN is introduced and used for consensus algorithm gain design. Moreover, the algorithm implementation by the standard AODV routing protocol is discussed and the best parameter setting to reduce the effect of packet collision phenomena on the performance of the consensus algorithm is indicated. Several trade-offs between network parameter setting, sensor node technology selection and application performance have to be taken into account by the designer in the implementation of the dynamic consensus algorithm. A representative simulation based design procedure is presented to validate through realistic simulation experiments the proposed design approach. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Dynamic consensus Wireless sensor networks Stability algorithm design AODV protocol Zig-Bee protocol

来源：评论

学校读者我要写书评

暂无评论

design of coverage algorithm for mobile sensor networks based on virtual molecular force

引用

COMPUTER COMMUNICATIONS 2020年第0期150卷 269-277页

作者： Liu, Song Zhang, Runlan Shi, Yongheng Guizhou Normal Univ Key Lab Informat & Comp Sci Guiyang 550003 Peoples R China Guizhou Vocat Technol Inst Informat Technol Coll Guiyang 550023 Peoples R China

General virtual force algorithm, when the density of sensor nodes is large in the monitoring area, there are some shortcomings, such as uneven distribution of nodes, more overlap of coverage area and so on. In view of these shortcomings, based on the basic idea of air molecular theory, a virtual molecular force model of mobile sensor networks is established, and the virtual molecular force algorithm for node deployment and mobile coverage of mobile sensor networks is given. The virtual molecular force algorithm assumes that there is interaction between nodes in mobile sensor networks, and the resultant force of these forces constitutes the resultant force network of sensor nodes in the monitoring area, which drives the sensor nodes to move to the corresponding location to repair the monitoring blind area, so as to maximize the coverage of the network. In order to verify the feasibility and effectiveness of the virtual molecular force algorithm, the virtual molecular force algorithm for mobile sensor network node deployment and mobile coverage is simulated and analysed by using MATLAB simulation tool. The simulation results show that the virtual molecular force algorithm can make the sensor nodes repair the monitoring blind area efficiently and quickly, and maximize the monitoring coverage area of the sensor network. In terms of repairing monitoring blind areas and improving network coverage, the virtual molecular force algorithm is superior to other network coverage algorithms such as general virtual force algorithm.

关键词： Mobile sensor network Network coverage Monitoring blind area algorithm design Simulation

来源：评论

学校读者我要写书评

暂无评论

Logarithmic Weighted Random Selector algorithm: A Novel Approach for Biasing Selection Based on Positional Order Without Hyperparameters 17th

Logarithmic Weighted Random Selector Algorithm: A Novel Appr...

引用

17th Workshop of Hybrid Intelligent Systems, HIS 2024, 17th Workshop on Intelligent Learning Environments, WILE 2024 and 6th Workshop on New Trends in Computational Intelligence and Applications, CIAPP 2024, held in conjunction with Mexican International Conference on Artificial Intelligence, MICAI 2024

作者： Ramos Herrera, Iván Alejandro Autonomous University of Aguascalientes Aguascalientes Mexico

ISBN: (纸本)9783031838781

The "Logarithmic Weighted Random Selector" (LWRS) introduces a novel algorithm designed for selecting randomly one item from a list, with the bias that the further to the beginning of the list each one is, the more likely it is to be selected. Unlike traditional selection and sampling methods that rely on numerical fitness scores or require hyperparameter tuning, LWRS employs a logarithmic weighting mechanism to naturally favor items based on their position. It arose from the problem of requiring a method that allows weighting a selection based on the order of preference on a list of elements, for phenomena for which numerical weighting values are unknown but only their order, which unlike algorithms such as Rank-based Selection, does not require configuration of hyperparameters. Different mechanisms were explored, such as a Linear Selection method and Exponential Selection. Discovering that utilizing a logarithmic scale, LWRS achieves a non-numerical preference bias, distinguishing itself from classic methods of weighted random sampling as Fitness-proportionate selection and Tournament Selection, which do require defined numerical weights, contributing to the field with a straightforward, parameter-free approach to weighted random selection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： algorithm design Computer Science Evolutionary Computing Random Sampling Randomized algorithm Selection Method

来源：评论

学校读者我要写书评

暂无评论

design of cloud computing task offloading algorithm based on dynamic multi-objective evolution

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2021年 122卷 144-148页

作者： Hu, Su Xiao, Yinhao Guangdong Univ Finance & Econ Sch Informat Sci Guangzhou 510320 Guangdong Peoples R China

The traditional cloud computing task offloading algorithm consumes abundant energy in task scheduling, which results in a longer average task waiting time. For this reason, a cloud computing task offloading algorithm based on dynamic multi-objective evolution is proposed in this research. In order to ensure the parallel completion of multiple tasks, the dynamic multi-objective evolution method is used to construct the cloud computing task scheduling model and complete the cloud computing task scheduling. Then, based on the calculated effectiveness and validity of energy consumption to complete the initial operation distribution and offloading priority, the time and cost of task offloading are calculated according to the raking results of task offloading priority. The cloud computing tasks are distributed with minimum time and minimum cost as the goal. At the same time, the trade-off coefficients of all utility parameters are effectively combined and dynamically adjusted according to the battery capacity of mobile terminal, in order to achieve the offloading of cloud computing tasks. The average task carrying time, average task waiting time and average task completion time are selected as the parameters to evaluate the algorithm performance. The experimental results show that compared with the existing algorithms, the proposed algorithm shows the best performance, which fully proves the feasibility of the proposed algorithm. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Dynamic multi-objective evolution Cloud computing Computing task Offloading algorithm design

来源：评论

学校读者我要写书评

暂无评论

A design Method of Children Playground Based on Bionic algorithm

A Design Method of Children Playground Based on Bionic Algor...

引用

23rd International Conference on Human-Computer Interaction (HCII)

作者： Yue, Fei Tian, Wenda Shidujaman, Mohammad Tsinghua Univ Acad Arts & Design Beijing 100030 Peoples R China

ISBN: (纸本)9783030784683;9783030784676

A reasonable and healthy playground is an important guarantee for children to develop cognition through physical games. H However, due to the influence of early childhood psychology and the popularity of stereotypes, the existing industrialized production of children's play space has been defined and designed from the perspective of adults. With the help of interdisciplinary thinking and tools, based on the theory of child psychology and the circular game system, we propose a new method of children's playground design. At first, we reviewed the fallacies of the past children's playground design and their causes and summarized the elements of ideal children's playground construction. Secondly, we introduced the Physarum polycephalum algorithm and brought this algorithm to the path generation of different terrains and environments. Third, we analyze the path and introduce the amoeba bionic algorithm tool to determine the facilities, and then generate a series of play facilities. Finally, we brought this result into the case and discussed its potential applications in interactive design.

关键词： Space design Child-playground interaction algorithm design Children psychology Interactive design

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：