{
  "$type": "site.standard.document",
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreibcqml22bdi65u7szgn64mnghnwk3kvcflhzu3tl5blwtf6uhctlu"
    },
    "mimeType": "image/png",
    "size": 104620
  },
  "description": "A vehicle path routing method is disclosed for determining a lowest-cost path from a source to a destination. A graph representing a road network includes vertices and edges between vertices. Vertices in the graph represent locations and edges represent paths between locations. Edge weights…",
  "path": "/patents/1360025",
  "publishedAt": "2024-02-29T00:00:00.000Z",
  "site": "at://did:plc:oql6ds5vnff4ugar6rruliwd/site.standard.publication/3mn3ohu7oxx5w",
  "tags": [
    "G01C21/3446",
    "The Regents of the University of California"
  ],
  "textContent": "A vehicle path routing method is disclosed for determining a lowest-cost path from a source to a destination. A graph representing a road network includes vertices and edges between vertices. Vertices in the graph represent locations and edges represent paths between locations. Edge weights represent costs, such as travel times and energy consumptions for travel along edges of the graph. Significantly, edge weights are represented as probability distributions. The routing method partitions the edges into multiple tiers, for which convolutions of probability distributions can and cannot be feasibly replaced with functional approximations. A Dijkstra search of the graph from a vehicle origin to a vehicle destination computes, for vertices along a path, convolutions of distributions and sums of functional approximations.",
  "title": "Speeding up Stochastic Routing of Vehicles using Tiering"
}