Name: | Reactive planning | ||||
You will learn: | Java/C++, reactive planning | ||||
Difficulty: | moderate | ||||
Excitement: | Reactive planning paradigm is often used in Artificial Intelligence and is considered an industry standard for single AIs | ||||
Description: | The reactive planning paradigm is often used due to the timely fashion it operates in - the techniques employed range from Finite State Machines (FSMs) to Behavioral Trees and IF-THEN rules. Most models currently used are simplistic to avoid implementation and debugging issues. The basic model of Reactive Planning (RP) is the Hierarchical RP, where IF-THEN plans are organized into a tree-like hierarchy structure. The goal of this thesis is to implement a newly introduced State Full HRP (SF-HRP) model. The resulting library should be easily incporatible into other projects There are two distinct themes. Each can be done by one student:
Theme 1 - reserved
Theme 2 Further Reading: |
|
1. Plch, T.: Action Selection for an Animat. Diploma thesis. MFF, UK, 2009 |
2. Isla, D.: Handling complexity in Halo 2. In: Gamastura online, 03/11 (2005) 3. Brom, C.: Hierarchical Reactive Planning: Where is its limit? In: Proceedings of MNAS workshop. Edinburgh, Scotland (2005) 4. Bryson, J.: Intelligence by Design: Principles of Modularity and Coordination for Engineering Complex Adaptive Agents. PhD thesis, Massachusetts Institute of Technology (2001) |