|
| |
|
|
Visualisation of Path-Planning
Vozák, Petr ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This thesis deals with sampling-based algorithms for nonholonomic (mainly car robot) and flexible robot path planning. Theoretical principles of probabilistic path finding and its implementation detail are discussed here. Java applets for visualization of algorithms and web pages are include on the CD.
|
|
|
Path Planning in 3D Space
Sasýn, Radek ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This work describes path finding among obstacles in 3D space using probabilistic algorithms. Users can create scene in application GUI - define start object, obstacles, goal position and run probabilistic algorithm. The finding path is visualized. The work describes probabilistic algorithm, collision detection and the basics of 3D graphics and shows design and implementation of an application created.
|
|
|
Path Planning in 3D Space
Němec, František ; Samek, Jan (referee) ; Rozman, Jaroslav (advisor)
This paper deals with the problem of object path planning in 3D space. The goal is to create program which allows users to create a scene used for path planning, perform the planning and finally visualize path in the scene. Work is focused on probabilistic algorithms that are described in the theoretical part. The practical part describes the design and implementation of application. Finally, several experiments are performed to compare the performance of different algorithms and demonstrate the functionality of the program.
|
|
|
Path Planning Algorithms Visualisation
Bréda, Márton ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Cílem tohoto práce je ukázat některé z nejdůležitějších algoritmů používaných při plánování cest. To také popisuje aplikaci, která byla vytvořena, aby umožnila lidem experimentovat s těmito algoritmy. K tomuto účelu využívá knihovnu, kterou v roce 2017 představil Jakub Rusnák, tzn jde o pokračování a možná i rozšíření jeho práce.
|
|
|
Path Planning in 3D Space
Krčmář, Radim ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Following thesis presents basics of motion planning, focusing on sampling-based algorithms. System for collision of objects in arbitrary dimensional space is created using linear algebra. Basic options for visualizaton of three-dimensional data are described. Selected algoritms were implemented in haskell and used to pull hedgehog out of the cage (popular disentanglement puzzle in Czech Republic).
|
|
|
Path Planning Algorithms Visualisation
Bréda, Márton ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Cílem tohoto práce je ukázat některé z nejdůležitějších algoritmů používaných při plánování cest. To také popisuje aplikaci, která byla vytvořena, aby umožnila lidem experimentovat s těmito algoritmy. K tomuto účelu využívá knihovnu, kterou v roce 2017 představil Jakub Rusnák, tzn jde o pokračování a možná i rozšíření jeho práce.
|
|
|
Genomic approaches for studying speciation
Vozárová, Zuzana ; Reifová, Radka (advisor) ; Hulva, Pavel (referee)
Technological advances in DNA sequencing along with the emergence of new informatics approaches have created new possibilities in many biological fields. In this bachelor thesis, I will focus on the informatics approaches used in speciation genomics, that is research field focused on the problematics of the origin of new species. I will introduce some statistical methods used by these approaches for parameter estimation. The four particular methods I will write about are Maximum likelihood estimation, Bayesian model, Markov chain Monte Carlo and Iterative approach. I will describe several methods used for the detection of interspecific hybrids and recent as well as historical interspecific gene flow. These methods include NewHybrids, the hybrid index, genomic and spatial clines and coalescent-based methods. The thesis demonstrates the usefulness of the connection of applied mathematics and genomics for addressing general biological issues, and speciation particularly.
|
|
| |
|
|
Path Planning in 3D Space
Němec, František ; Samek, Jan (referee) ; Rozman, Jaroslav (advisor)
This paper deals with the problem of object path planning in 3D space. The goal is to create program which allows users to create a scene used for path planning, perform the planning and finally visualize path in the scene. Work is focused on probabilistic algorithms that are described in the theoretical part. The practical part describes the design and implementation of application. Finally, several experiments are performed to compare the performance of different algorithms and demonstrate the functionality of the program.
|
guest ::
