期刊文献+
共找到35,326篇文章
< 1 2 250 >
每页显示 20 50 100
RRT^(*)-GSQ:A hybrid sampling path planning algorithm for complex orchard scenarios
1
作者 ZHU Qingzhen ZHAO Jiamuyang +1 位作者 DAI Xu YU Yang 《农业工程学报》 北大核心 2026年第3期13-25,共13页
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr... Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications. 展开更多
关键词 ROBOT path planning ORCHARD improved RRT^(*)algorithm Gaussian sampling autonomous navigation
在线阅读 下载PDF
基于FDS和Pathfinder的矿井火灾疏散路径规划研究
2
作者 祁云 董心悦 +3 位作者 李绪萍 祁意卿 彭涛 薛凯隆 《矿业科学学报》 北大核心 2026年第1期183-193,共11页
为研究煤矿井下火灾环境中的人员疏散路径规划问题,以山西某矿区为研究对象,运用火灾动力学模拟器(FDS)对2种矿井火灾场景(工况1和工况2)进行数值模拟,获取了烟气层高度、温度、能见度及CO浓度等关键危害参数的动态演变规律。基于此,将... 为研究煤矿井下火灾环境中的人员疏散路径规划问题,以山西某矿区为研究对象,运用火灾动力学模拟器(FDS)对2种矿井火灾场景(工况1和工况2)进行数值模拟,获取了烟气层高度、温度、能见度及CO浓度等关键危害参数的动态演变规律。基于此,将烟气危害参数与巷道固有通行难易系数耦合,建立巷道当量长度计算模型,并引入Dijkstra算法,综合烟气影响规划出最佳疏散路径。最后,采用人员疏散模拟软件(Pathfinder)对所规划路径的有效性进行模拟验证。结果表明:在2种火灾场景下,各工作面最佳疏散路径的当量长度与最短疏散时间均得到量化。具体而言,工况1的路径当量长度分别为3298.8和956.9 m,对应最短疏散时间分别为1595.8和405.8 s;工况2的路径当量长度分别为3927.2和2332.4 m,对应最短疏散时间分别为1364.8和786.8 s。最佳疏散路径的计算结果与Pathfinder模拟结果一致,验证了基于巷道当量长度的路径规划方法的科学性。研究结果为应对复杂矿井火灾环境,提供了一套理论严密且可直接应用于工程实践的应急疏散解决方案。 展开更多
关键词 矿井火灾 FDS 巷道当量长度 路径规划 pathFINDER
在线阅读 下载PDF
Improved simulated annealing algorithm for UAV path planning with uncertain flight time
3
作者 LI Xiaoduo LUO He +1 位作者 WANG Guoqiang YIN Youlong 《Journal of Systems Engineering and Electronics》 2026年第1期272-286,共15页
Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always ... Efficient multiple unmanned aerial vehicles(UAVs)path planning is crucial for improving mission completion efficiency in UAV operations.However,during the actual flight of UAVs,the flight time between nodes is always influenced by external factors,making the original path planning solution ineffective.In this paper,the multi-depot multi-UAV path planning problem with uncertain flight time is modeled as a robust optimization model with a budget uncertainty set.Then,the robust optimization model is transformed into a mixed integer linear programming model by the strong duality theorem,which makes the problem easy to solve.To effectively solve large-scale instances,a simulated annealing algorithm with a robust feasibility check(SA-RFC)is developed.The numerical experiment shows that the SA-RFC can find high-quality solutions within a few seconds.Moreover,the effect of the task location distribution,depot counts,and variations in robustness parameters on the robust optimization solution is analyzed by using Monte Carlo experiments.The results demonstrate that the proposed robust model can effectively reduce the risk of the UAV failing to return to the depot without significantly compromising the profit. 展开更多
关键词 unmanned aerial vehicle(UAV)path planning uncertain flight time robust optimization simulated annealing
在线阅读 下载PDF
Hybrid path planning for USVs using improved A^(*)and DWA
4
作者 WANG Guangwei YANG Le +2 位作者 TAN Zhikun LI Yichen YU Wenbin 《Journal of Systems Engineering and Electronics》 2026年第1期45-63,共19页
A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirement... A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method. 展开更多
关键词 multiple dynamic obstacles A^(*)algorithm dynamic window approach(DWA) unmanned surface vehicle(USV) path planning collision avoidance
在线阅读 下载PDF
Hierarchical cooperative path planning method using three-dimensional velocity-obstacle strategy for multiple fixed-wing UAVs
5
作者 ZHOU Zhenlin LONG Teng +1 位作者 SUN Jingliang LI Junzhi 《Journal of Systems Engineering and Electronics》 2025年第5期1342-1352,共11页
A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path... A three-dimensional path-planning approach has been developed to coordinate multiple fixed-wing unmanned aerial vehicles(UAVs)while avoiding collisions.The hierarchical path-planning architecture that divides the path-planning process into two layers is proposed by designing the velocityobstacle strategy for satisfying timeliness and effectiveness.The upper-level layer focuses on creating an efficient Dubins initial path considering the dynamic constraints of the fixed wing.Subsequently,the lower-level layer detects potential collisions and adjusts its flight paths to avoid collisions by using the threedimensional velocity obstacle method,which describes the maneuvering space of collision avoidance as the intersection space of half space.To further handle the dynamic and collisionavoidance constraints,a priority mechanism is designed to ensure that the adjusted path is still feasible for fixed-wing UAVs.Simulation experiments demonstrate the effectiveness of the proposed method. 展开更多
关键词 three-dimensional path planning Dubins path method velocity obstacle collision avoidance
在线阅读 下载PDF
AUV 3D path planning based on improved PSO 被引量:1
6
作者 LI Hongen LI Shilong +1 位作者 WANG Qi HUANG Xiaoming 《Journal of Systems Engineering and Electronics》 2025年第3期854-866,共13页
The influence of ocean environment on navigation of autonomous underwater vehicle(AUV)cannot be ignored.In the marine environment,ocean currents,internal waves,and obstacles are usually considered in AUV path planning... The influence of ocean environment on navigation of autonomous underwater vehicle(AUV)cannot be ignored.In the marine environment,ocean currents,internal waves,and obstacles are usually considered in AUV path planning.In this paper,an improved particle swarm optimization(PSO)is proposed to solve three problems,traditional PSO algorithm is prone to fall into local optimization,path smoothing is always carried out after all the path planning steps,and the path fitness function is so simple that it cannot adapt to complex marine environment.The adaptive inertia weight and the“active”particle of the fish swarm algorithm are established to improve the global search and local search ability of the algorithm.The cubic spline interpolation method is combined with PSO to smooth the path in real time.The fitness function of the algorithm is optimized.Five evaluation indexes are comprehensively considered to solve the three-demensional(3D)path planning problem of AUV in the ocean currents and internal wave environment.The proposed method improves the safety of the path planning and saves energy. 展开更多
关键词 autonomous underwater vehicle(AUV) three-dimensional(3D)path planning particle swarm optimization(PSO) cubic spline interpolation
在线阅读 下载PDF
Fault-tolerant control for diesel engine air path system via sliding mode surface
7
作者 WU Wen-jie ZHANG Yi-xin +4 位作者 WANG Xing-jian WANG Shao-ping ZHANG Jian ZHENG Wei TAO Mo 《控制理论与应用》 北大核心 2025年第8期1570-1577,共8页
The operating environment of the diesel engine air path system is complex and may be affected by external random disturbances.Potentially leading to faults.This paper addresses the fault-tolerant control problem of th... The operating environment of the diesel engine air path system is complex and may be affected by external random disturbances.Potentially leading to faults.This paper addresses the fault-tolerant control problem of the diesel engine air path system,assuming that the system may simultaneously be affected by actuator faults and external random disturbances,a disturbance observer-based sliding mode controller is designed.Through the linear matrix inequality technique for solving observer and controller gains,optimal gain matrices can be obtained,eliminating the manual adjustment process of controller parameters and reducing the chattering phenomenon of the sliding mode surface.Finally,the effectiveness of the proposed method is verified through simulation analysis. 展开更多
关键词 disel engine air path fault-tolerant control sliding mode control disturbance observer
在线阅读 下载PDF
Research on variable-speed scanning method for airborne area-array whiskbroom imaging system based on vertical flight path correction
8
作者 JIN Jia-Rong HAN Gui-Cheng +2 位作者 ANG Chong-Ru WU Ren-Fei WANG Yue-Ming 《红外与毫米波学报》 北大核心 2025年第4期511-519,共9页
Airborne area-array whisk-broom imaging systems typically adopt constant-speed scanning schemes.For large-inertia scanning systems,constant-speed scanning requires substantial time to complete the reversal motion,redu... Airborne area-array whisk-broom imaging systems typically adopt constant-speed scanning schemes.For large-inertia scanning systems,constant-speed scanning requires substantial time to complete the reversal motion,reducing the system's adaptability to high-speed reversal scanning and decreasing scanning efficiency.This study proposes a novel sinusoidal variable-speed roll scanning strategy,which reduces abrupt changes in speed and acceleration,minimizing time loss during reversals.Based on the forward image motion compensation strategy in the pitch direction,we establish a line-of-sight(LOS)position calculation model with vertical flight path correction(VFPC),ensuring that the central LOS of the scanned image remains stable on the same horizontal line,facilitating accurate image stitching in whisk-broom imaging.Through theoretical analysis and simulation experiments,the proposed method improves the scanning efficiency by approximately 18.6%at a 90o whiskbroom imaging angle under the same speed height ratio conditions.The new VFPC method enables wide-field,high-resolution imaging,achieving single-line LOS horizontal stability with an accuracy of better than O.4 mrad.The research is of great significance to promote the further development of airborne area-array whisk-broom imaging technology toward wider fields of view,higher speed height ratios,and greater scanning efficiency. 展开更多
关键词 airborne remote sensing whisk-broom imaging image motion vertical flight path correction(VFPC) line-of-sight(LOS)stabilization
在线阅读 下载PDF
基于PHAST和Pathfinder的化工厂液氨泄漏事故应急疏散模拟
9
作者 程方明 刘标标 +2 位作者 牛巧霞 罗振敏 南凡 《计算机应用与软件》 北大核心 2025年第12期78-85,共8页
毒气泄漏事故严重威胁人员生命安全,基于仿真模拟探究化工厂泄漏事故人员精准疏散对保障场内人员安全具有重要意义。利用PHAST软件分析不同风向条件下液氨泄漏危险区域分布范围,通过pathfinder软件开展人员应急疏散仿真模拟,以化工厂液... 毒气泄漏事故严重威胁人员生命安全,基于仿真模拟探究化工厂泄漏事故人员精准疏散对保障场内人员安全具有重要意义。利用PHAST软件分析不同风向条件下液氨泄漏危险区域分布范围,通过pathfinder软件开展人员应急疏散仿真模拟,以化工厂液氨泄漏事故应急疏散为例,确定存在疏散危险性的区域边界和有效预警发布时间,对不同风向条件下疏散路径方案的安全性进行研判,可提出不同场景下泄漏事故疏散路径优化方案,并进行仿真验证和效果分析。算例分析结果表明:该厂液氨泄漏后有效预警发布时间应在8.1 s内;路径优化前人员疏散需168 s;优化后疏散时间缩短了43 s,利用PHAST和Pathfinder软件进行疏散路径仿真可为优化疏散路径提供可靠依据,有效提高疏散安全性。 展开更多
关键词 液氨泄漏 仿真模拟 疏散 PHAST pathFINDER 路径优化
在线阅读 下载PDF
A multi-parametric path planning framework utilizing airspace visibility graphs for urban battlefield environments
10
作者 Sidao Chen Xuejun Zhang +1 位作者 Zuyao Zhang Jianxiang Ma 《Defence Technology(防务技术)》 2025年第9期112-126,共15页
Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threat... Urban combat environments pose complex and variable challenges for UAV path planning due to multidimensional factors,such as static and dynamic obstructions as well as risks of exposure to enemy detection,which threaten flight safety and mission success.Traditional path planning methods typically depend solely on the distribution of static obstacles to generate collision-free paths,without accounting for constraints imposed by enemy detection and strike capabilities.Such a simplified approach can yield safety-compromising routes in highly complex urban airspace.To address these limitations,this study proposes a multi-parameter path planning method based on reachable airspace visibility graphs,which integrates UAV performance constraints,environmental limitations,and exposure risks.An innovative heuristic algorithm is developed to balance operational safety and efficiency by both exposure risks and path length.In the case study set in a typical mixed-use urban area,analysis of airspace visibility graphs reveals significant variations in exposure risk at different regions and altitudes due to building encroachments.Path optimization results indicate that the method can effectively generate covert and efficient flight paths by dynamically adjusting the exposure index,which represents the likelihood of enemy detection,and the path length,which corresponds to mission execution time. 展开更多
关键词 UAV path planning Urban battlefield environment Airspace visibility graph ISOVIST
在线阅读 下载PDF
Multi-platform collaborative MRC-PSO algorithm for anti-ship missile path planning
11
作者 LIU Gang GUO Xinyuan +2 位作者 HUANG Dong CHEN Kezhong LI Wu 《Journal of Systems Engineering and Electronics》 2025年第2期494-509,共16页
To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO al... To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality. 展开更多
关键词 anti-ship missiles multi-platform collaborative path planning particle swarm optimization(PSO)algorithm
在线阅读 下载PDF
Multiple fixed-wing UAVs collaborative coverage 3D path planning method for complex areas
12
作者 Mengyang Wang Dong Zhang +1 位作者 Chaoyue Li Zhaohua Zhang 《Defence Technology(防务技术)》 2025年第5期197-215,共19页
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV... Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments. 展开更多
关键词 Multi-fixed-wing UAVs(multi-UAV) Minimum time cooperative coverage Dynamic complete coverage path planning(DCCPP) Dubins curves Improved dynamic programming algorithm(IDP)
在线阅读 下载PDF
基于Dual-Path Skip-Transformer的轻量级语音增强网络 被引量:1
13
作者 琚吴涵 孙成立 +2 位作者 陈飞龙 丁碧云 郭桥生 《计算机工程与应用》 北大核心 2025年第15期209-217,共9页
解耦式语音增强方法将语音去噪任务解耦为幅度估计与复频谱估计两个子任务,可以获得比传统幅度谱语音增强更好的效果。Transformer由于其捕获长距离依赖关系的能力,成为解耦式语音增强模型的关键组件。然而,Transformer较高的计算复杂... 解耦式语音增强方法将语音去噪任务解耦为幅度估计与复频谱估计两个子任务,可以获得比传统幅度谱语音增强更好的效果。Transformer由于其捕获长距离依赖关系的能力,成为解耦式语音增强模型的关键组件。然而,Transformer较高的计算复杂度限制了其在边缘设备的应用。提出了一种解耦式语音增强网络DPST-SENet(dualpath skip-Transformer speech enhancement network)。具体而言,DPST-SENet能够在幅度分支中抑制主要噪声分量,同时在复频谱分支中消除残余噪声并隐式增强相位信息。该网络引入Dual-Path Skip-Transformer模块,它能有效重用Dual-Path Transformer模块建模的信息,在降低参数量和计算复杂度的同时保持出色的性能。实验结果表明,DPST-SENet在48 kHz全频带语音数据集VoiceBank+DEMAND上的语音质量感知评估(perceptual evaluation of speech quality,PESQ)得分为3.16,优于ICASSP 2022深度噪声抑制挑战赛冠军模型MTFAA,且模型参数更少。 展开更多
关键词 语音增强 全频带 双路径网络 并行去噪 轻量化
在线阅读 下载PDF
资源型省份碳排放驱动力分析——基于PATH-STIRPAT模型的实证研究 被引量:8
14
作者 徐丽娜 赵涛 杨晓峰 《中国科技论坛》 CSSCI 北大核心 2013年第12期52-58,共7页
本文选取山西省作为资源型省份的代表,运用PATH-STIRPAT模型,基于1990—2010年的时间序列数据,实证分析资源型省份碳排放的驱动力。结果表明:人口、富裕度、产业结构、能源效率、城市化是资源型省份碳排放的主要影响因素。
关键词 资源型省份 碳排放 驱动因素 path—STIRPAT模型
在线阅读 下载PDF
基于最优Path的Ad Hoc网络地理路由算法 被引量:2
15
作者 于坤 吴国新 +1 位作者 许立波 吴鹏 《计算机研究与发展》 EI CSCD 北大核心 2007年第12期2004-2011,共8页
对基于地理信息的自组网路由中的凹节点问题做了分析,并提出了一种新的解决方案——PGA算法及其改进算法.算法采用了最优Path的思想,在Path构造、基于Path的最优寻路、路由恢复等多个方面都应用了最优Path的概念,较好地解决了凹节点的问... 对基于地理信息的自组网路由中的凹节点问题做了分析,并提出了一种新的解决方案——PGA算法及其改进算法.算法采用了最优Path的思想,在Path构造、基于Path的最优寻路、路由恢复等多个方面都应用了最优Path的概念,较好地解决了凹节点的问题.通过证明,该算法具有无环性,从而实现了基于局部路由信息的无状态路由,展示了算法的可扩展性和易维护性.实验表明,即使在大型网络中,算法依然可以保持很高的报文投递率、较短的路径长度、可接受的路由表大小及可控的协议带宽开销,同时该路由算法在动态环境中具有较强的鲁棒性. 展开更多
关键词 自组网 路由算法 PGA算法 最优path 凹节点
在线阅读 下载PDF
疏散模拟软件STEPS与Pathfinder对比研究 被引量:46
16
作者 杜长宝 朱国庆 李俊毅 《消防科学与技术》 CAS 北大核心 2015年第4期456-460,共5页
为了了解两款疏散模拟软件STEPS与Pathfinder的功能差异及适用范围,采用理论研究与实际模拟相结合的方法进行对比分析。研究发现:STEPS软件采用元胞自动机(CA)模型,疏散规则简单,人员智能化程度低,疏散时人员行为特征与现实情况不完全相... 为了了解两款疏散模拟软件STEPS与Pathfinder的功能差异及适用范围,采用理论研究与实际模拟相结合的方法进行对比分析。研究发现:STEPS软件采用元胞自动机(CA)模型,疏散规则简单,人员智能化程度低,疏散时人员行为特征与现实情况不完全相符,但路径决策系统很好地解决了上述问题,可以真实地模拟常态下人员疏散;Pathfinder软件采用Agent-based模型,人员智能化程度高,个体可以回应环境刺激,人员可以轻松规避障碍物,人群中的个体行为特征丰富且与现实情况十分相符,但在出口选择上存在缺陷,人员只能选择前方的出口而忽略后方的出口,不能模拟常态下的人员疏散。分析得出,Pathfinder模拟结果与真实情况相符程度更高,STEPS更适合模拟常态下人员疏散。 展开更多
关键词 安全疏散 STEPS 元胞自动机 pathFINDER Agent-base
在线阅读 下载PDF
基于Pathfinder算法的领域知识交流主路径发现研究 被引量:17
17
作者 马瑞敏 张欣 《情报学报》 CSSCI 北大核心 2016年第8期856-863,共8页
在重新界定主路径概念的基础上,针对概念中三大核心要素——重要节点、最大信息承载量和关键关系,构建了基于Pathfinder算法的领域知识交流主路径发现的技术路线。比较了与其它两种主流主路径发现方法——SPC和GK-R的区别。结果证明,Pat... 在重新界定主路径概念的基础上,针对概念中三大核心要素——重要节点、最大信息承载量和关键关系,构建了基于Pathfinder算法的领域知识交流主路径发现的技术路线。比较了与其它两种主流主路径发现方法——SPC和GK-R的区别。结果证明,Pathfinder相较其它发现方法具有一定的优越性——更具综合性和包含性,是一种探测领域知识交流主路径有效方法。 展开更多
关键词 pathFINDER 主路径 发展轨迹 知识交流
在线阅读 下载PDF
MPC-based path tracking with PID speed control for high-speed autonomous vehicles considering time-optimal travel 被引量:35
18
作者 CHEN Shu-ping XIONG Guang-ming +1 位作者 CHEN Hui-yan NEGRUT Dan 《Journal of Central South University》 SCIE EI CAS CSCD 2020年第12期3702-3720,共19页
In order to track the desired path as fast as possible,a novel autonomous vehicle path tracking based on model predictive control(MPC)and PID speed control was proposed for high-speed automated vehicles considering th... In order to track the desired path as fast as possible,a novel autonomous vehicle path tracking based on model predictive control(MPC)and PID speed control was proposed for high-speed automated vehicles considering the constraints of vehicle physical limits,in which a forward-backward integration scheme was introduced to generate a time-optimal speed profile subject to the tire-road friction limit.Moreover,this scheme was further extended along one moving prediction window.In the MPC controller,the prediction model was an 8-degree-of-freedom(DOF)vehicle model,while the plant was a 14-DOF vehicle model.For lateral control,a sequence of optimal wheel steering angles was generated from the MPC controller;for longitudinal control,the total wheel torque was generated from the PID speed controller embedded in the MPC framework.The proposed controller was implemented in MATLAB considering arbitrary curves of continuously varying curvature as the reference trajectory.The simulation test results show that the tracking errors are small for vehicle lateral and longitudinal positions and the tracking performances for trajectory and speed are good using the proposed controller.Additionally,the case of extended implementation in one moving prediction window requires shorter travel time than the case implemented along the entire path. 展开更多
关键词 model predictive control path tracking minimum-time speed profile vehicle dynamics arbitrary path
在线阅读 下载PDF
基于XPath路径的Web应用测试脚本修复 被引量:6
19
作者 王曙燕 王璇 孙家泽 《计算机应用研究》 CSCD 北大核心 2017年第5期1393-1396,共4页
基于Web的应用程序版本更新频繁,生成新的测试脚本集代价昂贵,因此修复旧的测试脚本集是最佳的选择。针对由于Web应用页面结构的改变而导致旧的测试脚本集执行时发生错误的问题,提出了一种修复失效的测试脚本的方法。该方法利用Selenium... 基于Web的应用程序版本更新频繁,生成新的测试脚本集代价昂贵,因此修复旧的测试脚本集是最佳的选择。针对由于Web应用页面结构的改变而导致旧的测试脚本集执行时发生错误的问题,提出了一种修复失效的测试脚本的方法。该方法利用Selenium IDE录制旧版本应用程序的测试脚本,在新版本的应用上回放旧的测试脚本,生成错误的测试报告;根据报告中每条失效脚本的XPath和value信息,通过遍历新旧应用网页差异文档对象化模型解析树(DOM tree),找到替换失效脚本的路径或value值,从而修复失效的测试脚本。实验结果表明,该方法对修复失效测试脚本是可行和有效的。 展开更多
关键词 Xpath路径 SeleniumIDE WEB应用程序 DOMtree 测试脚本修复
在线阅读 下载PDF
矩阵的k-path覆盖对角占优性与应用 被引量:4
20
作者 林彤 杜宇辉 术洪亮 《东北师大学报(自然科学版)》 CAS CSCD 北大核心 2008年第4期1-6,共6页
引进了k-path覆盖对角占优矩阵,研究了它的性质,给出了广义对角占优矩阵的新表征,推广、改进、修正了一些关于广义严格对角占优矩阵判定的已有结果.
关键词 κ-path覆盖对角占优矩阵 广义严格对角占优矩阵 M-矩阵
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部