Home > Search Results: keywords:"straight line decomposition"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Algorithms for browsing 2D maze
 Chvíla, Lukáš ; Jelínek, Aleš (referee) ; Žalud, Luděk (advisor)
This thesis describes an automatic path finding method in a 2D maze defined by bitmap evidence grids. The problem was solved in the programming language C# with the help of the straight line decomposition algorithm used for creating a network of potential routes. The algorithm assumes approximation of obstacles by vector polygons. The resulting path was found by the means of algorithm A*. The result is a path described by line segments. After some modifications, the path could be used for robot navigation.
Detailed record
Algorithms for browsing 2D maze
 Chvíla, Lukáš ; Jelínek, Aleš (referee) ; Žalud, Luděk (advisor)
This thesis describes an automatic path finding method in a 2D maze defined by bitmap evidence grids. The problem was solved in the programming language C# with the help of the straight line decomposition algorithm used for creating a network of potential routes. The algorithm assumes approximation of obstacles by vector polygons. The resulting path was found by the means of algorithm A*. The result is a path described by line segments. After some modifications, the path could be used for robot navigation.
Detailed record
Algorithms for browsing 2D maze
 Chvíla, Lukáš ; Jelínek, Aleš (referee) ; Žalud, Luděk (advisor)
This thesis describes an automatic path finding method in a 2D maze defined by bitmap evidence grids. The problem was solved in the programming language C# with the help of the straight line decomposition algorithm used for creating a network of potential routes. The algorithm assumes approximation of obstacles by vector polygons. The resulting path was found by the means of algorithm A*. The result is a path described by line segments. After some modifications, the path could be used for robot navigation.
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