Eraghi et al., 2014 - Google Patents
Path length comparison in grid maps of planning algorithms: HCTNav, A* and DijkstraEraghi et al., 2014
View PDF- Document ID
- 15019243835435086767
- Author
- Eraghi N
- Lopez-Colino F
- De Castro A
- Garrido J
- Publication year
- Publication venue
- Design of Circuits and Integrated Systems
External Links
Snippet
An important aspect in path planning for mobile robots is to find the shortest path length from one point to another. In this paper, we implement HCTNav algorithm, A∗ and Dijkstra's algorithms on grid based maps and then compare their obtained path lengths. HCTNav …
- 238000005457 optimization 0 description 32
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111811514B (en) | Path planning method based on regular hexagon grid jump point search algorithm | |
| CN104050390B (en) | Mobile robot path planning method based on variable-dimension particle swarm membrane algorithm | |
| Deng et al. | Multi-obstacle path planning and optimization for mobile robot | |
| CN112229419B (en) | Dynamic path planning navigation method and system | |
| Janchiv et al. | Complete coverage path planning for multi-robots based on | |
| Eraghi et al. | Path length comparison in grid maps of planning algorithms: HCTNav, A* and Dijkstra | |
| CN101241507A (en) | Map road-seeking method and system | |
| CN111080786B (en) | BIM-based indoor map model construction method and device | |
| CN112539750B (en) | Intelligent transportation vehicle path planning method | |
| Kulich et al. | Single robot search for a stationary object in an unknown environment | |
| Gu et al. | Path planning for mobile robot in a 2.5‐dimensional grid‐based map | |
| Žunić et al. | Software solution for optimal planning of sales persons work based on Depth-First Search and Breadth-First Search algorithms | |
| Kulich et al. | Comparison of exploration strategies for multi-robot search | |
| CN113325834A (en) | Path planning method of improved A-x algorithm based on graph preprocessing | |
| CN110975288A (en) | Geometric container data compression method and system based on jumping point path search | |
| CN114995391A (en) | 4-order B spline curve path planning method for improving A-star algorithm | |
| CN114564048A (en) | Improved method for planning flight path of agricultural four-rotor unmanned aerial vehicle | |
| Lai et al. | Development and analysis of an improved prototype within a class of bug-based heuristic path planners | |
| Ali et al. | Global mobile robot path planning using laser simulator | |
| Bo et al. | The research on E-commerce logistics picking AGV path optimization method based on the improved A* algorithm | |
| Tanner | Jump Point Search Analysis | |
| CN111912407B (en) | Path planning method of multi-robot system | |
| Cao et al. | A framework of a fast any-angle path finding algorithm on visibility graphs based on A* for plumbing design | |
| Amador et al. | Bounded-Search Pathfinders Based on Influence Maps Generated by Attractors and Repulsors | |
| Janis et al. | Integration of Enhanced Jump Point Search Algorithm and Modified Bresenham Technique for Path Finding in Grid-Based Map Environment |