scispace - formally typeset
Search or ask a question
Institution

General Motors

CompanyDetroit, Michigan, United States
About: General Motors is a company organization based out in Detroit, Michigan, United States. It is known for research contribution in the topics: Internal combustion engine & Clutch. The organization has 35560 authors who have published 63172 publications receiving 986015 citations. The organization is also known as: GM & General Motors Company, LLC.


Papers
More filters
Journal ArticleDOI
Paul J. Besl1, H.D. McKay1
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Abstract: The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces. >

17,598 citations

Journal ArticleDOI
TL;DR: This paper introduces the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering and shows how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule.
Abstract: In many engineering optimization problems, the number of function evaluations is severely limited by time or cost. These problems pose a special challenge to the field of global optimization, since existing methods often require more function evaluations than can be comfortably afforded. One way to address this challenge is to fit response surfaces to data collected by evaluating the objective and constraint functions at a few points. These surfaces can then be used for visualization, tradeoff analysis, and optimization. In this paper, we introduce the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering. We then show how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule. The key to using response surfaces for global optimization lies in balancing the need to exploit the approximating surface (by sampling where it is minimized) with the need to improve the approximation (by sampling where prediction error may be high). Striking this balance requires solving certain auxiliary problems which have previously been considered intractable, but we show how these computational obstacles can be overcome.

6,914 citations

Journal ArticleDOI
TL;DR: In this article, the authors quantified the activities and voltage loss modes for state-of-the-art MEAs (membrane electrode assemblies), specifies performance goals needed for automotive application, and provides benchmark oxygen reduction activities for state of the art platinum electrocatalysts.
Abstract: The mass production of proton exchange membrane (PEM) fuel-cell-powered light-duty vehicles requires a reduction in the amount of Pt presently used in fuel cells. This paper quantifies the activities and voltage loss modes for state-of-the-art MEAs (membrane electrode assemblies), specifies performance goals needed for automotive application, and provides benchmark oxygen reduction activities for state-of-the-art platinum electrocatalysts using two different testing procedures to clearly establish the relative merit of candidate catalysts. A pathway to meet the automotive goals is charted, involving the further development of durable, high-activity Pt-alloy catalysts. The history, status in recent experiments, and prospects for Pt-alloy cathode catalysts are reviewed. The performance that would be needed for a cost-free non-Pt catalyst is defined quantitatively, and the behaviors of several published non-Pt catalyst systems (and logical extensions thereof), are compared to these requirements. Critical research topics are listed for the Pt-alloy catalysts, which appear to represent the most likely route to automotive fuel cells.

4,298 citations

Journal ArticleDOI
01 Nov 2007
TL;DR: Comprehensive performance comparisons including accuracy, precision, complexity, scalability, robustness, and cost are presented.
Abstract: Wireless indoor positioning systems have become very popular in recent years. These systems have been successfully used in many applications such as asset tracking and inventory management. This paper provides an overview of the existing wireless indoor positioning solutions and attempts to classify different techniques and systems. Three typical location estimation schemes of triangulation, scene analysis, and proximity are analyzed. We also discuss location fingerprinting in detail since it is used in most current system or solutions. We then examine a set of properties by which location systems are evaluated, and apply this evaluation method to survey a number of existing systems. Comprehensive performance comparisons including accuracy, precision, complexity, scalability, robustness, and cost are presented.

4,123 citations

Proceedings ArticleDOI
30 Apr 1992
TL;DR: In this paper, the authors describe a general purpose representation independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Abstract: This paper describes a general purpose, representation independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six-degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and experience shows that the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. For examples, a given 'model' shape and a sensed 'data' shape that represents a major portion of the model shape can be registered in minutes by testing one initial translation and a relatively small set of rotations to allow for the given level of model complexity. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model prior to shape inspection. The described method is also useful for deciding fundamental issues such as the congruence (shape equivalence) of different geometric representations as well as for estimating the motion between point sets where the correspondences are not known. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.

2,377 citations


Authors

Showing all 35570 results

NameH-indexPapersCitations
Anthony H. Heap10825915155
Huajian Gao10566746748
Salvatore Torquato10455240208
Xueliang Sun10061336400
Chung K. Law9564032945
Hubert A. Gasteiger9538347842
Haibo Zeng9460439226
Ctirad Uher9459339899
Rolf D. Reitz9361136618
Robert W. Platt8863831918
David J. Srolovitz8754027162
Keith A. Nelson8572726755
John Newman8447933760
Lidong Chen8358629688
Yunfeng Lu7942527858
Network Information
Related Institutions (5)
Sandia National Laboratories
46.7K papers, 1.4M citations

89% related

Georgia Institute of Technology
119K papers, 4.6M citations

87% related

Royal Institute of Technology
68.4K papers, 1.9M citations

87% related

Rensselaer Polytechnic Institute
39.9K papers, 1.4M citations

86% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20233
202236
2021360
2020826
20191,417
20181,361