This paper describes POND, a planner developed to solve problems characterized by partial observability and nondeterminism. POND searches in the space of belief states, guided by a relaxed plan heuristic. Many of the more interesting theoretical issues showcased by POND show up within its relaxed plan heuristics. Namely, the exciting topics are defining distance estimates between belief states,...

planner in the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS’00) planning systems competition. Like the well-known HSP system, FF relies on forward search in the state space, guided by a heuristic that estimates goal distances by ignoring delete lists. It differs from HSP in a number of important details. This article describes the algorithmic technique...

The large collection of educational data provides the opportunity to study how students learn and can be a source of valuable knowledge both for students when planning their studies and for educators and administrators for improving their curricula and services. In our work, we mine course relationships and student consumption patterns found in the data. We present a visual analysis system, Lea...

We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. It uses state abstraction to avoid evaluating states individually. And it uses forward search from a start state, guided by an admissible heuristic, to avoid evaluating all states. These approaches are combined in a novel way that exploits symbolic model-checking techniq...

In this paper we present the design and algorithmic details of a directed search planner to solve benchmark planning problems speci ed in PDDL+ syntax. The planner copes with durative actions, grounds and groups predicates and instantiates functions. The operators possibly span an in nite state space which is tackled by guided exploration. The heuristic estimates are inferred by plan relaxation...

A CAD-guided vision sensor planning system is developed in our lab. To improve the efficiency of the inspection system, the path planning problem is rendered as a Traveling Salesman Problem(TSP). A new approach is developed to solve the TSP into its suboptimality quickly. First, viewpoints are clustered into several groups. Second, clustered Traveling Salesman Problem is solved by favoring the ...

The aim of the present study was to conduct a critical literature review about the technique of computer-guided surgery in implantology to highlight the indications, purposes, immediate loading of implants and complications, protocol of fabrication, and functioning of virtual planning software. This literature review was based on OLDMEDLINE and MEDLINE databases from 2002 to 2010 using the key ...

Background Preoperative total hip arthroplasty templating can be performed with radiographs using acetate prints, digital viewing software, or with computed tomography (CT) images. Our hypothesis is that 3D templating is more precise and accurate with cup size prediction as compared to 2D templating with acetate prints and digital templating software. Methods Data collected from 45 patients u...

This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between basic beliefs regarding the state of the world or the specification of the planning operators. We introduce simple and efficient argument moves that enable discussion about planning steps, and show how these can be integrated int...

A CAD-guided camera planning system for dimensional inspection of automotive parts has been developed in this paper. This system utilizes the CAD information of inspected parts and the camera model to plan camera viewpoints that satisfy certain task constraints. To overcome some limitation inherited in the existing method, a new CAD data representation is adopted to combine the advantages of pa...