National Repository of Grey Literature 26 records found  1 - 10nextend  jump to record: Search took 0.00 seconds. 
Constructing policies for multi-agent path finding
Mestek, Jakub ; Barták, Roman (advisor) ; Švancara, Jiří (referee)
The thesis deals with the Multi-Agent Path Finding problem. The task is to find for each agent a path from its current location to its destination in such a way that agents will not collide. A novel approach to solving this problem in non-deterministic environment is suggested. That is to look for a solution in form of policies that prescribe which action the agent should perform in given situation. 1
Group navigation in RTS games using flow networks over flow field regions
Koblížek, Jan ; Gemrot, Jakub (advisor) ; Švancara, Jiří (referee)
This thesis explores the challenges of implementing effective navigation for groups of units in real-time strategy computer games, specifically focusing on the movement of large numbers of homogeneous units across a two-dimensional grid-based map. The thesis presents a pathfinding algorithm that could be used in RTS games. The algorithm enables the units to utilize multiple paths effectively by modeling the unit navigation as a flow network problem. The units use precomputed flow fields during the navigation. This allows for faster pathfinding times by offloading part of the computation to the preprocessing. The algorithm's performance is evaluated against a baseline solution using the A* algorithm and other existing solutions. Comparative analysis will be conducted utilizing maps from the Moving AI 2D Pathfinding Benchmark dataset to assess the efficacy of the proposed solution. 1
The Effectiveness of Centralized Planning for Intersections
Cizl, Eliáš ; Švancara, Jiří (advisor) ; Ivanová, Marika (referee)
Vehicle navigation on roads is a complex problem that will probably be solved by using artificial intelligence in key roles. Today, there are cars capable of autonomous driving, but they are dependent on an old infrastructure that primarily includes intersections designed for human drivers. This thesis opens a new chapter in the area of autonomous intersection management (AIM). Most research to date has only looked at how best to implement a solution for a single intersection. We have created a simulation that runs in real time, where up to several dozen intersections appear side by side. In this work, we conduct experiments where we test different layouts of the autonomous algorithms along with traffic lights. Autonomous intersections clearly win with their efficiency, and in larger cities it's most advantageous to deploy them at the busiest intersections. 1
Autonomous traffic junction
Kotal, Jiří ; Barták, Roman (advisor) ; Švancara, Jiří (referee)
Práce se zabývá problematikou průjezdů vozů plně automatizovanou křižovatkou a to z pohledu multi-agentního hledání cest (MAPF, multi-agent path finding). Cílem je pro- zkoumat různé abstrakce křižovatky a různé přístupy pro hledání nekolizního průjezdu křižovatkou. Zkoumané techniky jsou implementovány a empiricky porovnány v simulo- vaném prostředí. 1
Reduction-based Solvers for Multi-agent Pathfinding: Comparing Different Models
Ramesh, Samyuktha ; Švancara, Jiří (advisor) ; Barták, Roman (referee)
- Samyuktha Ramesh Thesis Title: Reduction-based Solvers for Multi-agent Pathfinding: Comparing Different Models Multi-agent path finding (MAPF) is the problem of navigating a set of agents from their starting position to their respective goal position without any collisions. In this thesis, we provide an overview of the current approaches to solving MAPF. We implement six different encodings found in the literature using the Python programming language and the Glucose3 SAT solver. We run experiments on maps of different types and sizes to compare the performances of the encodings.
Practical Exercises for Artificial Intelligence
Mařík, Matouš ; Švancara, Jiří (advisor) ; Zelinka, Mikuláš (referee)
The thesis describes practical tasks for the lecture of Artificial Intelligence, that is to introduce students to basic structures and algorithms of this field of informatics: rational agent, uninformed and informed search, adversarial search and algorithms solving constraint satisfaction problems. It consists of the motivation for their creation, their implementation and documentation.
Traffic - Road Network Simulation Game
Kripner, Matěj ; Ježek, Pavel (advisor) ; Švancara, Jiří (referee)
The goal of this thesis was to implement the mobile game Traffic, in which the player controls a car and navigates through a road network. The general concept of the game is based on our vision of a game simulating the experience of driving that would be different from similar existing games. This vision proved to be overly complex. Therefore, we selected only a subset of its features while ensuring that the resulting game can serve as a basis for future extension towards the original vision. We targeted the Android operating system and used the Unity game engine and C# for implementation. In the resulting game, the player acts as a taxi driver, i.e. they pick up customers and drop them off at designated locations. The player receives game money and rating based on the quality of each ride. The game world contains roads, intersections, sidewalks, buildings and pedestrians. The game world can be edited by a game designer with no programming skills. The designer can shape the roads and sidewalks using Bézier curves and connect roads into intersections. The shape of intersections is generated automatically. 1
Finding Minimum Satisfying Assignments of Boolean Formulas
Švancara, Jiří ; Balyo, Tomáš (advisor) ; Trunda, Otakar (referee)
In this thesis we examine algorithms and techniques used for solving Boolean satisfiability (SAT). Then we inspect the possibility to use them in solving the weighted short SAT problem, which is a generalization of the satisfiability problem. Given that each variable has a weight, this generalization is the problem of finding a satisfying truth assignment while using the smallest sum of weights. To solve this problem, we introduce three truth assignments of variables - True, False and Unassign. We show that not all algorithms and techniques used in modern SAT solvers can be used in our program. Those that can be converted, will be implemented using our three truth assignments. This will yield several versions of our new solver, which will be compared. Powered by TCPDF (www.tcpdf.org)
Multi-agent Path Finding
Švancara, Jiří ; Barták, Roman (advisor)
Multi-Agent Path Finding (MAPF) is the task to find efficient collision-free paths for a fixed set of agents. Each agent moves from its initial location to its desired destination in a shared environment represented by a graph. The classical definition of MAPF is very simple and usually does not reflect the real world accurately. In this thesis, we try to add several attributes to the MAPF definition so that we overcome this shortcoming. This is done in several steps. First, we present an approach on how to model and solve MAPF via reduction to Boolean satisfiability using Picat programming language. This provides us with a useful model that can be easily modified to accommodate additional constraints. Secondly, we modify MAPF to portray a more realistic world. Specifically, we allow new agents to enter the shared environment during the execution of the found plan, and we relax the requirement on the homogeneousness of the shared environment. Lastly, we experimentally verify the applicability of the novel models on real robots in comparison with the classical MAPF setting.
Multi-agent picker routing problem
Krejčí, Jiří ; Barták, Roman (advisor) ; Švancara, Jiří (referee)
An important part of warehouse operations is order picking, which is the process of collecting products from stocking locations. In our case, a scattered storage warehousing strategy is assumed. Items are stored at multiple locations scattered through the ware- house. Usually, multiple order pickers are responsible for a quick collection of items. That can result in order pickers blocking each other, reducing the picking throughput. Most of the existing picker routing algorithms are not concerned with picker blocking, even though its effect on picking efficiency can be substantial. It is the objective of this thesis to address the picker routing problem in a multi-agent environment. First, the literature is surveyed and then a multi-agent picker routing algorithm is presented. The algorithm is based on the idea of prioritized planning. Results of the empirical evaluation indicate that the multi-agent approach leads to better quality solutions. 1

National Repository of Grey Literature : 26 records found   1 - 10nextend  jump to record:
See also: similar author names
6 Švancara, Jan
Interested in being notified about new results for this query?
Subscribe to the RSS feed.