Unique localization of multiple sources by antenna arrays requires that the number of sensors be greater than the number of sources. When additional information is given this is no longer true. In this correspondence ...
详细信息
Unique localization of multiple sources by antenna arrays requires that the number of sensors be greater than the number of sources. When additional information is given this is no longer true. In this correspondence we assume that the signals' structure is of autoregressive (AR) type. We present a localization procedure which consists of two stages;in the first one the coefficients of the AR signals are estimated, and in the second the directions of arrival are estimated. Simulation results demonstrate the performance of the algorithm under different scenarios.
Methodologies for determining extrapolated life expectancy values for optical disk media were investigated at the National Institute of Standards and technology (NIST). These investigations showed that the life expect...
详细信息
Faat procedures for computing fuzzy prozimity meaaurea between a multifingered robot hand and an object to be grasped are presented in this paper. The computation useful in graap planning and in analyzing the local be...
详细信息
A system for exhaustively inspecting a workpiece, not merely certain features, is presented. The system is based on comparing a volumetric representation of a reference object to a volumetric representation of an actu...
详细信息
In this paper, we focus on the role and importance of experiments in the development of teleoperation systems. Experiments conducted in the JPL advanced Teleoperation Laboratory and lessons we have learned from them a...
详细信息
In this paper, we present a complete and exact algorithm for planning a geometrically feasible path for a polyhedral subassembly (robot) translating amongst polyhedral obstacles. Our algorithm can be used to determine...
详细信息
A novel approach to inspection is presented based on comparing a volumetric representation of a reference object to a volumetric representation of an actual object iteratively created from sensor data. The use of volu...
详细信息
In traditional geometric modeling, it is common to assume that models of objects created are complete and correct. Unfortunately in real life robots and other autonomous machines may have only uncertain knowledge of o...
详细信息
In this paper we present a corporate information system for untrained users to search gigabytes of unformatted data using quasi-natural language and relevance feedback queries. The data can reside on distributed serve...
作者：
S.S. KrishnanA.C. SandersonElectrical
Computer and Systems Engineering Department Center for Advanced Technology in Automation and Robotics Rensselaer Polytechnic Institute Troy NY USA
The feasible path problem is solved for planning a collision-free path to translate an arbitrary polyhedral robot from an initial position to some goal position in a polyhedral environment. The shortest path problem e...
详细信息
The feasible path problem is solved for planning a collision-free path to translate an arbitrary polyhedral robot from an initial position to some goal position in a polyhedral environment. The shortest path problem entails finding the shortest feasible path. The authors present two versions of the window corner (WC) algorithm, which is a novel solution to the problems for the case of single and multistep translational paths for two dimensions, and then summarize the extension to the three-dimensional WC algorithm, for feasible paths. The concept of window corners in the polyhedral cone representation (PCR) is introduced, which reduces the search space. The PCR cones store constraints between boundary elements. The PCO representation has O(m) vertices compared to O(m/sup 2/) in a C-space representation. The WC algorithm was tested and an example from assembly path planning is presented.< >
暂无评论