搜索资源列表
Astar
- 本代码用图示的方式完整的说明了A*算法的运行方式。 设置完起始,结束以及障碍点后,点击运行即可看到A*算法是怎样走迷宫的
ANN-moving-robot
- 运用人工神经网络和遗传算法实现机器人程序能够自动排除地图中的障碍物。-The use of artificial neural networks and genetic algorithm procedures robot can automatically rule out the possibility of obstructions map.
myPSO
- 一个用粒子群做的路径规划。功能比较简单,障碍物就是几个点。-A particle swarm to do with the path planning. Function is relatively simple, barrier is a few points.
lujingguihua
- 用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点,避开障碍物。-Depth-first algorithm used to do a path planning. From the starting point has been moved to the target point, avoiding obstacles.
robotprogram
- 循迹小车,在光源引导下通过障碍区进入停车区,液晶显示用时-Vehicle Tracking in the light under the guidance of the District through the barriers to enter the parking area, liquid crystal display when
antColonyAlgorith1.4
- 双蚁群算法实现机器人路径规划,采用面向对象的方法编写,蚂蚁数量和起始点可以设置,障碍率可以设置,障碍可以自动生成也可以手工使用鼠标设置。 已发表相关论文。 有兴趣的朋友可以检索“孙纯哲 凹形障碍全局路径规划的双蚁群完全交叉算法”-Ant colony algorithm to achieve dual-robot path planning, object-oriented method to prepare, ants can set the number and the starti
a_star_pathfinder_v.1.92
- A星路径规划原始演示代码,可以自己设计障碍和起点终点。-A Star path planning the original demo code, you can own design obstacles and end point.
0510ex1
- 根据智能体所处的环境和状态在有障碍的空间行走,并达到目的地-According to the agent and the state of the environment in which there are obstacles in the space walk, and reach the destination
AI_for_Game_Developer
- 基于势函数的单一技术处理追逐,闪躲,聚集和躲避障碍等问题;以及多种A*算法解决寻路径的问题;利用AI脚本扩充AI引擎的功能,等-Potential function based on a single technical processing chase, dodging, aggregation and avoid obstacles and other issues and a variety of A* algorithm to solve the problem to find the
pinter
- 人工智能,寻路算法,可设置障碍点,模拟行走路线-Simply copy the executable(Pathing.exe) and the accompanying*.bmp files into any directory.
astar
- a星算法 神经网络编程,对于空地左键单击后会产生障碍,对障碍左键单击会消除障碍,对于起点,两次左键盘单击会消除起点,如果不存在起点,单击右键会产生起点,如果存在起点不存在终点,单击右键会产生终点,如果既存在起点又存在终点,单击右键会消除终点,点击开始寻路回画出路径-a star algorithm neural network programming, for the vacant left-click will create an obstacle on the obstacle left-c
1
- 基于k中心的有实体障碍约束的聚类算法例程。-K centers are based on physical barriers constrained clustering routines.
p3809249
- FUZZY逻辑控制,躲避障碍物到达指定目标,并用神经网络改良原有的模型-ROBOT FUZZY LOGIC SYSTEM
SimpleView
- 单一机器人最优路径规划中的栅格地图构建以及障碍设定-Single robot optimal path planning and obstacle to building a grid map to set
4[1]
- 提出了一种新的模糊遗传算法(GA)的方法来解决问题的轨迹规划两个合作共享一个公共的机器人避障工作场所,在机械手必须考虑对方作为一个移动的轨迹或者行为障碍是未知的和不可预知的,因为每一个都有各自的目标和机械手都有相同的优先权。 -This paper presents a novel fuzzy genetic algorithm (GA) approach to tackling the problem of trajectory planning of two collaborat
RES
- A*算法的路径搜索的程序源码,鼠标左键设置障碍,右键开始搜索-A* algorithm for path search program source code, the left mouse button to set up obstacles to the right to start the search
A_str
- A星算法 简单的封装成类 可以自行加工使用 也可以参考下 运行可以修改 数组里面的数值 0 为通道 1 为障碍-A star algorithm simple package into a class can use their own processing can also refer to an array can be modified to run inside the value 0 for channel 1 as obstacles
path
- 两点直接绕过障碍的最短路径计算方法,vc6编写,有示意像素界面,方便初学者理解计算方法。-Two o clock direct shortest path around obstacles calculation method, vc6 preparation, a signal pixel interface, easy for beginners to understand the calculation.
CNTK
- 在深度的重要性的驱使下,出现了一个新的问题:训练一个更好的网络是否和堆叠更多的层一样简单呢?解决这一问题的障碍便是困扰人们很久的梯度消失/梯度爆炸,这从一开始便阻碍了模型的收敛。归一初始化(normalized initialization)和中间归一化(intermediate normalization)在很大程度上解决了这一问题,它使得数十层的网络在反向传播的随机梯度下降(SGD)上能够收敛。 当深层网络能够收敛时,一个退化问题又出现了:随着网络深度的增加,准确率达到饱和(不足为奇)然后迅
A星算法
- 算法可绕过障碍点,实现起始点与目标点的最近距离(The algorithm can bypass the obstacle point and realize the closest distance between the starting point and the target point.)