Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel

First Page		Document Content
Date: 2014-08-11 10:56:40 Heuristics Linux games Windows games Sokoban Heuristic function Heuristic Admissible heuristic Mathematical optimization Planning Domain Definition Language Digital media Application software Software		Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel Add to Reading List Source URL: ai.cs.unibas.ch Download Document from Source Website File Size: 1,55 MB Share Document on Facebook

	Common Subexpressions in Constraint Models of Planning Problems Andrea Rendl, Ian Miguel, Ian P. Gent Peter Gregory School of Computer Science, University of St Andrews, UK DocID: 18ZDU - View Document
	Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel DocID: 18Yz0 - View Document
	Proceedings of the 6th Annual North American Conference on AI and Simulation in Games (GAMEON-NA), pp. 5-12, PROCEDURAL GENERATION OF SOKOBAN LEVELS Joshua Taylor and Ian Parberry Dept. of Computer Science & Engin DocID: 18XaD - View Document
	Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Dietrich Zerr DocID: 18QE2 - View Document
	Sokoban.org 发关卡指南日期：2014 年 2 月 11 日一、“关卡保持原样”选项默认情况下，所有发布的关卡都会被系统自动“简单”规范化。这个默认的处理的确很简单： DocID: 13x6A - View Document