| Title |
Mobilaus autonominio roboto trajektorijos planavimas pavojingoje, dalinai žinomoje aplinkoje, siekiant išvengti susidūrimo su kliūtimis / |
| Translation of Title |
Path planning of an autonomous mobile robot to avoid the risk of collision with obstacles in a dangerous, partially known environment. |
| Authors |
Katkus, Robertas |
| Full Text |
|
| Pages |
72 |
| Keywords [eng] |
A* algorithm ; D*Lite algorithm ; shortest path planning ; path replanning |
| Abstract [eng] |
Mobile robot movement in the environment need to know the way he has to move. Most often necessary to know the shortest way. There are a number of very different path search algorithms, as well as the new ones and modified already in build. In this paper we will the most commonly used shortest path search algorithms to compare them. After analysis of algorithms, we will choose 2 algorithms to realize them with Matlab software to compare the results of path planning. We will choose one of these algorithms to drive with real autonomous mobile robot E-Puck in simulated environment, by finding the shortest path in a way that robot will avoid collision with obstacles while driving it. |
| Dissertation Institution |
Kauno technologijos universitetas. |
| Type |
Master thesis |
| Language |
Lithuanian |
| Publication date |
2015 |
