Patent application number | Description | Published |
20100191153 | PROSTHETIC LIMB MONITORING SYSTEM - Parameters related to use of a prosthesis by a patient with a limb amputation are monitored using a tool that includes one or more piezoelectric force sensors. The resulting data are processed for use both in short and long term management of amputee patients. The sensor is a small modular unit that fits within or between traditional prosthetic components, e.g., below a prosthesis socket. The data produced by the tool are collected, processed, and stored. Optionally, the data are periodically communicated to a remote site via a network, e.g., over the Internet. The device and associated software used to process the data can be used to characterize activities conducted by a prosthesis user, to determine pistoning or threatening interface stress distributions between the limb and socket, mal-alignment of the socket, use of improper components, and other possibly undesired conditions that the amputee patient using the prosthesis may be experiencing. | 07-29-2010 |
20110288448 | PROSTHETIC LIMB MONITORING SYSTEM - Parameters related to use of a prosthesis by a patient with a limb amputation are monitored using a tool that includes one or more piezoelectric force sensors. The resulting data are processed for use both in short and long term management of amputee patients. The sensor is a small modular unit that fits within or between traditional prosthetic components, e.g., below a prosthesis socket. The data produced by the tool are collected, processed, and stored. Optionally, the data are periodically communicated to a remote site via a network, e.g., over the Internet. The device and associated software used to process the data can be used to characterize activities conducted by a prosthesis user, to determine pistoning or threatening interface stress distributions between the limb and socket, mal-alignment of the socket, use of improper components, and other possibly undesired conditions that the amputee patient using the prosthesis may be experiencing. | 11-24-2011 |
20120226197 | LIMB VOLUME ACCOMMODATION IN PEOPLE WITH LIMB AMPUTATION - A prosthetic sock monitoring system is disclosed. The sock monitoring system includes a storage device and a data collection unit. The data collection unit is operable to receive data from at least one sensor coupled to a prosthetic sock that is wearable by a patient, and store the received data in the storage device. A prosthetic sock is also disclosed. The sock comprises material shaped to fit over at least a portion of the residual limb of the patient and a thickness adapted for inserting the residual limb into the socket of the prosthesis while the sock is fitted over the residual limb. The sock also comprises one or more of a sock identification unit and a force sensing device. | 09-06-2012 |
20140288669 | Limb Volume Accommodation in People With Limb Amputation - A prosthetic sock monitoring system is disclosed. The sock monitoring system includes a storage device and a data collection unit. The data collection unit is operable to receive data from at least one sensor coupled to a prosthetic sock that is wearable by a patient, and store the received data in the storage device. A prosthetic sock is also disclosed. The sock comprises material shaped to fit over at least a portion of the residual limb of the patient and a thickness adapted for inserting the residual limb into the socket of the prosthesis while the sock is fitted over the residual limb. The sock also comprises one or more of a sock identification unit and a force sensing device. | 09-25-2014 |
Patent application number | Description | Published |
20080282105 | DATA INTEGRITY VALIDATION IN STORAGE SYSTEMS - Data validation systems and methods are provided. Data is recorded in N data chunks on one or more storage mediums. A first validation chunk independently associated with said N data chunks comprises first validation information for verifying accuracy of data recorded in said N data chunks. The first validation chunk is associated with a first validation appendix comprising second validation information, wherein the first validation appendix is stored on a first storage medium independent of said one or more storage mediums. | 11-13-2008 |
20090055584 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - Method, system and computer program product are provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 02-26-2009 |
20090055688 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - Methods are provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is, changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 02-26-2009 |
20090177918 | STORAGE REDUNDANT ARRAY OF INDEPENDENT DRIVES - A computer implemented method, apparatus, and computer usable program product for managing redundant array of independent drives. In response to a failure of a hard disk in a first RAID array, the process calculates an amount of free capacity available across a set of remaining hard disks in the first RAID array. The set of remaining hard disks comprises every hard disk associated with the first RAID array except the failed disk. In response to a determination that the amount of free capacity is sufficient to re-create the first RAID array at a same RAID level, the process reconstructs the first RAID array using an amount of space in the set of remaining drives utilized by the first RAID array and the free capacity to form a new RAID array without utilizing a spare hard disk. | 07-09-2009 |
20100217752 | DATA INTEGRITY VALIDATION IN STORAGE SYSTEMS - Data validation systems and methods are provided. Data is recorded in N data chunks on one or more storage mediums. A first validation chunk independently associated with said N data chunks comprises first validation information for verifying accuracy of data recorded in said N data chunks. The first validation chunk is associated with a first validation appendix comprising second validation information, wherein the first validation appendix is stored on a first storage medium independent of said one or more storage mediums. | 08-26-2010 |
20100251072 | DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM - A RAID system is provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state. | 09-30-2010 |
20110208912 | FULL-STRIPE-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Information is stored as a stripe including a collection of a data strips and associated parity strips, the stripe distributed across data and parity nodes. Each data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the collection of data strips. A driver node initiates a full-stripe-write parity update protocol for maintaining parity coherency in conjunction with other nodes, to keep the relevant parity strips coherent. Parity is determined directly by computing parity strips for all data strips of a stripe. Any node may function as a driver node. | 08-25-2011 |
20110208994 | REBUILDING LOST DATA IN A DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Rebuilding lost data in a distributed redundancy data storage system including multiple nodes, is provided. User data is stored as a collection of stripes, each stripe comprising a collection of data strips and associated parity strips, the stripes distributed across multiple corresponding data owner nodes and multiple corresponding parity owner nodes. A data owner node maintains the associated data strip holding a first copy of data, and a parity owner node maintains a parity strip holding a parity for the collection of data strips. Upon detecting a failure condition, the owner node initiates a rebuilding protocol for recovery of lost data and/or parity it owns. The protocol includes reconstruction of lost data or parity by a computation involving data and/or parity from a recovery strip set in a stripe, wherein a recovery strip set contains at least one surviving data or parity strip. The recovery strip set for a lost data strip contains at least one surviving parity strip. | 08-25-2011 |
20110208995 | READ-MODIFY-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes, each node comprising a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of multiple data strips and associated parity strips, the stripes distributed across multiple corresponding primary data nodes and multiple corresponding parity nodes. A primary data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the multiple data strips. A read-modify-write parity update protocol is performed for maintaining parity coherency, the primary data node driving parity coherency with its corresponding parity nodes, independently of other data nodes, in order to keep its relevant parity strips coherent. | 08-25-2011 |
20110208996 | READ-OTHER PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Each node comprises a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of at least a data strip and associated parity strips, the stripes distributed across a primary data node and multiple corresponding parity nodes. A read-other parity update protocol maintains parity coherency. The primary data node for each data strip drives parity coherency with the corresponding parity nodes, independently of other data nodes, in keeping relevant parity strips for the primary data node coherent. A parity value is determined based on data other than a difference between new data and existing data. A new parity value is based on new data and dependent data, wherein with respect to one data value, dependent data comprises other data encoded in a corresponding parity value. | 08-25-2011 |
20120221920 | MULTIPLE ERASURE CORRECTING CODES FOR STORAGE ARRAYS - Embodiments of the invention relate to erasure correcting codes for storage arrays. An aspect of the invention includes receiving a read stripe from a plurality of storage devices. The read stripe includes a block of pages arranged in rows and columns, with each column corresponding to one of the storage devices. The pages include data pages and parity pages, with the number of parity pages at least one more than the number of rows and not a multiple of the number of rows. The method further includes reconstructing at least one erased page in response to determining that the read stripe includes the at least one erased page and that the number of erased pages is less than or equal to the number of parity pages. The reconstructing is responsive to a multiple erasure correcting code and to the block of pages. The reconstructing results in a recovered read stripe. | 08-30-2012 |
20120221926 | Nested Multiple Erasure Correcting Codes for Storage Arrays - Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving write data. The write data is arranged into “r” rows and “n” columns of pages, with each page including a plurality of sectors. The write data is encoded using a plurality of horizontal and vertical erasure correcting codes on the pages. The encoding allows recovery from up to t | 08-30-2012 |
20120297113 | OPTIMIZED FLASH BASED CACHE MEMORY - Embodiments of the invention relate to throttling accesses to a flash memory device. The flash memory device is part of a storage system that includes the flash memory device and a second memory device. The throttling is performed by logic that is external to the flash memory device and includes calculating a throttling factor responsive to an estimated remaining lifespan of the flash memory device. It is determined whether the throttling factor exceeds a threshold. Data is written to the flash memory device in response to determining that the throttling factor does not exceed the threshold. Data is written to the second memory device in response to determining that the throttling factor exceeds the threshold. | 11-22-2012 |
20120297127 | OPTIMIZED FLASH BASED CACHE MEMORY - Embodiments of the invention relate to throttling accesses to a flash memory device. The flash memory device is part of a storage system that includes the flash memory device and a second memory device. The throttling is performed by logic that is external to the flash memory device and includes calculating a throttling factor responsive to an estimated remaining lifespan of the flash memory device. It is determined whether the throttling factor exceeds a threshold. Data is written to the flash memory device in response to determining that the throttling factor does not exceed the threshold. Data is written to the second memory device in response to determining that the throttling factor exceeds the threshold. | 11-22-2012 |
20120311255 | FULL-STRIPE-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Information is stored as a stripe including a collection of a data strips and associated parity strips, the stripe distributed across data and parity nodes. Each data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the collection of data strips. A driver node initiates a full-stripe-write parity update protocol for maintaining parity coherency in conjunction with other nodes, to keep the relevant parity strips coherent. Parity is determined directly by computing parity strips for all data strips of a stripe. Any node may function as a driver node. | 12-06-2012 |
20120331367 | Nested Multiple Erasure Correcting Codes for Storage Arrays - Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving write data. The write data is arranged into “r” rows and “n” columns of pages, with each page including a plurality of sectors. The write data is encoded using a plurality of horizontal and vertical erasure correcting codes on the pages. The encoding allows recovery from up to t | 12-27-2012 |
20130024613 | PREFETCHING DATA TRACKS AND PARITY DATA TO USE FOR DESTAGING UPDATED TRACKS - Provided are a computer program product, system, and method for prefetching data tracks and parity data to use for destaging updated tracks. A write request is received including at least one updated track to the group of tracks. The at least one updated track is stored in a first cache device. A prefetch request is sent to the at least one sequential access storage device to prefetch tracks in the group of tracks to a second cache device. A read request is generated to read the prefetch tracks following the sending of the prefetch request. The read prefetch tracks returned to the read request from the second cache device are stored in the first cache device. New parity data is calculated from the at least one updated track and the read prefetch tracks. | 01-24-2013 |
20130024624 | PREFETCHING TRACKS USING MULTIPLE CACHES - Provided are a computer program product, sequential access storage device, and method for managing data in a sequential access storage device receiving read requests and write requests from a system with respect to tracks stored in a sequential access storage medium. A prefetch request indicates prefetch tracks in the sequential access storage medium to read from the sequential access storage medium. The accessed prefetch tracks are cached in a non-volatile storage device integrated with the sequential access storage device, wherein the non-volatile storage device is a faster access device than the sequential access storage medium. A read request is received for the prefetch tracks following the caching of the prefetch tracks, wherein the prefetch request is designated to be processed at a lower priority than the read request with respect to the sequential access storage medium. The prefetch tracks are returned from the non-volatile storage device to the read request. | 01-24-2013 |
20130024625 | PREFETCHING TRACKS USING MULTIPLE CACHES - Provided are a computer program product, sequential access storage device, and method for managing data in a sequential access storage device receiving read requests and write requests from a system with respect to tracks stored in a sequential access storage medium. A prefetch request indicates prefetch tracks in the sequential access storage medium to read from the sequential access storage medium. The accessed prefetch tracks are cached in a non-volatile storage device integrated with the sequential access storage device, wherein the non-volatile storage device is a faster access device than the sequential access storage medium. A read request is received for the prefetch tracks following the caching of the prefetch tracks, wherein the prefetch request is designated to be processed at a lower priority than the read request with respect to the sequential access storage medium. The prefetch tracks are returned from the non-volatile storage device to the read request. | 01-24-2013 |
20130024627 | PREFETCHING DATA TRACKS AND PARITY DATA TO USE FOR DESTAGING UPDATED TRACKS - Provided are a computer program product, system, and method for prefetching data tracks and parity data to use for destaging updated tracks. A write request is received including at least one updated track to the group of tracks. The at least one updated track is stored in a first cache device. A prefetch request is sent to the at least one sequential access storage device to prefetch tracks in the group of tracks to a second cache device. A read request is generated to read the prefetch tracks following the sending of the prefetch request. The read prefetch tracks returned to the read request from the second cache device are stored in the first cache device. New parity data is calculated from the at least one updated track and the read prefetch tracks. | 01-24-2013 |
20130054873 | STORAGE SYSTEM CACHE USING FLASH MEMORY WITH DIRECT BLOCK ACCESS - Embodiments of the invention enable a storage cache, comprising flash memory devices, to have direct block access to the flash such that the physical block addresses are presented to the storage system's cache layer, which thereby controls the storage cache data stream. An aspect of the invention includes a caching storage system. The caching storage system comprises a plurality of flash memory units organized in an array configuration. Each of the plurality of flash memory units includes at least one flash memory device and a flash unit controller. Each flash unit controller provides the caching storage system with direct physical block access to its corresponding at least one flash memory device. The caching storage system further comprises a storage cache controller. The storage cache controller selects physical block address locations (within a flash memory device) to be erased where data are to be written, issues erase commands to a flash unit controller corresponding to the selected physical block address locations, and issues page write operations to a set of erase blocks. | 02-28-2013 |
20130132801 | ERROR CHECKING ADDRESSABLE BLOCKS IN STORAGE - Provided are a method, system, and article of manufacture for error checking addressable blocks in storage. Addressable blocks of data are stored in a storage in stripes, wherein each stripe includes a plurality of data blocks for one of the addressable blocks and at least one checksum block including checksum data for the addressable block. A write request is received to modify data in one of the addressable blocks. The write and updating the checksum are performed in the stripe having the modified addressable block. An indication is made to perform an error checking operation on the stripe for the modified addressable block in response to the write request, wherein the error checking operation reads the data blocks and the checksum in the stripe to determine if the checksum data is accurate. An error handling operation is initiated in response to determining that the checksum data is not accurate. | 05-23-2013 |
20130205168 | PARTIAL-MAXIMUM DISTANCE SEPARABLE (PMDS) ERASURE CORRECTING CODES FOR STORAGE ARRAYS - Embodiments of the invention relate to correcting erasures in a storage array. A read stripe is received from a plurality of n storage devices. The read stripe includes an array of entries arranged in m rows and n columns with each column corresponding to one of the storage devices. The entries include data entries and mr+s parity entries. Each row contains at least r parity entries generated from the data entries according to a partial maximum distance separable (PMDS) code. It is determined that the read stripe includes at least one erased entry, at most mr+s erased entries and that no row has more than r+s erased entries. The erased entries are reconstructed from the non-erased entries, resulting in a recovered read stripe. | 08-08-2013 |
20130205181 | PARTIAL-MAXIMUM DISTANCE SEPARABLE (PMDS) ERASURE CORRECTING CODES FOR STORAGE ARRAYS - Embodiments of the invention relate to storing data in a storage array. An aspect of the invention includes receiving and arranging read data in array that includes m rows and n columns of entries, with each entry including at least one sector. In the array, mr+s locations are assigned to parity entries, such that each row has at least r parity entries. The parity entries correspond to a partial-maximum distance separable (PMDS) code that allows recovery from up to r erasures in each of the m rows as well as s additional erasures in any locations in the data array, where s is an integer greater than zero. The write data and the associated parity entries are written to the set of storage devices. | 08-08-2013 |
Patent application number | Description | Published |
20110243708 | METHODS, SYSTEMS AND APPARATUS RELATING TO TIP CLEARANCE CALCULATIONS IN TURBINE ENGINES - A method of calculating the tip clearance during operation of a combustion turbine engine that includes the steps of: measuring a cold tip clearance and a cold shell-to-shell distance; while the combustion turbine engine is operating, measuring an operating parameter and measuring a shell-to-shell distance with a proximity sensor; calculating the tip clearance based on the cold tip clearance measurement and the operating parameter measurement; calculating the shell-to-shell distance based on the cold shell-to-shell distance measurement and the operating parameter measurement; comparing the shell-to-shell distance measurement of the proximity sensor with the shell-to-shell distance calculation; and calibrating the calculated tip clearance calculation based on the comparison. | 10-06-2011 |
20120321437 | TURBINE SEAL SYSTEM - A system includes a multi-stage turbine. The multi-stage turbine includes a first turbine stage including a first wheel having a plurality of first blade segments spaced circumferentially about the first wheel, a second turbine stage including a second wheel having a plurality of second blade segments spaced circumferentially about the second wheel, and an interstage seal extending axially between the first and second turbine stages. The interstage seal is configured to be installed or removed while the first and second wheels remain in place in the respective first and second turbine stages. | 12-20-2012 |
20130202433 | SEAL ASSEMBLY FOR TURBINE COOLANT PASSAGEWAYS - A seal assembly for use with a turbine having a rotor and at least one turbine blade facilitates the use of a wire seal with seal plate segments. The seal assembly includes a plurality of seal plate segments and a plurality of retainers disposed on a rotor flange on the rotor. A seal member is disposed between the retainers and the seal plate segments. The seal assembly includes at least one attachment member disposed through the rotor flange that limits radial displacement of the seal plate segments. | 08-08-2013 |
20130256996 | SHIPLAP PLATE SEAL - A seal plate assembly for a turbine rotor includes at least one inner shiplap seal plate disposed on the rotor; and at least one outer seal plate adapted to engage the at least one inner shiplap plate. The thickness of the at least one outer seal plate is different than the thickness of the at least one inner shiplap plate causing either the at least one inner shiplap plate or the at least one outer seal plate to come into contact first under centrifugal load. | 10-03-2013 |
20130264779 | SEGMENTED INTERSTAGE SEAL SYSTEM - A system includes an interstage seal system. The interstage seal system extends axially between a first rotor wheel of a first turbine stage of a multi-stage turbine and a second rotor wheel of a second turbine stage of the multi-stage turbine. The interstage seal system has an interstage seal and at least one coverplate. The interstage seal is configured to wedge axially between the at least one coverplate and the first or second rotor wheel. | 10-10-2013 |
20140321982 | TURBINE BLADE MONITORING ARRANGEMENT AND METHOD OF MANUFACTURING - A turbine blade monitoring arrangement includes a bucket tip located at a radial outer location of a bucket. Also included is at least one component disposed radially outwardly of the bucket tip. Further included is a hollow portion of the at least one component, wherein the hollow portion extends radially from a first end to a second end through the at least one component. Yet further included is a first sealing component operatively coupled to the at least one component proximate the first end of the hollow portion, wherein the first sealing component comprises a translucent material. Also included is a proximity sensor disposed radially outwardly of the at least one component and aligned with the hollow portion, the proximity sensor configured to generate a first signal through the hollow portion to the bucket tip. | 10-30-2014 |
20140334929 | COMPRESSOR ROTOR HEAT SHIELD - A heat shield for a rotor in a turbine engine is provided. The heat shield includes a main body having a first pair of recesses. The first pair of recesses is adapted to fit around a portion of one or more rotor blades or between two axially adjacent rotor wheels. The first pair of recesses limits axial and radial movement of the heat shield by interaction with the rotor blades or by interaction with the two axially adjacent rotor wheels. The first pair of recesses engage axially adjacent rotor blades or the axially adjacent rotor wheels. The heat shield protects the rotor from hot gas. | 11-13-2014 |
Patent application number | Description | Published |
20140249691 | TRAJECTORY PLANNER FOR A TRAILER BACKUP ASSIST SYSTEM - In one embodiment of the disclosed subject matter, a trailer backup assist system includes a state estimator that determines a current position of a trailer relative to a waypoint position. In addition, the trailer backup assist system includes a trajectory planner that generates first and second circular trajectories tangent to one another spanning between the current and waypoint positions. The trailer backup assist system also includes a controller that reverses the trailer to the waypoint position along the first and second circular trajectories, which are dynamically regenerated as the trailer reverses along the first circular trajectory. | 09-04-2014 |
20140249723 | CONTROL FOR TRAILER BACKUP ASSIST SYSTEM - In one embodiment of the disclosed subject matter, a trailer backup assist system includes a sensor that senses a measured hitch angle between a vehicle and a trailer. The system also provides an input module that receives a desired curvature of the trailer. A controller of the system includes a curvature regulator determining a desired hitch angle based on the desired curvature and a steering angle of the vehicle. In addition, the controller of the system includes a hitch angle regulator generating a steering angle command based on the desired hitch angle and the measured hitch angle. In this embodiment, the controller is configured to operate the trailer backup assist system irrespective of the attached trailer having a conventional tongue or a gooseneck tongue. | 09-04-2014 |
20140303849 | TRAILER BACKUP ASSIST SYSTEM WITH TRAJECTORY PLANNER FOR MULTIPLE WAYPOINTS - A trailer backup assist system, according to one embodiment, includes a state estimator that determines a current position of a trailer relative to a plurality of waypoints. A trajectory planner may then incrementally generate a path from the current position to the plurality of waypoints. The trajectory planner has a first mode that generates first and second circular trajectories tangent to one another connecting between the current position and a waypoint of the plurality of waypoints. A second mode of the trajectory planner generates the second circular trajectory between the current position and the waypoint after the trailer traverses the first circular trajectory. Also, a third mode of the trajectory planner switches to the first operating mode when the trailer reaches the waypoint for guidance to a subsequent waypoint. A curvature controller guides the trailer based on a curvature of the respective first or second circular trajectories. | 10-09-2014 |
20140358429 | METHOD OF INPUTTING A PATH FOR A VEHICLE AND TRAILER - A method of inputting a path is provided. The method includes the steps of generating an aerial view of a vehicle and a trailer based on at least one of image data and satellite image data, displaying the aerial view on a display having a touch screen, and registering a touch event on the touch screen that inputs an intended path for the vehicle and the trailer. | 12-04-2014 |
20150158527 | TRAILER BACKUP ASSIST SYSTEM WITH WAYPOINT SELECTION - A method of backing a trailer attached to a vehicle is provided herein. The method includes the steps of generating a plurality of waypoints on a display of the vehicle and selecting one of the plurality waypoints. The method also includes setting a trailer orientation for the selected waypoint and determining a backing path based on the selected waypoint and the set trailer orientation. The method further includes backing the trailer along the backing path. | 06-11-2015 |
20150197281 | TRAILER BACKUP ASSIST SYSTEM WITH LANE MARKER DETECTION - A system for backing a vehicle and a trailer is provided herein. The system includes an imaging system configured to detect contiguous lane markers while imaging an operating environment of the vehicle and trailer. The system also includes a user interface configured to display the contiguous lane markers in relation to the vehicle and trailer wherein the user is enabled to select a target space bounded by the contiguous lane markers. A backup assist system is also provided to determine a steering trajectory into the target space. | 07-16-2015 |
20150203156 | TRAILER BACKUP ASSIST SYSTEM WITH WAYPOINT SELECTION - A display system for a vehicle attached to a trailer is provided herein. The system includes a display configured to show an aerial view of the vehicle and the trailer and a plurality of waypoints, each indicating a possible parking location for the trailer. The system also includes a device that interfaces with the display and is operable to select one of the plurality of waypoints and set a trailer orientation for the selected waypoint. | 07-23-2015 |
20150210317 | TRAILER BACKUP ASSIST SYSTEM WITH OFF-SHOOT CORRECTION - A trailer backup assist system for a vehicle reversing a trailer is provided herein. The system includes a steering input device for controlling a desired curvature. A controller is in communication with the steering input device and is configured to generate steering command for the vehicle to guide the vehicle and trailer onto a straight path when a straight backup request is initiated via the steering input device. | 07-30-2015 |