Patents by Inventor David Rohr

David Rohr has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10365363
    Abstract: Mobile localization of an object having an object positional frame of reference using sparse time-of-flight data and dead reckoning can be accomplished by creating a dead reckoning local frame of reference, including an estimation of object position with respect to known locations from one or more Ultra Wide Band transceivers. As the object moves along its path, a determination is made using the dead-reckoning local frame of reference. When the object is within a predetermine range of one or more of the Ultra Wide Band transceivers, a “conversation” is initiated, and range data between the object and the UWB transceiver(s) is collected. Using multiple conversations to establish accurate range and bearing information, the system updates the object's position based on the collected data.
    Type: Grant
    Filed: June 1, 2016
    Date of Patent: July 30, 2019
    Assignee: Humatics Corporation
    Inventors: David Rohr, Josh Senna, Akshay Kumar Jain, J. Alan Atherton, David J. Bruemmer
  • Publication number: 20170023659
    Abstract: An Adaptive Positioning System provides a method for directing and tracking position, motion and orientation of mobile vehicles, people and other entities using multiple complementary positioning components to provide seamless positioning and behavior across a spectrum of indoor and outdoor environments. The Adaptive Positioning System (APS) provides for complementary use of peer to peer ranging together with map matching to alleviate the need for active tags throughout an environment. Moreover, the APS evaluates the validity and improves the effective accuracy of each sensor by comparing each sensor to a collaborative model of the positional environment. The APS is applicable for use with multiple sensors on a single entity (i.e. a single robot) or across multiple entities (i.e. multiple robots) and even types of entities (i.e. robots, humans, cell phones, cars, trucks, drones, etc.).
    Type: Application
    Filed: May 6, 2016
    Publication date: January 26, 2017
    Applicant: 5D Robotics, Inc.
    Inventors: David J. Bruemmer, Josh Senna, Akshay Kumar Jain, J Alan Atherton, David Rohr
  • Publication number: 20160349362
    Abstract: Mobile localization of an object having an object positional frame of reference using sparse time-of-flight data and dead reckoning can be accomplished by creating a dead reckoning local frame of reference, including an estimation of object position with respect to known locations from one or more Ultra Wide Band transceivers. As the object moves along its path, a determination is made using the dead-reckoning local frame of reference. When the object is within a predetermine range of one or more of the Ultra Wide Band transceivers, a “conversation” is initiated, and range data between the object and the UWB transceiver(s) is collected. Using multiple conversations to establish accurate range and bearing information, the system updates the object's position based on the collected data.
    Type: Application
    Filed: June 1, 2016
    Publication date: December 1, 2016
    Applicant: 5D Robotics, Inc.
    Inventors: David Rohr, Josh Senna, Akshay Kumar Jain, J Alan Atherton, David J. Bruemmer
  • Patent number: 8495286
    Abstract: The present invention relates to a method and respective system for operating a DRAM main memory. One buffer line is provided for multiple pages. When writing data to the buffer it is decided which to which buffer-line the data is written to based on its destination main memory address. A tuple consisting of lower memory address and data is stored. Data entered into the buffer-line will be sorted by page in case the line is flushed to the main memory. Sorting the buffer entries results in less page openings and closings, since the data is re-arranged by memory address and therefore in logical order. By using one line for multiple pages only a fraction of memory of a common set-associative cache is needed, thus decreasing the amount of overhead significantly.
    Type: Grant
    Filed: December 8, 2010
    Date of Patent: July 23, 2013
    Assignee: International Business Machines Corporation
    Inventors: Cagri Balkesen, Markus Buehler, Rainer Dorsch, Guenther Hutzl, Michael W. Kaufmann, Daniel Pfefferkorn, David Rohr, Stefanie Scherzinger, Thomas Schwarz
  • Patent number: 8380737
    Abstract: First and second sets of numbers are received in an input range, which is separated into sub ranges. A first sub range is processed by initializing bits of a memory to a first logical state and by changing the initial state of each of the bits corresponding to a received number of the first set that is within the first sub range. Each number received in the second set is compared to a bit in the memory to identify a set of received numbers that are in the first sub range and that are in both the first set and the second set. The comparing is responsive to detecting a change of initial state of any bit in the memory during the processing of the first sub range. The processing and comparing is repeated for remaining sub ranges to identify received numbers that are in both the sets.
    Type: Grant
    Filed: September 15, 2011
    Date of Patent: February 19, 2013
    Assignee: International Business Machines Corporation
    Inventors: Cagri Balkesen, Markus T. Buehler, Rainer Dorsch, Guenther Hutzl, Michael W. Kaufmann, Daniel Pfefferkorn, David Rohr, Stefanie C. Scherzinger, Thomas Schwarz
  • Publication number: 20120158774
    Abstract: The present invention relates to a computer program product, method and system for computing set intersection of a first and a second unordered set of discrete members that stem from a known input range of consecutive discrete numbers. The method breaks the numbers into subranges and for each subrange, utilizes a bit vector in a first random access memory, directly addressing bits representing values in a subrange in the first set to values in the second set in the subrange and writing each number of the second set that is also set member of the first set in the sub range directly to an output. This may be utilized by various applications including database applications. The algorithm may be offloaded to one or more processing subsystems.
    Type: Application
    Filed: September 15, 2011
    Publication date: June 21, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: CAGRI BALKESEN, MARKUS T. BUEHLER, RAINER DORSCH, GUENTHER HUTZL, MICHAEL W. KAUFMANN, DANIEL PFEFFERKORN, DAVID ROHR, STEFANIE C. SCHERZINGER, THOMAS SCHWARZ
  • Publication number: 20110302367
    Abstract: The present invention relates to a method and respective system for operating a DRAM main memory. One buffer line is provided for multiple pages. When writing data to the buffer it is decided which to which buffer-line the data is written to based on its destination main memory address. A tuple consisting of lower memory address and data is stored. Data entered into the buffer-line will be sorted by page in case the line is flushed to the main memory. Sorting the buffer entries results in less page openings and closings, since the data is re-arranged by memory address and therefore in logical order. By using one line for multiple pages only a fraction of memory of a common set-associative cache is needed, thus decreasing the amount of overhead significantly.
    Type: Application
    Filed: December 8, 2010
    Publication date: December 8, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Cagri Balkesen, Markus Buehler, Rainer Dorsch, Guenther Hutzl, Michael W. Kaufmann, Daniel Pfefferkorn, David Rohr, Stefanie Scherzinger, Thomas Schwarz