Master thesis defence: Graph-Theoretical Classification of the Complexities of Planning Domains

[Thomas Bolander]

Master thesis defense in Algolog. All are welcome. 

When: Monday, January 30, 9.00-11.00

Location: build. 322, room 205.

Title: Graph-Theoretical Classification of the Complexities of Planning Domains 
Speaker: Søren Bøg

Abstract:

Automated planning is one of the cornerstones of modern Artificial Intelligence (AI). As with many of the fields within AI, automated planning is something we do naturally as humans yet is extremely hard to do computationally, this seems paradoxical. Therefore there is much interest in determining under what conditions automated planning is easy. This thesis examines the use of the state graph of planning problems to define conditions on automated planning. As a part of this two new cases are presented where planning is easier than full automated planning and in one of the cases actually tractable.