期刊文献+
共找到1,323篇文章
< 1 2 67 >
每页显示 20 50 100
应急情景下融合改进D^(*)Lite算法和DWA算法的无人驾驶汽车路径规划 被引量:1
1
作者 刘连玉 巩在武 +1 位作者 张雪 吴穹 《控制与决策》 北大核心 2025年第10期2985-2994,共10页
针对传统路径规划算法在无人驾驶应急场景中存在的环境建模失真、路径搜索效率以及安全性不足等局限,提出一种基于高精度城市电子地图的“全局-局部”耦合路径规划框架.该框架通过融合改进D^(*)Lite算法和动态窗口法(DWA),能够实现全局... 针对传统路径规划算法在无人驾驶应急场景中存在的环境建模失真、路径搜索效率以及安全性不足等局限,提出一种基于高精度城市电子地图的“全局-局部”耦合路径规划框架.该框架通过融合改进D^(*)Lite算法和动态窗口法(DWA),能够实现全局路径动态优化与局部避障协同控制.在全局规划中,使用五邻域搜索策略替代八邻域搜索,可有效避免路径曲折问题;同时,结合风险系数构造多目标代价函数,能够显著降低路径累积风险值.在局部规划中,设计一种基于风险感知机制的动态评价函数,增强局部避障的实时性和安全性.仿真结果表明,与现有文献相比,所提出耦合算法在路径规划效率、路径安全性、平滑度等方面均有显著的提升.进一步地,通过交通事故规避、突发乘客需求响应等典型应急场景验证所提出算法的鲁棒性,为无人驾驶安全行驶提供了理论支持. 展开更多
关键词 无人驾驶 应急路径规划 “全局-局部”耦合算法 d^(*)lite算法 动态窗口法
原文传递
基于新型贪心-D^(*)算法的无人机全覆盖路径规划
2
作者 周映江 谢明慧 +2 位作者 蒋国平 徐丰羽 高辉 《南京邮电大学学报(自然科学版)》 北大核心 2026年第1期111-123,共13页
针对动态未知环境中全覆盖路径规划面临的路径冗余率高和环境适应性差等难题,提出一种基于新型贪心-D^(*)算法(Novel Greedy-D^(*)Algorithm,NG-D^(*))的无人机全覆盖路径规划。首先,构建动态增量式环境建模系统,实现障碍物分布实时更... 针对动态未知环境中全覆盖路径规划面临的路径冗余率高和环境适应性差等难题,提出一种基于新型贪心-D^(*)算法(Novel Greedy-D^(*)Algorithm,NG-D^(*))的无人机全覆盖路径规划。首先,构建动态增量式环境建模系统,实现障碍物分布实时更新与矩阵化栅格状态精准映射,增强系统环境感知能力。其次,设计最小值优先三元组贪心决策函数,通过评估曼哈顿距离、横向优先级与纵向优先级,生成结构化有序覆盖路径。最后,引入关键节点导向D^(*)逃离算法,在检测到局部死区时高效规划平滑脱离路径。实验结果表明,相较于传统方法,NG-D^(*)算法在保持覆盖完整性的前提下,将路径冗余率降低至3.0%以下。 展开更多
关键词 d^(*)算法 贪心策略 全覆盖路径规划 未知环境 无人机
在线阅读 下载PDF
基于D^(*)DWA的水面无人艇路径规划
3
作者 段求辉 《控制工程》 北大核心 2026年第1期129-134,共6页
针对水面无人艇在动态环境下的路径规划难以满足全局最优和实时避障需求的问题,提出了一种改进D^(*)算法和改进动态窗口法相融合的算法,即D^(*)DWA。首先,对环境地图进行栅格化建模,利用层次聚类法根据障碍物的坐标位置对地图进行区域划... 针对水面无人艇在动态环境下的路径规划难以满足全局最优和实时避障需求的问题,提出了一种改进D^(*)算法和改进动态窗口法相融合的算法,即D^(*)DWA。首先,对环境地图进行栅格化建模,利用层次聚类法根据障碍物的坐标位置对地图进行区域划分;然后,建立区域障碍物复杂度量化指标向量对D^(*)算法中的代价函数进行优化,获取全局最优路径的基本信息;最后,根据全局最优路径中关键节点信息设计动态窗口法的评价函数,快速规划出全局最优光滑路径。实验将所提出的D^(*)DWA与其他路径规划算法进行了仿真对比。实验结果表明,该算法提高了路径规划的效率,增加了路径的平滑度。 展开更多
关键词 水面无人艇 路径规划 层次聚类法 改进d^(*)算法 动态窗口法
原文传递
Path Planning Method Based on D^(*) lite Algorithm for Unmanned Surface Vehicles in Complex Environments 被引量:9
4
作者 YAO Yan-long LIANG Xiao-feng +4 位作者 LI Ming-zhi YU Kai CHEN Zhe NI Chong-ben TENG Yue 《China Ocean Engineering》 SCIE EI CSCD 2021年第3期372-383,共12页
In recent decades,path planning for unmanned surface vehicles(USVs)in complex environments,such as harbours and coastlines,has become an important concern.The existing algorithms for real-time path planning for USVs a... In recent decades,path planning for unmanned surface vehicles(USVs)in complex environments,such as harbours and coastlines,has become an important concern.The existing algorithms for real-time path planning for USVs are either too slow at replanning or unreliable in changing environments with multiple dynamic obstacles.In this study,we developed a novel path planning method based on the D^(*) lite algorithm for real-time path planning of USVs in complex environments.The proposed method has the following advantages:(1)the computational time for replanning is reduced significantly owing to the use of an incremental algorithm and a new method for modelling dynamic obstacles;(2)a constrained artificial potential field method is employed to enhance the safety of the planned paths;and(3)the method is practical in terms of vehicle performance.The performance of the proposed method was evaluated through simulations and compared with those of existing algorithms.The simulation results confirmed the efficiency of the method for real-time path planning of USVs in complex environments. 展开更多
关键词 path planning unmanned surface vehicle d^(*)lite algorithm complex environment
在线阅读 下载PDF
Indoor space layout research based on redirection algorithm
5
作者 Qizhao WANG 《虚拟现实与智能硬件(中英文)》 2025年第6期618-638,共21页
Background Advancements in computer science and knowledge have made the incorporation of control theory,graphics processing,and mathematical models increasingly important for urban design planning.However,challenges r... Background Advancements in computer science and knowledge have made the incorporation of control theory,graphics processing,and mathematical models increasingly important for urban design planning.However,challenges remain in aligning virtual reality(VR)environments with real-world spatial and preparation requirements,particularly in indoor urban spaces.Methods This study investigates the application of VR technology to urban design,focusing on the growth and assessment of the redirection of the space-tree sorter algorithm(STSA).It outlines various assessment indicators,organization of the VR-based system architecture,and construction of 3D urban models and databases.This research also examined methods for the interactive adjustment of indoor space layout plans within a VR environment.Results This research study involved developing and demonstrating the creation and simulation of urban indoor spaces and cityscapes in VR and implementing an experimental setup to test layout modifications and system interactivity.The results indicated enhanced alignment between the virtual and physical spatial configurations.The analysis highlights the strengths and limitations of current VR systems for urban design and identifies key areas for optimization and refinement.Conclusion High congruence between virtual simulations and real-world urban spaces is necessary for effective VR-driven urban planning.This study contributes to a clearer understanding of how 3D modeling,interactive layout design,and reproduction technology can be efficiently employed to support urban increase initiatives. 展开更多
关键词 Virtual reality(VR) Indoor space layout 3d visualization Space-Trek Sorter algorithm Redirection algorithm
在线阅读 下载PDF
Non-Neural 3D Nasal Reconstruction:A Sparse Landmark Algorithmic Approach for Medical Applications
6
作者 Nguyen Khac Toan Ho Nguyen Anh Tuan Nguyen Truong Thinh 《Computer Modeling in Engineering & Sciences》 2025年第5期1273-1295,共23页
This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D n... This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D nose model tailored for applications in healthcare and cosmetic surgery.The approach leverages advanced image processing techniques,3D Morphable Models(3DMM),and deformation techniques to overcome the limita-tions of deep learning models,particularly addressing the interpretability issues commonly encountered in medical applications.The proposed method estimates the 3D coordinates of landmark points using a 3D structure estimation algorithm.Sub-landmarks are extracted through image processing techniques and interpolation.The initial surface is generated using a 3DMM,though its accuracy remains limited.To enhance precision,deformation techniques are applied,utilizing the coordinates of 76 identified landmarks and sub-landmarks.The resulting 3D nose model is constructed based on algorithmic methods and pre-marked landmarks.Evaluation of the 3D model is conducted by comparing landmark distances and shape similarity with expert-determined ground truth on 30 Vietnamese volunteers aged 18 to 47,all of whom were either preparing for or required nasal surgery.Experimental results demonstrate a strong agreement between the reconstructed 3D model and the ground truth.The method achieved a mean landmark distance error of 0.631 mm and a shape error of 1.738 mm,demonstrating its potential for medical applications. 展开更多
关键词 Nose reconstruction 3d reconstruction medical applications algorithmic reconstruction enhanced 3d model
在线阅读 下载PDF
Hybrid Framework for Structural Analysis: Integrating Topology Optimization, Adjacent Element Temperature-Driven Pre-Stress, and Greedy Algorithms
7
作者 Ibrahim T.Teke Ahmet H.Ertas 《Computers, Materials & Continua》 2025年第7期243-264,共22页
This study presents a novel hybrid topology optimization and mold design framework that integrates process fitting,runner system optimization,and structural analysis to significantly enhance the performance of injecti... This study presents a novel hybrid topology optimization and mold design framework that integrates process fitting,runner system optimization,and structural analysis to significantly enhance the performance of injection-molded parts.At its core,the framework employs a greedy algorithm that generates runner systems based on adjacency and shortest path principles,leading to improvements in both mechanical strength and material efficiency.The design optimization is validated through a series of rigorous experimental tests,including three-point bending and torsion tests performed on key-socket frames,ensuring that the optimized designs meet practical performance requirements.A critical innovation of the framework is the development of the Adjacent Element Temperature-Driven Prestress Algorithm(AETDPA),which refines the prediction of mechanical failure and strength fitting.This algorithm has been shown to deliver mesh-independent accuracy,thereby enhancing the reliability of simulation results across various design iterations.The framework’s adaptability is further demonstrated by its ability to adjust optimization methods based on the unique geometry of each part,thus accelerating the overall design process while ensuring struc-tural integrity.In addition to its immediate applications in injection molding,the study explores the potential extension of this framework to metal additive manufacturing,opening new avenues for its use in advanced manufacturing technologies.Numerical simulations,including finite element analysis,support the experimental findings and confirm that the optimized designs provide a balanced combination of strength,durability,and efficiency.Furthermore,the integration challenges with existing injection molding practices are addressed,underscoring the framework’s scalability and industrial relevance.Overall,this hybrid topology optimization framework offers a computationally efficient and robust solution for advanced manufacturing applications,promising significant improvements in design efficiency,cost-effectiveness,and product performance.Future work will focus on further enhancing algorithm robustness and exploring additional applications across diverse manufacturing processes. 展开更多
关键词 Plastic injection molding 3d printing three-point bending tensile test adjacent element temperature-driven pre-stress algorithm d-S-ER S-d-S-ER thermal expansion greedy algorithm
在线阅读 下载PDF
3D numerical manifold method for crack propagation in rock materials using a local tracking algorithm
8
作者 Boyi Su Tao Xu +3 位作者 Genhua Shi Michael J.Heap Xianyang Yu Guanglei Zhou 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第6期3449-3463,共15页
The modeling of crack growth in three-dimensional(3D)space poses significant challenges in rock mechanics due to the complex numerical computation involved in simulating crack propagation and interaction in rock mater... The modeling of crack growth in three-dimensional(3D)space poses significant challenges in rock mechanics due to the complex numerical computation involved in simulating crack propagation and interaction in rock materials.In this study,we present a novel approach that introduces a 3D numerical manifold method(3D-NMM)with a geometric kernel to enhance computational efficiency.Specifically,the maximum tensile stress criterion is adopted as a crack growth criterion to achieve strong discontinuous crack growth,and a local crack tracking algorithm and an angle correction technique are incorporated to address minor limitations of the algorithm in a 3D model.The implementation of the program is carried out in Python,using object-oriented programming in two independent modules:a calculation module and a crack module.Furthermore,we propose feasible improvements to enhance the performance of the algorithm.Finally,we demonstrate the feasibility and effectiveness of the enhanced algorithm in the 3D-NMM using four numerical examples.This study establishes the potential of the 3DNMM,combined with the local tracking algorithm,for accurately modeling 3D crack propagation in brittle rock materials. 展开更多
关键词 3d numerical manifold method(3d NMM) Crack propagation Local tracking algorithm Brittle materials
在线阅读 下载PDF
Rock discontinuity extraction from 3D point clouds using pointwise clustering algorithm
9
作者 Xiaoyu Yi Wenxuan Wu +2 位作者 Wenkai Feng Yongjian Zhou Jiachen Zhao 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第7期4429-4444,共16页
Recognizing discontinuities within rock masses is a critical aspect of rock engineering.The development of remote sensing technologies has significantly enhanced the quality and quantity of the point clouds collected ... Recognizing discontinuities within rock masses is a critical aspect of rock engineering.The development of remote sensing technologies has significantly enhanced the quality and quantity of the point clouds collected from rock outcrops.In response,we propose a workflow that balances accuracy and efficiency to extract discontinuities from massive point clouds.The proposed method employs voxel filtering to downsample point clouds,constructs a point cloud topology using K-d trees,utilizes principal component analysis to calculate the point cloud normals,and employs the pointwise clustering(PWC)algorithm to extract discontinuities from rock outcrop point clouds.This method provides information on the location and orientation(dip direction and dip angle)of the discontinuities,and the modified whale optimization algorithm(MWOA)is utilized to identify major discontinuity sets and their average orientations.Performance evaluations based on three real cases demonstrate that the proposed method significantly reduces computational time costs without sacrificing accuracy.In particular,the method yields more reasonable extraction results for discontinuities with certain undulations.The presented approach offers a novel tool for efficiently extracting discontinuities from large-scale point clouds. 展开更多
关键词 Rock mass discontinuity 3d point clouds Pointwise clustering(PWC)algorithm Modified whale optimization algorithm(MWOA)
在线阅读 下载PDF
A novel heuristic pathfinding algorithm for 3D security modeling and vulnerability assessment
10
作者 Jun Yang Yue-Ming Hong +2 位作者 Yu-Ming Lv Hao-Ming Ma Wen-Lin Wang 《Nuclear Science and Techniques》 2025年第5期152-166,共15页
Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulner... Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic pathfinding.The A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic function.The 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications. 展开更多
关键词 Physical protection system 3d modeling and simulation Vulnerability assessment A^(*)Heuristic Pathfinding dijkstra algorithm
在线阅读 下载PDF
Advanced 3D Wind Farm Layout Optimization Framework via Power-Law Perturbation-Based Genetic Algorithm
11
作者 Jiaru Yang Yaotong Song +3 位作者 Jun Tang Weiping Ding Zhenyu Lei Shangce Gao 《IEEE/CAA Journal of Automatica Sinica》 2025年第11期2314-2328,共15页
The modeling and optimization of wind farm layouts can effectively reduce the wake effect between turbine units,thereby enhancing the expected output power and avoiding negative influence.Traditional wind farm optimiz... The modeling and optimization of wind farm layouts can effectively reduce the wake effect between turbine units,thereby enhancing the expected output power and avoiding negative influence.Traditional wind farm optimization often uses idealized wake models,neglecting the influence of wind shear at different elevations,which leads to a lack of precision in estimating wake effects and fails to meet the accuracy and reliability requirements of practical engineering.To address this,we have constructed a three-dimensional 3D wind farm optimization model that incorporates elevation,utilizing a 3D wake model to better reflect real-world conditions.We aim to assess the optimization state of the algorithm and provide strong incentives at the right moments to ensure continuous evolution of the population.To this end,we propose an evolutionary adaptation degreeguided genetic algorithm based on power-law perturbation(PPGA)to adapt multidimensional conditions.We select the offshore wind power project in Nantong,Jiangsu,China,as a study example and compare PPGA with other well-performing algorithms under this practical project.Based on the actual wind condition data,the experimental results demonstrate that PPGA can effectively tackle this complex problem and achieve the best power efficiency. 展开更多
关键词 3d wake model China’s southeastern coast metaheuristic offshore wind farm power-law perturbation-based genetic algorithm(PPGA)
在线阅读 下载PDF
Flexible Monolithic 3D-Integrated Self-Powered Tactile Sensing Array Based on Holey MXene Paste
12
作者 Mengjie Wang Chen Chen +9 位作者 Yuhang Zhang Yanan Ma Li Xu Dan‑Dan Wu Bowen Gao Aoyun Song Li Wen Yongfa Cheng Siliang Wang Yang Yue 《Nano-Micro Letters》 2026年第2期772-785,共14页
Flexible electronics face critical challenges in achieving monolithic three-dimensional(3D)integration,including material compatibility,structural stability,and scalable fabrication methods.Inspired by the tactile sen... Flexible electronics face critical challenges in achieving monolithic three-dimensional(3D)integration,including material compatibility,structural stability,and scalable fabrication methods.Inspired by the tactile sensing mechanism of the human skin,we have developed a flexible monolithic 3D-integrated tactile sensing system based on a holey MXene paste,where each vertical one-body unit simultaneously functions as a microsupercapacitor and pressure sensor.The in-plane mesopores of MXene significantly improve ion accessibility,mitigate the self-stacking of nanosheets,and allow the holey MXene to multifunctionally act as a sensing material,an active electrode,and a conductive interconnect,thus drastically reducing the interface mismatch and enhancing the mechanical robustness.Furthermore,we fabricate a large-scale device using a blade-coating and stamping method,which demonstrates excellent mechanical flexibility,low-power consumption,rapid response,and stable long-term operation.As a proof-of-concept application,we integrate our sensing array into a smart access control system,leveraging deep learning to accurately identify users based on their unique pressing behaviors.This study provides a promising approach for designing highly integrated,intelligent,and flexible electronic systems for advanced human-computer interactions and personalized electronics. 展开更多
关键词 Holey MXene Microsupercapacitor Tactile sensor Monolithic 3d integration deep learning algorithm
在线阅读 下载PDF
基于改进D^(*)算法的机器人室内路径规划
13
作者 叶嘉琪 牛磊 《传感器与微系统》 北大核心 2026年第1期138-142,共5页
针对D^(*)算法在复杂建筑环境中路径规划效率低、易出现斜穿障碍物的问题,提出一种改进的D^(*)路径规划算法。首先,利用Delaunay三角剖分与节点优化生成关键节点无向图,替代传统网格地图,提高搜索效率;其次,引入连接所有出口的虚拟节点... 针对D^(*)算法在复杂建筑环境中路径规划效率低、易出现斜穿障碍物的问题,提出一种改进的D^(*)路径规划算法。首先,利用Delaunay三角剖分与节点优化生成关键节点无向图,替代传统网格地图,提高搜索效率;其次,引入连接所有出口的虚拟节点优化搜索策略,进一步提升执行效率;最后,通过建立障碍物及研究区缓冲区提高路径规划精度,有效避免路径穿越障碍物。通过虚拟环境及斯坦福教学楼数据验证,实验结果显示,优化后算法耗时降低77.56%,斜穿障碍物情况明显减少,尤其在区域较大、出口较多的环境下,算法搜索效率和路径准确性均显著提升。 展开更多
关键词 d^(*)算法 dELAUNAY三角剖分 节点优化体系 虚拟节点 缓冲区
在线阅读 下载PDF
基于D^(*)算法的无人机导航系统在变电站巡检中的应用与性能评估
14
作者 肖礼荣 肖中伟 +4 位作者 杨磊 熊玲 胡洪权 戴明 徐潇灵 《南昌大学学报(理科版)》 2026年第1期24-29,共6页
在变电站的复杂环境下中,无人机自主巡检存在飞行安全和效率问题。为此,本文提出了一种基于D^(*)算法的无人机巡检路径规划方法。首先,设计了巡检系统结构与流程化作业体系;其次,对D^(*)算法进行适应性改进和调整;最后,通过设计仿真实... 在变电站的复杂环境下中,无人机自主巡检存在飞行安全和效率问题。为此,本文提出了一种基于D^(*)算法的无人机巡检路径规划方法。首先,设计了巡检系统结构与流程化作业体系;其次,对D^(*)算法进行适应性改进和调整;最后,通过设计仿真实验对所提方法进行验证,结果表明D^(*)算法将碰撞率降低到了5%,与A^(*)RRT算法相比分别减少了7%和5%,验证了所提方法的可行性和有效性。 展开更多
关键词 变电站 无人机 自主巡检 d^(*)算法 路径规划。
在线阅读 下载PDF
基于D*Lite算法的估价函数分析 被引量:4
15
作者 张晓冉 居鹤华 《计算机工程》 CAS CSCD 2012年第1期154-156,共3页
为提高D*Lite算法在机器人路径规划中的效率,提出3种基于D*Lite算法的估价函数。研究函数的特性及其构造原则,结合Aε*算法的特点,利用估价函数的可纳性约束设计其改进算法。实验结果表明,改进算法能减少扩展节点的数量,提高搜索效率,... 为提高D*Lite算法在机器人路径规划中的效率,提出3种基于D*Lite算法的估价函数。研究函数的特性及其构造原则,结合Aε*算法的特点,利用估价函数的可纳性约束设计其改进算法。实验结果表明,改进算法能减少扩展节点的数量,提高搜索效率,并保证其解在一定范围内的最优性。 展开更多
关键词 估价函数 dlite算法 启发式搜索 增量搜索
在线阅读 下载PDF
基于路径优化D^*Lite算法的移动机器人路径规划 被引量:31
16
作者 黄鲁 周非同 《控制与决策》 EI CSCD 北大核心 2020年第4期877-884,共8页
采用D^*Lite算法规划出的路径并不平滑,且预规路径与障碍物均十分接近.除此之外,在动态环境下时,由D^*Lite算法重规划得到的路径也离障碍物距离很近,十分容易发生碰撞.针对此问题,引入懒惰视线算法与距离变换相结合的方法改进D^*Lite算... 采用D^*Lite算法规划出的路径并不平滑,且预规路径与障碍物均十分接近.除此之外,在动态环境下时,由D^*Lite算法重规划得到的路径也离障碍物距离很近,十分容易发生碰撞.针对此问题,引入懒惰视线算法与距离变换相结合的方法改进D^*Lite算法.首先,对地图进行距离变换,并引入距离值的启发式代价,使得距离障碍物较远的节点优先被选择.然后,在扩展节点时引入视线算法,增加本地父亲节点和远程父亲节点的概念,使得路径不局限于八邻域扩展,从而进化为任意角度路径规划算法;最后,在遇到未知障碍物时进行局部距离变换,结合启发距离值信息进行重规划,使得重规划得到的路径远离突现的障碍物.仿真实验表明,在不同环境下规划所得到的路径均十分平滑与安全. 展开更多
关键词 d^*lite 路径规划 移动机器人 路径优化 视线算法 距离变换
原文传递
基于改进D*Lite的二维路径连续动态规划算法 被引量:4
17
作者 傅亮 刘峰 +1 位作者 刘书勇 韩新宇 《无线电通信技术》 2023年第6期1042-1051,共10页
广泛应用于路径规划问题的D*Lite存在运行速度慢、容易斜穿障碍物边界节点且只能执行单次动态路径重构等问题。基于此,引入人工势场(Artificial Potential Field,APF)引力场的思想,提出了一种在既定路线上持续产生突变障碍的连续动态路... 广泛应用于路径规划问题的D*Lite存在运行速度慢、容易斜穿障碍物边界节点且只能执行单次动态路径重构等问题。基于此,引入人工势场(Artificial Potential Field,APF)引力场的思想,提出了一种在既定路线上持续产生突变障碍的连续动态路径规划D*Lite改进算法(Continuous D*Lite,CD*Lite)。对原始切比雪夫代价估计算子进行改进,优化路线斜走与非斜走实际代价。引入引力算子,提出一种全域代价估计算子改进键值算子。对规避障碍物提出一种方向禁忌矩阵,避免斜穿危险节点。基于冗余点删除机制规划路线进行优化,生成较为光滑的折线。实验结果表明,CD*Lite基于多规模栅格地图均成功预规划路线,且运行时间相较实验对比算法减少约35%,在连续动态规划模式中相较实验对比算法减少约60%。 展开更多
关键词 d*lite 路径规划 人工势场 栅格法 连续动态规划
在线阅读 下载PDF
基于单元分解的改进D*lite路径规划算法 被引量:10
18
作者 张毅 施明瑞 《重庆邮电大学学报(自然科学版)》 CSCD 北大核心 2021年第6期1007-1013,共7页
障碍物分隔搜索空间会隐藏D*lite算法正确的搜索方向,增加算法的计算次数,进而影响搜索效率,针对这一问题提出一种基于单元分解的改进D*lite路径规划算法。在原有Boustrophedon单元分解法的基础上加入了新的分解规则,对环境地图进行单... 障碍物分隔搜索空间会隐藏D*lite算法正确的搜索方向,增加算法的计算次数,进而影响搜索效率,针对这一问题提出一种基于单元分解的改进D*lite路径规划算法。在原有Boustrophedon单元分解法的基础上加入了新的分解规则,对环境地图进行单元分解并构建了以单元为节点的图。设计了双向图搜索算法,能够快速计算出最短路径需要依次经过哪些单元。在这些单元中设置核心网格并依照顺序构建搜索链表,引导正确的搜索方向,使规划速度提高。在仿真平台上将算法与其他路径规划算法进行对比实验,实验结果表明,算法规划出的路径长度与其他算法几乎没有差别,并且减少了计算次数、降低了规划时间,验证了算法提高路径规划效率的有效性。 展开更多
关键词 路径规划 d~*lite 单元分解 Boustrophedon
在线阅读 下载PDF
APU-D* Lite: Attack Planning under Uncertainty Based on D* Lite 被引量:3
19
作者 Tairan Hu Tianyang Zhou +2 位作者 Yichao Zang Qingxian Wang Hang Li 《Computers, Materials & Continua》 SCIE EI 2020年第11期1795-1807,共13页
With serious cybersecurity situations and frequent network attacks,the demands for automated pentests continue to increase,and the key issue lies in attack planning.Considering the limited viewpoint of the attacker,at... With serious cybersecurity situations and frequent network attacks,the demands for automated pentests continue to increase,and the key issue lies in attack planning.Considering the limited viewpoint of the attacker,attack planning under uncertainty is more suitable and practical for pentesting than is the traditional planning approach,but it also poses some challenges.To address the efficiency problem in uncertainty planning,we propose the APU-D*Lite algorithm in this paper.First,the pentest framework is mapped to the planning problem with the Planning Domain Definition Language(PDDL).Next,we develop the pentest information graph to organize network information and assess relevant exploitation actions,which helps to simplify the problem scale.Then,the APU-D*Lite algorithm is introduced based on the idea of incremental heuristic searching.This method plans for both hosts and actions,which meets the requirements of pentesting.With the pentest information graph as the input,the output is an alternating host and action sequence.In experiments,we use the attack success rate to represent the uncertainty level of the environment.The result shows that APU-D*Lite displays better reliability and efficiency than classical planning algorithms at different attack success rates. 展开更多
关键词 Attack planning under uncertainty automated pentest APU-d*lite algorithm incremental heuristic search
在线阅读 下载PDF
基于快速D~*Lite算法的移动机器人路径规划 被引量:7
20
作者 张亚楠 孙丰财 史旭华 《数据通信》 2018年第1期46-51,共6页
针对动态环境下移动机器人的路径短、时间少及无碰撞的路径规划问题,提出了一种基于快速D~★Lite的路径规划算法。快速D~★Lite算法的基本思想是,在路径规划过程中,当移动机器人检测到下一节点为障碍物时,就启用快速重规划策略,这样可... 针对动态环境下移动机器人的路径短、时间少及无碰撞的路径规划问题,提出了一种基于快速D~★Lite的路径规划算法。快速D~★Lite算法的基本思想是,在路径规划过程中,当移动机器人检测到下一节点为障碍物时,就启用快速重规划策略,这样可以全部或部分避免一些节点的重新规划计算,大大提高了路径规划效率。实验结果显示快速D~★Lite的重规划效果比D~★Lite更优。 展开更多
关键词 动态路径规划 dlite 快速dlite 快速重规划策略
在线阅读 下载PDF
上一页 1 2 67 下一页 到第
使用帮助 返回顶部