|
Technical Reports |
2001 | 2002 | 2003 | 2005 | 2007 | 2008 |
| NMSU-CS-2003-001 |
| Planning with Sensing Actions and Incomplete Information using Logic Programming |
| Tran Cao Son and Chitta Baral |
| Abstract: We present a logic programming based conditional planner that is capable of generating both conditional and sequential conformant plans in the presence of sensing actions and incomplete information. We prove the correctness of our implementation and show that our planner is complete with respect to the 0-approximation of sensing actions and the class of conditional plans considered in this paper which is large enough to cover conditional plans with bounded length and branching factor. Finally, we present some preliminary experimental results and discuss further enhancements to the program. |
| Download document: ps pdf |
| NMSU-CS-2003-002 |
| A note on factorization forests of finite height |
| J. Chalopin and H. Leung |
| Abstract: Simon~\cite{S90} has proved that every morphism from a free semigroup to a finite semigroup $S$ admits a Ramseyan factorization forest of height at most $9|S|$. In this paper, we prove the same result of Simon with an improved bound of $7|S| $. We provide a simple algorithm for constructing a factorization forest. In addition, we show that the algorithm cannot be improved significantly. We give examples of semigroup morphism such that any Ramseyan factorization forest for the morphism would require a height not less than $|S|$. |
| Download document: ps |
| NMSU-CS-2003-003 |
| Fast Inversion of Orthogonal Transformation Matrices |
| Joshua Shagam |
| Abstract: Many tasks in 3D rendering require taking the inverse of a matrix, which is a relatively slow process in the general case. This paper shows the derivation of a quick and easy way to take the inverse of an orthonormal homogenous transform matrix, which is the most commonly-used matrix in realtime 3D computations. |
| Download document: ps pdf |
| NMSU-CS-2003-004 |
| Dynamic Irregular Octrees |
| Joshua Shagam, Joseph J. Pfeiffer Jr. |
| Abstract: As consumer graphics hardware becomes faster and more capable, it is becoming desirable for realtime interactive content to become more dynamic. However, the static spatial partitioning mechanisms used in current interactive systems, such as games and other virtual reality environments, are not suitable for a fully-dynamic interactive environment. In this paper, we take a new look at octrees, and create a dynamic octree-like data structure which allows for realtime modification of a scene while retaining many of the benefits of a static spatial partitioning. Additionally, we explore a mechanism for providing fully-dynamic occlusion culling using this dynamic spatial partitioning. |
| Download document: pdf |
| NMSU-CS-2003-005 |
| Spatial Query By Sketch Using Hue and Saturation for Result Visualization |
| Joseph J. Pfeiffer, Jr. and Rick L. Vinyard. Jr. |
| Abstract: Geographic Information Systems (GIS) are notoriously difficult for users unfamiliar with the field, both for query formulation and for interpretation of display and results. Gaia is a GIS query system which reduces this difficulty by using a sketch-like query-by-example input interface, a fuzzy match of the query against the GIS database, and the use of hue and saturation overlays to present results. This paper presents Gaia's interface and match mechanism. Techniques for combining query results to retain the strengths of structured text-based queries are also considered. |
| Download document: pdf |
| NMSU-CS-2003-006 |
| Dynamic Spatial Partitioning for Real-Time Visibility Determination |
| Joshua Shagam Joseph J. Pfeiffer, Jr. |
| Abstract: The static spatial partitioning mechanisms used in current interactive systems, such as games and other virtual reality environments, are not suitable for a fully-dynamic interactive visualization. In this paper, we optimize a simple spatial partitioning algorithm for dynamic updates and compare its performance using a number of partitioning strategies, most notably the "icoseptree," a 27-ary tree which adaptively blends various tree behaviors. Additionally, we explore a simple mechanism for providing fully-dynamic occlusion culling using this dynamic spatial partitioning. |
| Download document: pdf |
| NMSU-CS-2003-007 |
| Planning with Preferences using Logic Programming |
| Tran Cao Son and Enrico Pontelli |
| Abstract: We present a declarative language, ${\cal PP}$, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over them. The semantics of ${\cal PP}$ allows the identification of \emph{most preferred trajectories} of a given goal. We provide a transformation to logic programming with negation as failure, that allows the use of existing logic programming systems to solve planning problems with ${\cal PP}$ preferences. |
| Download document: ps pdf |
| NMSU-CS-2003-008 |
| Smodels with CLP---A Treatment of Aggregates in ASP |
| Enrico Pontelli and Tran Cao Son |
| Abstract: We investigate the introduction of different types of aggregates in ASP. We developed a system which interfaces SMODELS with an external constraint solver (ECLiPSe in this particular case). The power of SMODELS is preserved by treating aggregates as standard literals; on the other hand, each aggregate is concurrently manipulated as a constraint within the constraint solver. SMODELS and the constraint solver interact (in a bi-directional way) by exchanging information about truth values of program atoms and information about success and failure of the current computation. |
| Download document: ps pdf |
| NMSU-CS-2003-009 |
| A Prototype Inference Engine for Rule-Based Geometric Reasoning |
| Joseph J. Pfeiffer, Jr. |
| Abstract: Isaac is a rule-based visual language for mobile robots using evidential reasoning and a fuzzy inference engine. A prototype inference engine for Isaac has been implemented, permitting experiments with the Isaac language. This paper discusses this inference engine, describes some preliminary experiences with programming Isaac rulesets, and proposes future optimizations and enhancements to the inference engine. |
| Download document: pdf |