F
Frank Noble Permenter
Researcher at Massachusetts Institute of Technology
Publications - 39
Citations - 1593
Frank Noble Permenter is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Control theory & Computer science. The author has an hindex of 13, co-authored 32 publications receiving 1343 citations. Previous affiliations of Frank Noble Permenter include Government of the United States of America & Oceaneering International.
Papers
More filters
Patent
System and method for calibrating rotary absolute position sensor
TL;DR: In this article, a rotary absolute position (RAP) sensor is used to measure the sine and cosine of rotary angles of the rotary device, and an algorithm is proposed to calculate the calibration parameters.
Patent
Integriertes Hochgeschwindigkeitsdrehmomentregelsystem für ein Robotergelenk
TL;DR: In this article, a Steuerungssystem zum Erreichen eines Hochgeschwindigkeitsdrehments fur ein Gelenk eines Roboters umfasst eine gedruckte Leiterplattenanordnung (PCBA) with einem gemeinsam angeordneten gelenkprozessor and einem Hoch-Gebruck-Kommunikationsbus.
Patent
Gerüst und Verfahren zum Steuern eines Robotersystems unter Verwendung eines verteilten Rechnernetzwerks
TL;DR: In this paper, a humanoid-robot-based Steuerungsgerust (DCF) is presented, in which eine Vielzahl von nachgiebigen Robotergelenken, Stellgliedern und and other integrierten systemkomponenten are eingebettet.
Journal ArticleDOI
Drag-guided diffusion models for vehicle image generation
TL;DR: In this paper , the authors propose physics-based guidance, which enables optimization of a performance metric (as predicted by a surrogate model) during the generation process, and add drag guidance to Stable Diffusion, which allows this tool to generate images of novel vehicles while simultaneously minimizing their predicted drag coefficients.
Journal ArticleDOI
Log-domain interior-point methods for convex quadratic programming
TL;DR: In this paper , interior-point methods for solving quadratic programs were studied in the log-domain and proved to be polynomial-time convergent in the sense that they are approximated by classical barrier methods.