Welcome![Sign In][Sign Up]
Location:
Search - The Path Planning Problem

Search list

[Industry researchlujingguihua

Description: CAJ格式的,遗传算法的路径规划问题,需要的可以看一下-CAJ format, genetic algorithm path planning problem, the need to look at the can
Platform: | Size: 308224 | Author: 郑国兵 | Hits:

[matlabGA

Description: 这个一个遗传算法的实例,可以解决机器人轨迹规划的问题-This example of a genetic algorithm, can solve the problem of robot path planning
Platform: | Size: 40960 | Author: kevin | Hits:

[Software Engineeringtusousuo

Description: 状态图实际上是一类问题的抽象表示。事实上,有许多智力问题(如梵塔问题、旅行商问题、八皇后问题、农夫过河问题等)和实际问题(如路径规划、定理证明、演绎推理、机器人行动规划等)都可以归结为在某一状态图中寻找目标或路径的问题。因此,研究状态图搜索具有普遍意义。 -State diagram is actually a class of abstract representation of the problem. In fact, there are many mental problems (such as the Hanoi Tower problem, traveling salesman problem, the eight queens problem, the farmer across the river and so on) and the actual problems (such as path planning, theorem proving, deductive reasoning, robot action planning, etc.) can be attributed to in a state diagram for the target or the path to find the problem. Therefore, the study state diagram search of universal significance.
Platform: | Size: 1251328 | Author: 菲菲 | Hits:

[Windows DevelopOOP

Description: This project is about implementing a world model that allows the path planning algorithm to query if a certain point in space is free from obstacles. -Planning a path from one point of the environment to another while avoiding collisions with the environment is a complicated problem. As the number of degrees of freedom increases, the problem soon becomes very hard to solve. As computer power increases, probabilistic methods are being used more and more often to tackle these problems. This project deals with a method for path planning known as Probabilistic Road Maps. The basic idea with probablistic road maps is to randomly select a set of nodes/points in the environment that are free from collision and try to connect them with straight lines that are also free from collisions. A solution to the problem might then be found by finding a path through the graph from the start point to the end point. One of the key components in such an algorithm is the ability to check for collisions with the environment.
Platform: | Size: 5120 | Author: wanglu | Hits:

[File Formatresearch

Description: The robot path planning problem is a very challenging problem in robotics. The main goal of this problem is to construct a collision-free path from a starting position to an end or destination position. However, this navigation problem includes several difficult phases that need to be overcome, such as obstacle avoidance, position identification, and so forth. As Ibrahim [17] pointed out, this problem can be broken in to several subtasks. A reliable navigation algorithm must be able to 1) Identify the current location of the robot, 2) Avoid any collisions, 3) Determine a path to the object.
Platform: | Size: 438272 | Author: mt | Hits:

[BooksUsing_Genetic_Algorithms_for_Robot_Motion_Planning

Description: 实用GA算法进行,机器人运功规划,算法很经典,美国人写的-We present an ongoing research work on robot motion plan- ning using genetic algorithms. Our goal is to use this technique to build fast motion planners for robot with six or more degree of freedom. After a short review of the existing methods, we will introduce the genetic al- gorithms by showing how they can be used to solve the invers kinematic problem. In the second part of the paper, we show that the path planning problem can be expressed as an optimization problem and thus solved with a genetic algorithm. We illustrate the approach by building a path planner for a planar arm with two degree of freedom, then we demon- strate the validity of the method by planning paths for an holonomic mobile robot. Finally we describe an implementation of the selected ge- netic algorithm on a massively parallel machine and show that fast plan- ning response is made possible by using this appro
Platform: | Size: 408576 | Author: xiaofang | Hits:

[AI-NN-PRpath-planning2

Description: 用matlab程序编写的遗传算法路径规划程序用来实现最短路径问题。-Programming using genetic algorithm matlab path planning process used to achieve the shortest path problem.
Platform: | Size: 2048 | Author: 丁彪 | Hits:

[AI-NN-PRGenetic-algorithm

Description: 此段程序是一套完整的设计程序(包括拓扑图、分析表),运用遗传算法优化解决路径规划问题。-The procedures of this section is a complete set of design procedures (including topology, analysis, table), the use of genetic algorithm optimization to solve the path planning problem.
Platform: | Size: 575488 | Author: tom | Hits:

[Technology Managementrobot-path-planning-

Description: 机器人路径规划问题 利用物体的势能来解决问题-Robot path planning problem to solve the problem using the potential energy of the object
Platform: | Size: 36864 | Author: 阵雨 | Hits:

[AI-NN-PRA_star-2012

Description: 应用A*算法解决八自由度迷宫问题,具有地图读入写出功能,可以扩展应用到路径规划问题。-Application of A* algorithm to solve the eight DOF maze problem with map reading into the write function, can be extended to the path planning problem.
Platform: | Size: 409600 | Author: liuguodong | Hits:

[Special EffectsGA-TSP

Description: 经典的基于GA遗传算法的路径规划问题的实现,能动态的实现所需功能,值得学习研究-The path planning problem of GA based on genetic algorithm classic, can realize the dynamic functions are required, it is worth learning research
Platform: | Size: 7168 | Author: 颜妍 | Hits:

[Software Engineeringabc-path-plan

Description: The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path a specified start position to the target position.-The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path a specified start position to the target position.
Platform: | Size: 629760 | Author: İ hsan | Hits:

[Software EngineeringPath-Planning-Grid-Method

Description: 文章简要阐述了基于栅格法的移动机器人路径规划算法问题, 并利用C++Buidler 软件开发的仿真平台对该问题进 行了仿真, 仿真结果说明了该算法的有效性和实用性。-This paper briefly describes the programming algorithm problem of mobile robot path based on grid method, and the use of C++ Buidler simulation software development platform into the issue Line simulation results show the effectiveness and practicality of the algorithm.
Platform: | Size: 343040 | Author: 刘同学 | Hits:

[AI-NN-PRdynamic-path-planning

Description: (不错的一篇文章,已被EI收录)模型预测控制(model predictive control,MPC)路径规划算法适用于三维动态环境下的无人机(un-manned aerial vehicle,UAV)路径规划;动态贝叶斯网络(dynamic Bayesian network,DBN)能够有效推理战场态势,对无人机进行威胁评估。针对威胁尾随无人机时的路径规划问题,构建 DBN 威胁评估模型,将 UAV 在战场环境中的威胁态势用威胁等级概率表示,与 MPC 路径规划算法相结合,得到基于 DBN 威胁评估的 MPC UAV 路径规划算法。通过多组仿真分析表明,在三维动态环境下,特别是威胁尾随无人机时,基于 DBN 威胁评估的 MPC无人机路径规划算法可以得到有效的无人机路径。-The model predictive control (MPC)path planning algorithm can solve the problem of dynamic unmanned aerial vehicle (UAV)path planning.Dynamic Bayesian network (DBN)is an effective tool for rea-soning and threat assessment.Considering the problem of path planning when the dynamic threat tags the UAV,the MPC path planning algorithm combined with DBN threat assessment is presented,which used the threat lever probability to describe the threat situation.A group of simulations demonstrate the efficiency of MPC three-dimensional dynamic path planning algorithm for UAV based on DBN threat assessment especially when the dynamic threat tags the UAV.
Platform: | Size: 1123328 | Author: | Hits:

[AI-NN-PRpath-planning

Description: 针对自治水下机器人(AUV)的路径规划问题进行了研究,依据模糊控制规则,提出了一种基于粒子群优化(PSO)的模糊路径规划算法.首先建立水下水平面内路径规划的模糊规则,并应用A/B模型进行静态和动态障碍物的避障.同时考虑到模糊边界的选择具有很大的随意性,所生成的路径并非最优,利用PSO算法进行模糊集合的优化,使得最终生成的路径最优.应用设计的粒子群优化模糊(PSO-fuzzy)算法针对动静态障碍物进行了避障路径规划,仿真结果验证了所设计的方法的有效性.-The study was conducted with the aim of solving the path planning problem of autonomous underwater vehicles (AUV), and a fuzzy path planning algorithm based on particle swarm optimization (PSO) was presented according to fuzzy logic control theories.First,a fuzzy rule for the path planning was set up in the underwater horizontal plane. Then,an accelerate/brake(A/B)model was applied to dealing with static and dynamic avoidance.Considering that the fuzzy boundary choice is of great arbitrariness,and the formation of the path is not optimal,the PSO algorithm was applied to optimization of the fuzzy boundary for making the final generated path most optimal.the designed PSO—fuzzy algorithm Was intended to do statics and dynamic obstacle avoidance path planning.the simulation results verified the effectiveness of the proposed design method.
Platform: | Size: 2371584 | Author: | Hits:

[matlabRobot-path-planning--

Description: 基于蚁群算法的机器人路径规划。使用网格离散化的方法对带有障碍物的环境建模,使用邻接矩阵存储该环境,使得问题转化为蚁群算法寻找最短路径。-Robot path planning based on ant colony algorithm. Use grid discretization methods with obstacles environment modeling, the use of adjacency matrix to store the environment, the problem is transformed into the ant colony algorithm to find the shortest path.
Platform: | Size: 3072 | Author: 王帅 | Hits:

[OtherA-Star Simple Example

Description: Path Planning using A star method(Using LabVIEW to deal with the path planning problem)
Platform: | Size: 37888 | Author: yue93 | Hits:

[matlab人工势场法

Description: 基于传统的人工势场法实现的路径规划问题,可以躲避障碍物(The path planning problem based on the traditional artificial potential field method can avoid obstacles)
Platform: | Size: 3072 | Author: qwe1asd2 | Hits:

[DocumentsAstar

Description: 在路径规划问题中最经典的算法,本文档利用C++进行算法编译,简洁易懂(In the path planning problem of the most classical algorithm, this document uses c + + algorithm compilation, concise and easy to understand)
Platform: | Size: 20480 | Author: 以前是芃晟啊 | Hits:

[matlab针对自治水下机器人的路径规划问题进行了研究

Description: 针对自治水下机器人(AUV)的路径规划问题进行了研究,依据模糊控制规则,提出了一种基于粒子群优化(PSO)的模糊路径规划算法(The path planning problem of autonomous underwater vehicle (AUV) is studied. According to the fuzzy control rules, a fuzzy path planning algorithm based on particle swarm optimization (PSO) is proposed)
Platform: | Size: 2370560 | Author: GDS11 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net