A Scalable Heuristic Based on Hypercube Graph for Automated Planner

Abstract:

Article Preview

There are much research into Artificial Intelligence (AI) and Semantic Web over the past few years and intelligent behaviour such as learning, analysing, problem solving, planning and abstracting is displayed by modern computer systems. Automatically acquiring domain-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training material. In planning, there is a novel ways to search knowledge when solving problems. This Paper presents a new heuristic for carrying out searches of training material, where metadata and the knowledge build into them are captured and fully scalable. These insfrastructure use AI Planning and Ontology technologies, allowing to construct learning rules dynamically based on the general Domain independent Planner even from disjoint learning objects, and meeting the learner’s profile, preferences needs and abilitity. We provide an efficient topology construction and maintenance algorithm, and show how our scheme can be made even more efficient by using a globally known ontology to determine the organization of nodes in the graph topology, allowing for efficient concept-based search.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

1830-1835

DOI:

10.4028/www.scientific.net/KEM.474-476.1830

Citation:

H. Qian et al., "A Scalable Heuristic Based on Hypercube Graph for Automated Planner", Key Engineering Materials, Vols. 474-476, pp. 1830-1835, 2011

Online since:

April 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.