CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - a star search path
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - a star search path - List
[
AI-NN-PR
]
DStar_5.26
DL : 0
人工智能里的A-star算法,用于机器人的路径规划和寻优.-AI's A-star algorithm for robot path planning and optimization.
Date
: 2025-12-17
Size
: 2.01mb
User
:
yys
[
AI-NN-PR
]
A-star(vb)
DL : 0
初学A*算法的很好源码,基于最短路径规则-Novice A* algorithm is a good source, based on the shortest path rules
Date
: 2025-12-17
Size
: 5kb
User
:
杨羽
[
AI-NN-PR
]
AI_Eight_number
DL : 0
本程序用来实现八数码难题。采用A星算法,设计程序,求出从初始状态到目标状态的最优路径,并给出问题的状态表示、编码规则、搜索算法分析、简单程序说明和求得的最优路径。编程方法新颖,思路清晰明了。-This procedure used to achieve the eight puzzle. A star algorithm used, the design process, from initial state to find the optimal path to goal state, and gives the state the problem that the encoding rules, the search algorithm analysis, a simple description of the procedures and obtain the optimal path. Programming approach is novel, thinking clear.
Date
: 2025-12-17
Size
: 260kb
User
:
abler
[
AI-NN-PR
]
An-Improved-A--Star-Algorithm
DL : 0
(被EI收录,不错的文章)传统A*算法在栅格地图上进行路径规划时,求解得到的路径长度不是最短并且转折点较多。针对这些不足,提出了一种改进A*算法,将传统A*算法的可搜索邻域个数从离散的8个拓展为无限个,可以沿任意方向进行搜索。这样不仅求解出来的路径长度更短,并且大大降低了其转折点的个数。该算法被应用于自主研发的“智能先锋”号系列无人驾驶车辆上,实车试验以及它们在“中国智能车未来挑战赛”中的优异表现证明该方法能够在栅格地图中求解出一条更优的可行驶路径,可以显著提升无人驾驶车辆行驶的效率和平稳性。-The paths obtained by conventional A* algorithm in grid map are usually not the optimal solutions, which have many turning nodes. To solve these problems, an improved A*algorithm is presented. In this method, the number of searchable neighbourhood is extended to infinite (basic A*algorithm has 8 discrete searchable neighbourhoods), and the search direction can be arbitrary. As a result, the path produced by the improved A*is much shorter and the number of turning nodes is greatly reduced. The proposed method is implemented on our self-developed unmanned vehicle, Intelligent Pioneer. The vehicle experiments and its good performance in the Intelligent Vehicle Future Challenge of China show that the resulting path of our method is more optimal, which observably improves the driving efficiency and stationarity of the unmanned vehicles.
Date
: 2025-12-17
Size
: 586kb
User
:
王辉
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.