Optimum Lap Derivation Via Track Segmentation And Prior Racing Measurements
AssigneeOracle International Corporation
InventorsMatthew Charles Rowe, Sahil Malhotra, Sergio Aldea Lopez, Oleg Gennadievich Shevelev, Alberto Polleri
Life of this patent
Estimating the term…
Abstract
Techniques for deriving an optimal traversal path on a racetrack are disclosed. The system partitions a track into straight and curved segments. The system identifies optimal traversals through each segment from historical traversal data. The system stitches the optimal traversals together and smooths the optimal traversals at the transition points between track segments. The system verifies that the smoothed traversals meet one or more kinematic criteria before outputting the optimal traversal path.
Claims20
One or more non-transitory computer readable media comprising instructions which, when executed by one or more hardware processors, cause performance of operations comprising:
- obtaining a representation of a track, the representation comprising a plurality of positions along a reference line of the track represented by coordinates in a two-dimensional plane;
- determining a rate of change category associated with each particular consecutive pair of positions of a plurality of positions, the rate of change category being one of:
- a positive rate of change, a negative rate of change, or an approximately null rate of change;
- partitioning the plurality of positions into a plurality of track segments, wherein each track segment in the plurality of tack segments comprises consecutive positions that form pairs of positions having a same rate of change category;
- determining a plurality of target segment traversals for the plurality of track segments at least by:
- for a particular track segment of the plurality of track segments:
- identifying a set of historical segment traversals for the particular track segment, each particular historical segment traversal of the set of historical segment traversals defining a velocity and a lateral position along the track at each of a set of positions along the particular historical segment traversal;
- selecting a target segment traversal, from the set of historical segment traversals, for the particular track segment based at least on a traversal time corresponding to the target segment traversal;
- computing an optimized track traversal for the track based on the determined plurality of target segment traversals.
One or more non-transitory computer readable media comprising instructions which, when executed by one or more hardware processors, cause performance of operations comprising:
- obtaining traversal data for each of a plurality of track segments, the traversal data comprising at least one of a traversal time and a traversal position within a respective track segment;
- identifying a pair of segment traversals corresponding to adjoining track segments of the plurality of track segments, wherein a first value of a traversal characteristic at an end of a first segment traversal of the pair of adjoining segment traversals is different than a second value of the traversal characteristic at a start of a second segment traversal of the pair of adjoining segment traversals;
- applying a first candidate modification to a first portion of at least one of the first segment traversal and the second segment traversal to reduce a difference between the first value at the end of the first segment traversal and the second value at the start of the second segment traversal;
- determining that applying the first candidate modification results in a traversal through the pair of segments that does not meet one or more kinematic criteria;
- applying a second candidate modification to a second portion of at least one of the first segment traversal and the second segment traversal to reduce a difference between the first value at the end of the first segment traversal and the second value at the start of the second segment traversal;
- determining that applying the second candidate modification results in a traversal through the pair of segments that does meet the one or more kinematic criteria;
- and
- responsive to determining that the second candidate modification results in a traversal that meets the one or more kinematic criteria, generating an optimized track segment traversal that includes the modified second portion resulting from applying the second candidate modification to the second portion.
A system comprising:
- one or more processors;
- and
- memory storing instructions that, when executed by the one or more processors, cause the system to perform:
- obtaining a representation of a track, the representation comprising a plurality of positions along a reference line of the track represented by coordinates in a two-dimensional plane;
- determining a rate of change category associated with each particular consecutive pair of positions of a plurality of positions, the rate of change category being one of:
- a positive rate of change, a negative rate of change, or an approximately null rate of change;
- partitioning the plurality of positions into a plurality of track segments, wherein each track segment in the plurality of tack segments comprises consecutive positions that form pairs of positions having a same rate of change category;
- determining a plurality of target segment traversals for the plurality of track segments at least by:
- for a particular track segment of the plurality of track segments:
- identifying a set of historical segment traversals for the particular track segment, each particular historical segment traversal of the set of historical segment traversals defining a velocity and a lateral position along the track at each of a set of positions along the particular historical segment traversal;
- selecting a target segment traversal, from the set of historical segment traversals, for the particular track segment based at least on a traversal time corresponding to the target segment traversal;
- computing an optimized track traversal for the track based on the determined plurality of target segment traversals.
Dependencies are inferred from the claim text.