Loading...
Please wait, while we are loading the content...
Similar Documents
A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Zhang, Zhanying Zhao, Ziping |
| Copyright Year | 2014 |
| Abstract | Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for short) in a static and dynamic obstacles co-existing environment is studied. An A-STAR-Dijkstra-integrated algorithm is promoted to make multiple cars moving parallely without collision or deadlock. Both two algorithms are optimized too. The algorithm has applied in smart park. |
| Starting Page | 75 |
| Ending Page | 86 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| DOI | 10.14257/ijsh.2014.8.3.07 |
| Alternate Webpage(s) | http://www.sersc.org/journals/IJSH/vol8_no3_2014/7.pdf |
| Alternate Webpage(s) | https://doi.org/10.14257/ijsh.2014.8.3.07 |
| Volume Number | 8 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
