|
| |
|
|
Mobile robot path planning by means of ant algorithms
Sedlák, Václav ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with robot path planning by means of ant colony optimization algorithms. The theoretical part of this thesis introduces basics of path planning problematics. The theoretical part either deals with ant algorithms as optimization and path planning tools. The practical part deals with design and implementation of path planning by means of ant algorithms in Java language.
|
|
|
Real-time path planning
Bartozel, Zdeněk ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
The thesis deals with the path planning and movement of the holonomic robot in a dynamic environment. The aim of this work is implementation of several algorithms based on Rapidly-explored random tree algorithm and their comparison in designed dynamic environment.
|
|
|
Robot path planning by means of ant algorithms
Pěnčík, Martin ; Krček, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with robot path planning. It contains an overview of general approaches for path planning and describes methods of swarm intelligence and their application for robot path planning. This paper also contains proposals of adjustments for ant algorithms and it presents experimental results of algorithm implementation.
|
|
| |
|
|
Trajectory planning of Vehicle with Four Independently Steered Wheels
Śniežek, Roman ; Dobossy, Barnabás (referee) ; Brablc, Martin (advisor)
This thesis focuses on a kinematic model of a four-wheel steering vehicle and its simulation. The aim of the thesis is to use the kinematic model and path following algorithms to create a trajectory as a vector of the wheel steering angles dependent on a time and the distance travelled. This trajectory provides a collision-free transfer from starting position to the goal on a map with static obstacles. This could be used in an autonomous vehicle while navigating in a known enviroment
|
|
|
Path Planning for Autonomous Vacuum Cleaners
Hranický, Jan ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Complete coverage path planning is a task of finding such path that passes over all points in given area at least once. This thesis applies complete coverage path planning to autonomous vacuum cleaner robots. Thesis summarises current deal of autonomous vacuum cleaner robots. But mainly it focuses on describing complete coverage algorithms. Selected algorithms are implemented using Java vizlib library.
|
|
|
Robot path planning by means of reinforcement learning
Veselovský, Michal ; Liška, Radovan (referee) ; Dvořák, Jiří (advisor)
This thesis is dealing with path planning for autonomous robot in enviromenment with static obstacles. Thesis includes analysis of different approaches for path planning, description of methods utilizing reinforcement learning and experiments with them. Main outputs of thesis are working algorithms for path planning based on Q-learning, verifying their functionality and mutual comparison.
|
|
|
Path Planning in the OpenStreet Map
Dobeš, Jan ; Luža, Radim (referee) ; Rozman, Jaroslav (advisor)
This thesis investigates possible route planning methods in OpenStreet map and Robot operating system (ROS framework), investigates already existing solutions and then implements well integrated own library with own planning algorithms and other improvements. Finally, implemented features are verified.
|
|
|
Path planning for multiple robots
Sekáč, Ondřej ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This master thesis deals with path planning for multiple mobile robots. The theoretical part describes robot navigation -- mapping and path planning. Selected methods of artificial intelligence used in multi-robot path planning are described. In practical part simulator is implemented, in which selected algorithms were compared using experiments.
|
guest ::
