Search

2010

Nakhost, Hootan, Müller, Martin

Technical report TR10-01. Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become increasingly important. The most recent planning competition IPC-2008 used the cost of the...

2013

Valenzano, Richard, Müller, Martin, Xie, Fan

Most of the satisficing planners which are based on heuristic search iteratively improve their solution quality through an anytime approach. Typically, the lowest-cost solution found so far is used to constrain the search. This avoids areas of the state space which cannot directly lead to lower...

Spring 2016

Xie, Fan

This thesis proposes, analyzes and tests different exploration-based techniques in Greedy Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration-based techniques by combining GBFS and random walk exploration locally. We then conduct deep analysis on how...

2013

Hunt, Colin, Müller, Martin

Fuegito is an educational software package for learning about programming two player games. The package provides a simple, yet flexible and extensible framework which allows students to study the core search algorithms of computer game-playing, and extend them easily in projects. The current...

2010

Müller, Martin

Technical report TR10-08. A Human vs Computer Go competition took place in Barcelona, Spain on July 20, 2010. This report provides a report and some analysis of the games played by FUEGO-GB PROTOTYPE in this event. The program played well in its 9 x 9 games with White, winning against...

2010

Mueller, Martin, Hoffman, Joerg, Nakhost, Hootan

Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...