|
|
Algorithms for automated logistics
Tuláček, Michal ; Barták, Roman (advisor) ; Dvořák, Filip (referee)
This thesis deals with a real world problem of an optimal planning of transferring goods between stores of a certain retail company. The aim is to propose a system which, based on customer orders and current stock items availability, should be capable of devising an optimal plan. In this thesis, following a thorough analysis of the problem, there is a formalised problem of automated logistics. After a brief overview of existing approaches in the area of logistics problem solving, there are subsequently designed solution methods based on programming with limited conditions and mixed integer programming. Both methods are compared to each other experimentally, by taking into account the quality of the found solution and the methods' efficiency.
|
|
|
Real-time strategy game with artificial intelligence
Fanta, Petr ; Balyo, Tomáš (advisor) ; Dvořák, Filip (referee)
The aim of this thesis is to create a real-time strategy game with artificial intelligence in 3D environment. The thesis includes theoretical analysis of combat real-time strategy games, methods for implementing artificial intelligence in this kind of games, and the basic knowledge of 3D environment implementation. A simple 3D real-time strategy game with artificial intelligence has been implemented as a part of this this thesis.
|
|
|
Visualization and verification of plans
Glinský, Radoslav ; Barták, Roman (advisor) ; Dvořák, Filip (referee)
Title: Visualization and Verification of Plans Author: Radoslav Glinský Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor of the bachelor thesis: Doc. RNDr. Roman Barták, Ph.D. Abstract: Plan analysis is an important part of complete planning systems. In order to make even larger plans transparent and human readable, we have developed a program which helps users with the analysis and visualization of plans. This program is called VisPlan - Interactive Visualization and Verification of Plans. VisPlan is an inevitable part of this thesis as it practically implements its plan verification and visualization solutions. VisPlan finds and displays causal relations between actions, it identifies possible flaws in plans (and thus verifies plans' correctness), it highlights the flaws found in the plan and finally, it allows users to interactively modify the plan and hence manually repair the flaws or just fine-tune the plan. Keywords: Planning, Artificial Intelligence, PDDL, Verification
|
|
|
Scrabble
Dvořák, Filip ; Babilon, Robert (advisor) ; Hric, Jan (referee)
The subject matter of the submitted thesis is a study of the board game Scrabble and its transfer to electronic form. The object of this thesis is to present possible and used approaches in implementation of Scrabble systems and to present and evaluate data structures and algorithms used in those systems. The implementation of the chosen approaches is a part of this thesis. After the brief introduction into the rules of Scrabble and initiatory problem's analyse there are presented data structures used for dictionary storage, move generating algorithms and possible approaches in game strategies. The practical part of this thesis deals with chosen approaches and reasons why they were chosen. At the end of this thesis there is a summary of possible contributions of developed system and its possible following expansions.
|
|
|
Implementation of the SF-HRP action selection mechanism
Farka, František ; Plch, Tomáš (advisor) ; Dvořák, Filip (referee)
In this thesis, we present our C++ implementation of the State-Full Hierarchical Reactive Planning (SF-HRP) mechanism for action selection for virtual agents. The implementation is connected to 3D virtual environment and provides access to 3rd party software for profiling purposes vie defined interface. A prototype of such a profiler is part of the implementation. The thesis also presents an input format for agent's behavior description and is used within the implementation. Both the implementation and input format are demonstrated on testing scenarios. The SF-HRP concept is discussed with respect to the difficulty of design of agent's behavior and complexity of the implementation.
|
|
| |
|
| |
|
|
Visualization of plans for logistics tasks
Stočes, Filip ; Surynek, Pavel (advisor) ; Dvořák, Filip (referee)
Plan analysis is important for testing of planning systems and checking the plan before its execution. VLP application (result of this thesis) helps user with orientation in plans for logistical tasks and with finding possible flaws in plans. VLP offers tools for creating a logistical problem and running a planner, which creates a solution (plan) for this problem. The application then visualizes and simulates this plan, allowing the user to analyse it. VLP runs in a graphical user interface, so the user does not have to deal with writing problem and plan in PDDL.
|
|
|
AI Planning with Time and Resource Constraints
Dvořák, Filip ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
Automated planning plays an important role in many fields of human interest, where complex and changing tasks involve demanding efficiency and error-avoidance requirements. Research in planning is also motivated by capturing the computational aspects of Artificial Intelligence, where planning, being a reasoning side of acting, is one of the key elements. Introduction of time and resources into planning is an important step towards modelling problems from the real world, however planning is generally hard and introduction of time and resources makes it even harder. In this thesis we explore theoretical aspects of planning, temporal reasoning and resource reasoning. Based on these studies we develop our own suboptimal domain-independent planning system that focuses on planning, where time plays a major role and resources are constrained. We test the developed planning system on the planning problems with time and resources from the International Planning Competition 2008 and compare our results with the competition participants.
|
|
|
Integrating Planning and Scheduling
Dvořák, Filip
Title: Integrating Planning and Scheduling Author: Mgr. Filip Dvořák Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: prof. RNDr. Roman Barták, Ph.D., KTIML MFF UK Abstract: The main topic of the work is the design and development of a plan- space planning system FAPE that integrates explicit time reasoning, resource reasoning with discrete resources and reservoirs and hierarchical decompositions. FAPE is the first planning system that accepts the language ANML, supporting most of its major features. We investigate different aspects of the integration, also proposing a new problem reformulation technique for the state-variable represen- tation and discovering a transition of performance between sparse and minimal temporal networks. We further extend FAPE with acting capabilities and evalu- ate the runtime properties and benefits of its expressiveness. Finally, we present FAPE as a planning and acting system in real world experiments, where FAPE operates a PR2 robot. Keywords: planning, scheduling, temporal constraints, HTN, robotics
|
guest ::
RSS feed.