Home > Search Results: Ramesh, Samyuktha
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
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.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English