Name
Abstract | ||
|---|---|---|
Path planning under two-dimensional maps is a fundamental problem in mobile robotics and other real-world applications (unmanned vehicles, navigation applications for mobile phones, and so forth). However, traditional algorithms (graph searching, artificial potential field, genetic, and so forth) rely on grid-by-grid searching. Thus, these methods generally do not find the global optimal path, and... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TII.2019.2918589 | IEEE Transactions on Industrial Informatics |
Keywords | Field | DocType |
Path planning,Robots,Genetic algorithms,Planning,Two dimensional displays,Informatics,Genetics | Topology,Shortest path problem,Computer science,Real-time computing,Tangent | Journal |
Volume | Issue | ISSN |
16 | 2 | 1551-3203 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhuo Yao | 1 | 0 | 1.69 |
| Weimin Zhang | 2 | 84 | 20.87 |
| Yongliang Shi | 3 | 1 | 2.32 |
| Mingzhu Li | 4 | 3 | 3.09 |
| Zhenshuo Liang | 5 | 0 | 1.69 |
| Qiang Huang | 6 | 266 | 91.95 |