Home > Search Results: keywords:"logistics domain"
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. 
Planning algorithms and plan simulation in logistics domain
 Štefan, Zdeněk ; Toropila, Daniel (advisor) ; Valla, Tomáš (referee)
The goal of this thesis is to compare some means of planning in the logistics domain.The aim was to compare the capabilities of those techniques among each other and against plans designed by humans.Because some planners do not return parallel plans,it is necessary to parallelize them.It is shown that some algorithms achieve good results in comparison to plans designed by hu- mans. However, due to their high time and memory consumptions they cannot be nowadays commonly used to solve more difficult tasks.
Detailed record
Petrobras Planning Domain: PDDL Modeling and Solving
 Hanes, Martin ; Toropila, Daniel (advisor) ; Gemrot, Jakub (referee)
The thesis explores Petrobras domain from the challenge track of the ICKEPS 2012 competition, which is an example of a difficult problem stand- ing on the borderline between planning and scheduling. It describes state-of-art techniques of the modern artificial intelligence that were chosen for this purpose. It guides the reader in the process of modeling the Petrobras domain in PDDL language and explains the results provided by the existing tools used within plan- ning community. In the end it compares the results of the chosen approach to the other approaches used in ICKEPS 2012 competition, showing that the existing sequential planning systems are usable only for solving smaller problem instances of this domain.
Detailed record
Planning algorithms and plan simulation in logistics domain
 Štefan, Zdeněk ; Toropila, Daniel (advisor) ; Valla, Tomáš (referee)
The goal of this thesis is to compare some means of planning in the logistics domain.The aim was to compare the capabilities of those techniques among each other and against plans designed by humans.Because some planners do not return parallel plans,it is necessary to parallelize them.It is shown that some algorithms achieve good results in comparison to plans designed by hu- mans. However, due to their high time and memory consumptions they cannot be nowadays commonly used to solve more difficult tasks.
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