FPGA implementation of the interior-point algorithm with applications to collision detection

Chih Hung Wu*, Seda Ogrenci Memik, Sanjay Mehrotra

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

The interior-point algorithm is a powerful method for solving a Linear Program (LP). A variety of optimization problems can be formulated as LPs. Often times the limiting factor of deploying an algorithm to solve LPs in a high performance system is the run-time efficiency. In this paper, we present the FPGA implementation of an affine interior-point algorithm that is designed to solve LPs. Specifically, we present the application of this algorithm to solving the LP for the real-time collision detection. The most important feature that distinguishes this particular algorithm from other collision detection methods is its superior ability to perform detection between pairs of objects undergoing fast rotational and translational motions.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Symposium on Field Programmable Custom Computing Machines, FCCM 2009
Pages295-298
Number of pages4
DOIs
StatePublished - Dec 1 2009
EventIEEE Symposium on Field Programmable Custom Computing Machines, FCCM 2009 - Napa, CA, United States
Duration: Apr 5 2009Apr 7 2009

Other

OtherIEEE Symposium on Field Programmable Custom Computing Machines, FCCM 2009
CountryUnited States
CityNapa, CA
Period4/5/094/7/09

Keywords

  • Inter-frame collision
  • Interior point
  • Linear programming

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'FPGA implementation of the interior-point algorithm with applications to collision detection'. Together they form a unique fingerprint.

Cite this