|
| |
|
| |
|
|
Multirobot Path Planning in a Dynamic System
Plachý, Dominik ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis deals with the design of a path planning algorithm for a multi-robot system in order to cover a dynamic environment. The coverage problem is solved by dividing the space into equal sized areas, of which there are at least as many as the number of agents covering the space. The agents divide the areas among themselves and resolve any collisions that occur. They are also able to react by changing their plan when they encounter an obstacle. The thesis contains measured and commented data from running the algorithm for different parameters of the environment dynamics. The result of the work is an algorithm whose efficiency increases directly proportional to the number of agents.
|
|
|
Multirobot Path Planning in a Dynamic System
Plachý, Dominik ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis deals with the design of a path planning algorithm for a multi-robot system in order to cover a dynamic environment. The coverage problem is solved by dividing the space into equal sized areas, of which there are at least as many as the number of agents covering the space. The agents divide the areas among themselves and resolve any collisions that occur. They are also able to react by changing their plan when they encounter an obstacle. The thesis contains measured and commented data from running the algorithm for different parameters of the environment dynamics. The result of the work is an algorithm whose efficiency increases directly proportional to the number of agents.
|
|
| |
|
| |
|
|
Application of optimization methods in e-shopping
Hollayová, Nela ; Zouhar, Jan (advisor) ; Fábry, Jan (referee)
The subject of the thesis is the optimization of one the key processes in a book e-shop, namely delivery of goods from suppliers. In particular, we focus on the problems of selection of suppliers and the subsequent route optimization in daily pick-ups of orders. The proposed solution uses a combination of two mixed integer programming models. The model for supplier selection was designed so as to reflect the empiric approaches that are currently employed in the e-shop; the model for route optimization is a modified version of the canonical travelling salesman problem. On the basis of achieved results, we presented effective procedures for solving both of the aforementioned problems and suggested their implementation into the e-shop's enterprise resource planning system.
|
guest ::
