National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Map Making Using Particle Filters and Laser Scanner
Izrael, Petr ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
This thesis describes basics of automatic map making based on odometry and laser range data of a robot. This task is also known as Simultaneous Localization and Mapping. Approach described in this thesis uses particle filters for creating planar grid-based maps. Final chapters are concerned with own implementation and some basic experiments.
GPU Accelerated SAT Solver
Izrael, Petr ; Šimek, Václav (referee) ; Jaroš, Jiří (advisor)
This thesis is concerned with design and implementation of a complete SAT solver accelerated on GPU. The achitecture of modern graphics cards is described as well as the CUDA platform and a list of common algorithms used for solving the boolean satisfiability problem (the SAT problem). The presented solution is based on the 3-SAT DC alogirthm, which belongs to the family of well-known DPLL based algorithms. This work describes problems encountered during the design and implementation. The resulting application was then analyzed and optimized. The presented solver cannot compete with state of the art solvers, but proves that it can be up to 21x faster than an equivalent sequential version. Unfortunately, the current implementation can only handle formulas of a limited size. Suggestions on further improvements are given in final sections.
Map Making Using Particle Filters and Laser Scanner
Izrael, Petr ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
This thesis describes basics of automatic map making based on odometry and laser range data of a robot. This task is also known as Simultaneous Localization and Mapping. Approach described in this thesis uses particle filters for creating planar grid-based maps. Final chapters are concerned with own implementation and some basic experiments.
GPU Accelerated SAT Solver
Izrael, Petr ; Šimek, Václav (referee) ; Jaroš, Jiří (advisor)
This thesis is concerned with design and implementation of a complete SAT solver accelerated on GPU. The achitecture of modern graphics cards is described as well as the CUDA platform and a list of common algorithms used for solving the boolean satisfiability problem (the SAT problem). The presented solution is based on the 3-SAT DC alogirthm, which belongs to the family of well-known DPLL based algorithms. This work describes problems encountered during the design and implementation. The resulting application was then analyzed and optimized. The presented solver cannot compete with state of the art solvers, but proves that it can be up to 21x faster than an equivalent sequential version. Unfortunately, the current implementation can only handle formulas of a limited size. Suggestions on further improvements are given in final sections.

See also: similar author names
2 Izrael, Peter
Interested in being notified about new results for this query?
Subscribe to the RSS feed.