期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到5篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Admissible Heuristic Design for Optimally Scheduling Resource Allocation Systems With Generalized Timed Petri Nets 认领 引用
1
作者 Yuanzheng Xiao Yangqing Gao +1 位作者 Haoran Wu Bo Huang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第7期1572-1583,共12页
The heuristic function in Petri-net-based A*search directly influences both the search efficiency and solution quality for scheduling resource allocation systems(RASs).In the literature,some heuristic functions have b... The heuristic function in Petri-net-based A*search directly influences both the search efficiency and solution quality for scheduling resource allocation systems(RASs).In the literature,some heuristic functions have been proposed,but most of them fail to consider key aspects such as token remaining time,alternative routes,weighted arcs,multiple resource copies,and batch processing ability,which are common in the place-timed Petri nets(PNs)for RASs.This paper proposes two novel heuristic functions.Both are admissible,guaranteeing the optimality of the obtained schedules.In addition,they are designed not only for ordinary PNs but also for generalized ones,which may have arc weights greater than one.They can effectively handle RAS PNs with alternative routes,weighted arcs,multiple resource copies,and batch processing capability.Most importantly,the new heuristics,especially the second one,are highly informed,leading to faster searches for optimal schedules compared to existing heuristics for generalized PNs.Experiments on several benchmark PNs of RASs have been conducted to demonstrate the effectiveness and efficiency of our methods. 展开更多
关键词 A*search heuristic function resource allocation system scheduling timed Petri net
暂未订购 下载PDF
Improved Bidirectional JPS Algorithm for Mobile Robot Path Planning in Complex Environments 认领 引用
2
作者 Zhaohui An Changyong Li +1 位作者 Yong Han Mengru Niu 《Computers, Materials & Continua》 SCIE EI 2025年第4期1347-1366,共20页
This paper introduces an Improved Bidirectional Jump Point Search(I-BJPS)algorithm to address the challenges of the traditional Jump Point Search(JPS)in mobile robot path planning.These challenges include excessive no... This paper introduces an Improved Bidirectional Jump Point Search(I-BJPS)algorithm to address the challenges of the traditional Jump Point Search(JPS)in mobile robot path planning.These challenges include excessive node expansions,frequent path inflexion points,slower search times,and a high number of jump points in complex environments with large areas and dense obstacles.Firstly,we improve the heuristic functions in both forward and reverse directions to minimize expansion nodes and search time.We also introduce a node optimization strategy to reduce non-essential nodes so that the path length is optimized.Secondly,we employ a second-order Bezier Curve to smooth turning points,making generated paths more suitable for mobile robot motion requirements.Then,we integrate the Dynamic Window Approach(DWA)to improve path planning safety.Finally,the simulation results demonstrate that the I-BJPS algorithm significantly outperforms both the original unidirectional JPS algorithm and the bidirectional JPS algorithm in terms of search time,the number of path inflexion points,and overall path length,the advantages of the I-BJPS algorithm are particularly pronounced in complex environments.Experimental results from real-world scenarios indicate that the proposed algorithm can efficiently and rapidly generate an optimal path that is safe,collision-free,and well-suited to the robot’s locomotion requirements. 展开更多
关键词 Bidirectional jump search heuristic function bezier curve dynamic window method path planning
暂未订购 下载PDF
A dependency matrix processing algorithm to prioritize high incidence faults 认领 引用
3
作者 ZHANG Jiashuo CHEN Derong +2 位作者 GAO Peng ZHANG Jin’gang ZHANG Yulong 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2025年第4期962-971,共10页
The operational readiness test(ORT),like weapon testing before firing,is becoming more and more important for systems used in the field.However,the test requirement of the ORT is distinctive.Specifically,the rule of s... The operational readiness test(ORT),like weapon testing before firing,is becoming more and more important for systems used in the field.However,the test requirement of the ORT is distinctive.Specifically,the rule of selecting test items should be changed in different test turns,and whether there is a fault is more important than where the fault is.The popular dependency matrix(D-matrix)processing algorithms becomes low efficient because they cannot change their optimizing direc-tion and spend unnecessary time on fault localization and isola-tion.To this end,this paper proposes a D-matrix processing algorithm named piecewise heuristic algorithm for D-matrix(PHAD).Its key idea is to use a piecewise function comprised of multiple different functions instead of the commonly used fixed function and switch subfunctions according to the test stage.In this manner,PHAD has the capability of changing optimizing direction,precisely matching the variant test requirements,and generating an efficient test sequence.The experiments on the random matrixes of different sizes and densities prove that the proposed algorithm performs better than the classical algo-rithms in terms of expected test cost(ETC)and other metrics.More generally,the piecewise heuristic function shows a new way to design D-matrix processing algorithm and a more flexi-ble heuristic function to meet more complicated test requirements. 展开更多
关键词 fault diagnosis heuristic function operational readi-ness test piecewise function testability.
暂未订购 下载PDF
Fishery Web Service Composition Method Based on Ontology 认领 引用 被引量：1
4
作者 YU Qing-mei WANG Lan HUANG Dong-mei 《Journal of Integrative Agriculture》 SCIE CAS CSCD 2012年第5期792-799,共8页
Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. I... Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. In the present paper, a heuristic web service composition method based on fishery ontology is presented, and the proposed web services are described. Ontology reasoning capability was applied to generate a service composition graph. The heuristic function was introduced to reduce the searching space. The experimental results show that the algorithm used considers the services semantic similarity and adiusts web service composition plan by dynamically relying on the empirical data. 展开更多
关键词 web services composition semantic similarity fishery ontology heuristic function
暂未订购 下载PDF
The analysis of the convergence of ant colony optimization algorithm 认领 引用
5
作者 ZHU Qingbao WANG Lingling 《Frontiers of Electrical and Electronic Engineering in China》 2007年第3期268-272,共5页
The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which w... The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which will influence the improvement of this algorithm.Therefore,the convergence of this algorithm applied to the traveling salesman problem(TSP)was analyzed in detail.The conclusion that this algorithm will definitely converge to the optimal solution under the condition of 0<q0<1 was proved true.In addition,the influence on its convergence caused by the properties of the closed path,heuristic functions,the pheromone and q0 was analyzed.Based on the above-mentioned,some conclusions about how to improve the speed of its convergence are obtained. 展开更多
关键词 ant colony optimization algorithm convergence analysis heuristic function TSP
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈