Transportation system to optimize an operating parameter of a vehicle based on an emotional state of an occupant of the vehicle determined from a sensor to detect a physiological condition of the occupant
US-2024126256-A1 · Apr 18, 2024 · US
US2018058870A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018058870-A1 |
| Application number | US-201615251105-A |
| Country | US |
| Kind code | A1 |
| Filing date | Aug 30, 2016 |
| Priority date | Aug 30, 2016 |
| Publication date | Mar 1, 2018 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments described herein may provide a method for identifying geo-tagged objects or events and estimating the probability that a vehicle path will intersect with the geo-tagged object or event. Methods may include: determining a first map-matched location and a second map-matched location; determining a plurality of road segments emanating from or leading to the first map-matched location, a portion of which connect between the first map-matched location and the second map-matched location; calculating at least one of a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments; and determining, from the weight or the turn probability associated with each road segment of the portion of road segments that connect between the first map-matched location and the second map-matched location, a probability of a path taken between the first map-matched location and the second map-matched location.
Opening claim text (preview).
That which is claimed: 1 . An apparatus comprising at least one processor and at least one non-transitory memory including computer program code instructions, the computer program code instructions configured to, when executed, cause the apparatus to at least: determine a first map-matched location and a second map-matched location; determine a plurality of road segments emanating from or leading to the first map-matched location, a portion of which connect between the first map-matched location and the second map-matched location; calculate at least one of a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments; and determine, from the weight or the turn probability associated with each road segment of the portion of road segments that connect between the first map-matched location and the second map-matched location, a probability of a path taken between the first map-matched location and the second map-matched location, the path comprising a plurality of road segments. 2 . The apparatus of claim 1 , wherein the first map-matched location corresponds to a current location of a vehicle, wherein causing the apparatus to determine the first map-matched location comprises causing the apparatus to determine the first map-matched location and a direction of travel of the vehicle. 3 . The apparatus of claim 2 , wherein causing the apparatus to calculate a weight or a turn probability for turning onto a road segment for each road segment comprises causing the apparatus to calculate a weight or a turn probability for each road segment based, at least in part, on the direction of travel. 4 . The apparatus of claim 3 , wherein the apparatus is further caused to: determine a third map-matched location; determine a plurality of road segments between the first map-matched location and the second map-matched location; and calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments between the first map-matched location and the third map-matched location, wherein the weight or turn probability corresponds to an estimated likelihood that the corresponding road segment will be traversed between the first map-matched location and the third map-matched location. 5 . The apparatus of claim 4 , wherein the second map-matched location is associated with a first event, and the third map-matched location is associated with a second event, the apparatus is further caused to: determine a probability that the vehicle will traverse a road segment associated with the second map-matched location; determine a probability that the vehicle will traverse a road segment associated with the third map-matched location; rank the first event and the second event according to the probabilities associated with their respective locations; and provide for presentation of the first event and the second event according to their rank. 6 . The apparatus of claim 1 , wherein causing the apparatus to calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments between the first map-matched location and the second map-matched location comprises causing the apparatus to: determine one or more turn probabilities between the first map-matched location and a respective road segment; and calculate a weight for each respective road segment based, at least in part, on the turn probabilities between the first map-matched location and the respective road segment. 7 . The apparatus of claim 6 , wherein causing the apparatus to calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments between the first map-matched location and the second map-matched location further comprises causing the apparatus to: determine one or more recorded trajectories, wherein the one or more recorded trajectories comprises at least one of the plurality of road segments; and calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments between the first map-matched location and the second map-matched location based at least in part on the one or more recorded trajectories. 8 . A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein, the computer-executable program code instructions comprising program code instructions to: determine a first map-matched location and a second map-matched location; determine a plurality of road segments emanating from or leading to the first map-matched location, a portion of which connect between the first map-matched location and the second map-matched location; calculate at least one of a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments; and determine, from the weight or the turn probability associated with each road segment of the portion of road segments that connect between the first map-matched location and the second map-matched location, a probability of a path taken between the first map-matched location and the second map-matched location, the path comprising a plurality of road segments. 9 . The computer program product of claim 8 , wherein the first map-matched location corresponds to a current location of a vehicle, wherein the program code instructions to determine the first map-matched location comprise program code instructions to determine the first map-matched location and a direction of travel of the vehicle. 10 . The computer program product of claim 9 , wherein the program code instructions to calculate a weight or a turn probability for turning onto a road segment for each road segment comprises causing the apparatus to calculate a weight or a turn probability for turning onto a road segment for each road segment based, at least in part, on the direction of travel. 11 . The computer program product of claim 10 , further comprising program code instructions to: determine a third map-matched location; determine a plurality of road segments between the first map-matched location and the second map-matched location; and calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of road segments between the first map-matched location and the third map-matched location, wherein the weight or the turn probability corresponds to an estimated likelihood that the corresponding road segment will be traversed between the first map-matched location and the third map-matched location. 12 . The computer program product of claim 11 , wherein the second map-matched location is associated with a first event, and the third map-matched location is associated with a second event, the computer program product further comprising program code instructions to: determine a probability that the vehicle will traverse a road segment associated with the second map-matched location; determine a probability that the vehicle will traverse a road segment associated with the third map-matched location; rank the first event and the second event according to the probabilities associated with their respective locations; and provide for presentation of the first event and the second event according to their rank. 13 . The computer program product of claim 8 , wherein the program code instructions to calculate a weight or a turn probability for turning onto a road segment for each road segment of the plurality of r
Personalized, e.g. from learned user behaviour or user-defined profiles · CPC title
Retrieval, searching and output of information related to real-time traffic, weather, or environmental conditions (arrangements for giving variable traffic instructions G08G1/09) · CPC title
using user history, behaviour, conditions or preferences, e.g. predicted or inferred from previous use or current movement · CPC title
Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types or segments such as motorways, toll roads or ferries · CPC title
Data selection, e.g. prioritizing information, managing message queues, selecting the information to be output · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.