Data Set Used
 Delayed from May due to concerns about SARS epidemic
This paper describes a new algorithm for estimating the position and orientation of objects. The problem is formulated as an optimization problem using dual number quaternious. The advantage of using this representation is that the method solves for the location estimate by minimizing a single cost function associated with the sum of the orientation and… (More)
Psychological studies on teamwork have shown that an effective team often can anticipate information needs of teammates based on a shared mental model. Existing multi-agent models for teamwork are limited in their ability to support proactive information exchange among teammates. To address this issue, we have developed and implemented a multi-agent… (More)
Benchmarks are developed to measure the Ada notion of time, the Ada features believed important to real-time performance, and other time-related features that are not part of the language, but are part of the run-time system; these benchmarks are then applied to the language and run-time system, and the results evaluated.
This paper presents a pattern recognition approach to identifying contact formations from force sensor signals. The approach is sensor-based and does not use geometric models of the workpieces. The design of a fuzzy classiier is described, where membership functions are generated automatically from training data. The technique is demonstrated using… (More)
MALLET, a multi-agent logic language for encoding teamwork, is intended to enable expression of teamwork emulating human teamwork, allowing experimentation with different levels and forms of inferred team intelligence. A consequence of this goal is that the actual teamwork behavior is determined by the level of intelligence built into the underlying system… (More)
Exact algorithms for detecting all ro-tational and involutional symmetries in point sets, polygons and polyhedra are described. The time complexities of the algorithms are shown to be O(n) for polygons and O(nlogn) for two-and three-dimensional point sets. O(n logn) time is also required for general polyhe-dra, but for polyhedra with connected, planar… (More)