期刊文献+
共找到8,611篇文章
< 1 2 250 >
每页显示 20 50 100
Optimizing Connections:Applied Shortest Path Algorithms for MANETs
1
作者 Ibrahim Alameri Jitka Komarkova +2 位作者 Tawfik Al-Hadhrami Abdulsamad Ebrahim Yahya Atef Gharbi 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第10期787-807,共21页
This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del... This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness. 展开更多
关键词 Dijkstra’s algorithm optimization complexity analysis shortest path first comparative algorithm analysis nondeterministic polynomial(NP)-complete
下载PDF
An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time
2
作者 Xiaoqing Wang Peng Duan +1 位作者 Leilei Meng Kaidong Yang 《Computers, Materials & Continua》 SCIE EI 2024年第7期931-947,共17页
Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning probl... Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength constraints.To address this problem,we proposed an improved iterated greedy(IIG)algorithm.First,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial solution.Second,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability.Furthermore,three problem-specific swap operators were developed to improve the algorithm’s exploitation ability.Additionally,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local optima.To verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for simulation.Finally,the proposed IIG was compared with five state-of-the-art algorithms.The parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by one.Simulation results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm. 展开更多
关键词 Rescue robot path planning life strength improved iterative greedy algorithm problem-specific swap operators
下载PDF
Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm
3
作者 Xiaoge Wei Yuming Zhang +2 位作者 Huaitao Song Hengjie Qin Guanjun Zhao 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期1295-1316,共22页
Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Fi... Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential. 展开更多
关键词 Sparrow search algorithm optimization and improvement function test set evacuation path planning
下载PDF
Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm
4
作者 Xiaocong Zhou Wei Zheng +2 位作者 Zhaowei Li Panlong Wu Yongjin Sun 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期285-296,共12页
This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapi... This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results. 展开更多
关键词 Depth Sorting Fast Search algorithm Underwater gravity-aided navigation path planning efficiency Quick Rapidly-exploring Random Trees*(QRRT*)
下载PDF
Path Planning for Robotic Arms Based on an Improved RRT Algorithm
5
作者 Wei Liu Zhennan Huang +1 位作者 Yingpeng Qu Long Chen 《Open Journal of Applied Sciences》 2024年第5期1214-1236,共23页
The burgeoning robotics industry has catalyzed significant strides in the development and deployment of industrial and service robotic arms, positioning path planning as a pivotal facet for augmenting their operationa... The burgeoning robotics industry has catalyzed significant strides in the development and deployment of industrial and service robotic arms, positioning path planning as a pivotal facet for augmenting their operational safety and efficiency. Existing path planning algorithms, while capable of delineating feasible trajectories, often fall short of achieving optimality, particularly concerning path length, search duration, and success likelihood. This study introduces an enhanced Rapidly-Exploring Random Tree (RRT) algorithm, meticulously designed to rectify the issues of node redundancy and the compromised path quality endemic to conventional RRT approaches. Through the integration of an adaptive pruning mechanism and a dynamic elliptical search strategy within the Informed RRT* framework, our algorithm efficiently refines the search tree by discarding branches that surpass the cost of the optimal path, thereby refining the search space and significantly boosting efficiency. Extensive comparative analysis across both two-dimensional and three-dimensional simulation settings underscores the algorithm’s proficiency in markedly improving path precision and search velocity, signifying a breakthrough in the domain of robotic arm path planning. 展开更多
关键词 Robotic Arm path Planning RRT algorithm Adaptive Pruning Optimization
下载PDF
Optimal path finding algorithms based on SLSD road network model 被引量:3
6
作者 张小国 王庆 龚福祥 《Journal of Southeast University(English Edition)》 EI CAS 2010年第4期558-562,共5页
A solution to compute the optimal path based on a single-line-single-directional(SLSD)road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional an... A solution to compute the optimal path based on a single-line-single-directional(SLSD)road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding(OPF)is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network. 展开更多
关键词 optimal path finding road network model conceptual model digital map vehicle navigation system A algorithm Dijkstra algorithm
下载PDF
A greedy path planning algorithm based on pre-path-planning and real-time-conflict for multiple automated guided vehicles in large-scale outdoor scenarios 被引量:2
7
作者 王腾达 WU Wenjun +2 位作者 YANG Feng SUN Teng GAO Qiang 《High Technology Letters》 EI CAS 2023年第3期279-287,共9页
With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path... With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions. 展开更多
关键词 automated guided vehicle(AGV) multi-agent path finding(MAPF) complex terrain greedy algorithm
下载PDF
Research on AGV task path planning based on improved A^(*) algorithm 被引量:1
8
作者 Xianwei WANG Jiajia LU +2 位作者 Fuyang KE Xun WANG Wei WANG 《Virtual Reality & Intelligent Hardware》 2023年第3期249-265,共17页
Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in thes... Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles. 展开更多
关键词 Autonomous guided vehicle(AGV) Map modeling Global path planning Improved A^(*)algorithm path optimization Bezier curves
下载PDF
Minimum dose path planning for facility inspection based on the discrete Rao-combined ABC algorithm in radioactive environments with obstacles
9
作者 Kwon Ryong Hong Su Il O +2 位作者 Ryon Hui Kim Tae Song Kim Jang Su Kim 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2023年第4期26-40,共15页
Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the... Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the least amount of radiation.This study proposes a discrete Rao-combined artificial bee colony(ABC)algorithm for planning inspection paths with minimum exposure doses in radioactive environments with obstacles.In this algorithm,retaining the framework of the traditional ABC algorithm,we applied the directional solution update rules of Rao algorithms at the employed bee stage and onlooker bee stage to increase the exploitation ability of the algorithm and implement discretion using the swap operator and swap sequence.To increase the randomness of solution generation,the chaos algorithm was used at the initialization stage.The K-opt operation technique was introduced at the scout bee stage to increase the exploration ability of the algorithm.For path planning in an environment with complex structural obstacles,an obstacle detour technique using a recursive algorithm was applied.To evaluate the performance of the proposed algorithm,we performed experimental simulations in three hypothetical environments and compared the results with those of improved particle swarm optimization,chaos particle swarm optimization,improved ant colony optimization,and discrete Rao’s algorithms.The experimental results show the high performance of the proposed discrete Rao-combined ABC algorithm and its obstacle detour capability. 展开更多
关键词 Minimum dose path planning Nuclear facility inspection ABC algorithm Rao algorithms Swap sequence K-opt operation
下载PDF
Improved lazy theta algorithm based on octree map for path planning of UAV
10
作者 Meng-shun Yuan Tong-le Zhou Mou Chen 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2023年第5期8-18,共11页
This paper investigates the path planning method of unmanned aerial vehicle(UAV)in threedimensional map.Firstly,in order to keep a safe distance between UAV and obstacles,the obstacle grid in the map is expanded.By us... This paper investigates the path planning method of unmanned aerial vehicle(UAV)in threedimensional map.Firstly,in order to keep a safe distance between UAV and obstacles,the obstacle grid in the map is expanded.By using the data structure of octree,the octree map is constructed,and the search nodes is significantly reduced.Then,the lazy theta*algorithm,including neighbor node search,line-of-sight algorithm and heuristics weight adjustment is improved.In the process of node search,UAV constraint conditions are considered to ensure the planned path is actually flyable.The redundant nodes are reduced by the line-of-sight algorithm through judging whether visible between two nodes.Heuristic weight adjustment strategy is employed to control the precision and speed of search.Finally,the simulation results show that the improved lazy theta*algorithm is suitable for path planning of UAV in complex environment with multi-constraints.The effectiveness and flight ability of the algorithm are verified by comparing experiments and real flight. 展开更多
关键词 Unmanned aerial vehicle path planning Lazy theta*algorithm Octree map Line-of-sight algorithm
下载PDF
Application of GA, PSO, and ACO Algorithms to Path Planning of Autonomous Underwater Vehicles 被引量:8
11
作者 Mohammad Pourmahmood Aghababa Mohammad Hossein Amrollahi Mehdi Borjkhani 《Journal of Marine Science and Application》 2012年第3期378-386,共9页
In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwa... In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem (NOCP). An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem (TPBVP). A genetic algorithm (GA), particle swarm optimization (PSO), and ant colony optimization (ACO) algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account. 展开更多
关键词 path planning autonomous underwater vehicle genetic algorithm (GA) particle swarmoptimization (PSO) ant colony optimization (ACO) collision avoidance
下载PDF
Niche pseudo-parallel genetic algorithms for path optimization of autonomous mobile robot 被引量:1
12
作者 沈志华 赵英凯 吴炜炜 《Journal of Shanghai University(English Edition)》 CAS 2006年第5期449-453,共5页
A new genetic algorithm named niche pseudo-parallel genetic algorithm (NPPGA) is presented for path evolution and genetic optimization of autonomous mobile robot. The NPPGA is an effective improvement to maintain th... A new genetic algorithm named niche pseudo-parallel genetic algorithm (NPPGA) is presented for path evolution and genetic optimization of autonomous mobile robot. The NPPGA is an effective improvement to maintain the population diversity as well for the sake of avoiding premature and strengthen parallelism of the population to accelerate the search process combined with niche genetic algorithms and pseudo-parallel genetic algorithms. The proposed approach is evaluated by robotic path optimization, which is a specific application of traveler salesman problem (TSP). Experimental results indicated that a shortest path could be obtained in the practical traveling salesman problem named "Robot tour around Pekin", and the performance conducted by NPPGA is better than simple genetic algorithm (SGA) and distributed paralell genetic algorithms (DPGA). 展开更多
关键词 genetic algorithms traveler salesman problem (TSP) path optimization NICHE pseudo-parallel.
下载PDF
Robot path planning using genetic algorithms 被引量:1
13
作者 朴松昊 洪炳熔 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2001年第3期215-217,共3页
Presents a strategy for soccer robot path planning using genetic algorithms for which, real number coding method is used, to overcome the defects of binary coding method, and the double crossover operation adopted, to... Presents a strategy for soccer robot path planning using genetic algorithms for which, real number coding method is used, to overcome the defects of binary coding method, and the double crossover operation adopted, to avoid the common defect of early convergence and converge faster than the standard genetic algorithms concludes from simulation results that the method is effective for robot path planning. 展开更多
关键词 path planning soccer robot genetic algorithms
下载PDF
Optimization of Path Planning for Construction Robots Based on Multiple Advanced Algorithms 被引量:1
14
作者 Kang Tan 《Journal of Computer and Communications》 2018年第7期1-13,共13页
There are many processes involved in construction, it is necessary to optimize the path planning of construction robots. Most researches focused more on optimization algorithms, but less on comparative analysis based ... There are many processes involved in construction, it is necessary to optimize the path planning of construction robots. Most researches focused more on optimization algorithms, but less on comparative analysis based on the advantages and shortcomings of these algorithms. Therefore, the innovation of this paper is to analyze three advanced optimization algorithms (genetic algorithm, hybrid particle swarm algorithm and ant colony algorithm) and discuss how these algorithms can improve the optimization performance by adjusting parameters. Finally, the three algorithms are compared and analyzed to find an optimization algorithm that is suitable for path planning optimization of construction robots. The purpose of the optimization is to obtain the maximum benefit with the least cost and complete project in an efficient and economical way. 展开更多
关键词 path PLANNING Construction ROBOTS OPTIMIZATION algorithm
下载PDF
Research on Parking Path Planing Based on A-Star Algorithm
15
作者 Zhiliang Deng Dong Wang 《Journal of New Media》 2023年第1期55-64,共10页
The issue of finding available parking spaces and mitigating conges-tion during parking is a persistent challenge for numerous car owners in urban areas.In this paper,we propose a novel method based on the A-star algo... The issue of finding available parking spaces and mitigating conges-tion during parking is a persistent challenge for numerous car owners in urban areas.In this paper,we propose a novel method based on the A-star algorithm to calculate the optimal parking path to address this issue.We integrate a road impedance function into the conventional A-star algorithm to compute path duration and adopt a fusion function composed of path length and duration as the weight matrix for the A-star algorithm to achieve optimal path planning.Furthermore,we conduct simulations using parking lot modeling to validate the effectiveness of our approach,which can provide car drivers with a reliable optimal parking navigation route,reduce their parking costs,and enhance their parking experience. 展开更多
关键词 A-Star algorithm path planning intelligent transportation
下载PDF
LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment
16
作者 Xiaoli Li Tongtong Jiao +2 位作者 Jinfeng Ma Dongxing Duan Shengbin Liang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第1期595-617,共23页
In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone ... In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account. 展开更多
关键词 Unmanned surface vehicles local obstacle avoidance algorithm artificial potential field algorithm path planning collision detection
下载PDF
Path Planning of Multi-Axis Robotic Arm Based on Improved RRT*
17
作者 Juanling Liang Wenguang Luo Yongxin Qin 《Computers, Materials & Continua》 SCIE EI 2024年第10期1009-1027,共19页
An improved RRT∗algorithm,referred to as the AGP-RRT∗algorithm,is proposed to address the problems of poor directionality,long generated paths,and slow convergence speed in multi-axis robotic arm path planning.First,a... An improved RRT∗algorithm,referred to as the AGP-RRT∗algorithm,is proposed to address the problems of poor directionality,long generated paths,and slow convergence speed in multi-axis robotic arm path planning.First,an adaptive biased probabilistic sampling strategy is adopted to dynamically adjust the target deviation threshold and optimize the selection of random sampling points and the direction of generating new nodes in order to reduce the search space and improve the search efficiency.Second,a gravitationally adjustable step size strategy is used to guide the search process and dynamically adjust the step-size to accelerate the search speed of the algorithm.Finally,the planning path is processed by pruning,removing redundant points and path smoothing fitting using cubic B-spline curves to improve the flexibility of the robotic arm.Through the six-axis robotic arm path planning simulation experiments on the MATLAB platform,the results show that the AGP-RRT∗algorithm reduces 87.34%in terms of the average running time and 40.39%in terms of the average path cost;Meanwhile,under two sets of complex environments A and B,the average running time of the AGP-RRT∗algorithm is shortened by 94.56%vs.95.37%,and the average path cost is reduced by 55.28%vs.47.82%,which proves the effectiveness of the AGP-RRT∗algorithm in improving the efficiency of multi-axis robotic arm path planning. 展开更多
关键词 Multi-axis robotic arm path planning improved RRT∗algorithm dynamic target deviation threshold dynamic step size path optimization
下载PDF
A Multi-Strategy-Improved Northern Goshawk Optimization Algorithm for Global Optimization and Engineering Design
18
作者 Liang Zeng Mai Hu +2 位作者 Chenning Zhang Quan Yuan Shanshan Wang 《Computers, Materials & Continua》 SCIE EI 2024年第7期1677-1709,共33页
Optimization algorithms play a pivotal role in enhancing the performance and efficiency of systems across various scientific and engineering disciplines.To enhance the performance and alleviate the limitations of the ... Optimization algorithms play a pivotal role in enhancing the performance and efficiency of systems across various scientific and engineering disciplines.To enhance the performance and alleviate the limitations of the Northern Goshawk Optimization(NGO)algorithm,particularly its tendency towards premature convergence and entrapment in local optima during function optimization processes,this study introduces an advanced Improved Northern Goshawk Optimization(INGO)algorithm.This algorithm incorporates a multifaceted enhancement strategy to boost operational efficiency.Initially,a tent chaotic map is employed in the initialization phase to generate a diverse initial population,providing high-quality feasible solutions.Subsequently,after the first phase of the NGO’s iterative process,a whale fall strategy is introduced to prevent premature convergence into local optima.This is followed by the integration of T-distributionmutation strategies and the State Transition Algorithm(STA)after the second phase of the NGO,achieving a balanced synergy between the algorithm’s exploitation and exploration.This research evaluates the performance of INGO using 23 benchmark functions alongside the IEEE CEC 2017 benchmark functions,accompanied by a statistical analysis of the results.The experimental outcomes demonstrate INGO’s superior achievements in function optimization tasks.Furthermore,its applicability in solving engineering design problems was verified through simulations on Unmanned Aerial Vehicle(UAV)trajectory planning issues,establishing INGO’s capability in addressing complex optimization challenges. 展开更多
关键词 Northern Goshawk Optimization tent chaotic map T-distribution disturbance state transition algorithm UAV path planning
下载PDF
Distributed collaborative complete coverage path planning based on hybrid strategy
19
作者 ZHANG Jia DU Xin +1 位作者 DONG Qichen XIN Bin 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第2期463-472,共10页
Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm ... Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably. 展开更多
关键词 multi-agent cooperation unmanned aerial vehicles(UAV) distributed algorithm complete coverage path planning(CCPP)
下载PDF
Path Planning Algorithms for Integrated Assembly Design
20
作者 储林波 《High Technology Letters》 EI CAS 1999年第1期82-86,共5页
This paper describes a path planning algorithm for integrated assembly design. An analytic method is presented to find sub optimal disassembly path if one exists. A fast computation method for C obstacle boundary ba... This paper describes a path planning algorithm for integrated assembly design. An analytic method is presented to find sub optimal disassembly path if one exists. A fast computation method for C obstacle boundary based on the convolution is presented to replace Minkowski sum. The local translational freedom cone(LTF) of parts is calculated by using assembly relation to find locally free parts and subassemblies. Then, a dynamic step changeable A algorithm with a goal visible test is employed for path searching within the C space. Although the path is slightly suboptimal, a tremendous speed increase is achieved. 展开更多
关键词 path PLANNING C OBSTACLE CONVOLUTION A algorithm
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部