Abstract: Methods and systems for obtaining serviceable areas for a robotic system in a metropolitan area are described. A computing device obtains information about places where (i) the system can route to and from in the area and/or (ii) the system can stop in the area. The computing device uses the information to generate clusters of places where the robotic system can route or stop in the metropolitan area. The computing device creates a geometric shape for each cluster, wherein each shape which has a boundary defined by outermost places contained in the cluster. The computing device uses the geometric shapes to define the serviceable areas for the robotic system within the metropolitan area. The computing device uses the serviceable areas to generate a map displaying at least one geographic area representing a portion of the metropolitan area where a concentrated number of the places exist.

Abstract: Disclosed herein are systems, methods, and computer program products for generating and using map information. For example, the method includes: identifying data collection mission area(s) (DCMAs) within a geographic location that is to be covered by robotic device(s) during a data collection mission (DCM); generating a route to be traversed by robotic device(s) in DCMAs (the route being configured to cause robotic device(s) to traverse each two-way road at least one time in two opposing directions); causing robotic device(s) to perform DCM by following the route and collecting data; causing robotic device(s) to discontinue collecting data in response to a trigger event; and using the data collected during DCM to generate or update the map information. The map information may be used to facilitate controlled movement of a vehicle.

Abstract: Methods and systems for generating a planned path for a vehicle are disclosed. Upon receiving a trip service request, a processor will access a data store containing multiple candidate motion planning systems, each of which is associated with at least one vehicle or fleet. The processor will identify a starting point and a destination for the trip service request, and it will use an identifier for the vehicle or its fleet to select, from the candidate systems, a motion planning system. The processor will use the functions of the selected motion planning system to generate candidate trajectories for the first vehicle from the starting point to the destination in a high definition map. The processor will select a planned route from the candidate trajectories, and it will output trip instructions to cause the vehicle to move along the planned route.

Abstract: Methods and systems that use a phantom vehicle to help generate a planned path for a real-world vehicle are described. The system will identify a starting point and a destination for a trip of the real-world vehicle. The system will select, from the data store of vehicle profiles, a phantom vehicle having an associated motion planning system that corresponds to a system that is deployed on the real-world vehicle. The system will use a high definition map to generate a planned route for the real-world vehicle from the starting point to the destination in the map. The system will run a simulation in which the phantom vehicle moves along the planned route in the map. The system will then output a record of the simulation to a user of the real world-vehicle or to a system of the real-world vehicle.

Abstract: Methods and systems for estimating a time of arrival for a vehicle at a destination are disclosed. The system will access an adjacency graph comprising nodes and edges. Each node is associated with a unique location in a geographic area in which the vehicle is traveling. Each edge connects two of the nodes and is associated with an estimated travel time between the two connected nodes. The system will select, from the locations in adjacency graph, a first location that is near the vehicle and a second location that is near the destination. The location and destination are each associated with nodes in adjacency graph. The system will calculate a shortest path along the edges in the adjacency graph from the location and destination nodes, and it will calculate an estimated time of arrival for the vehicle as a function of the estimated travel times along the shortest path.

Abstract: Systems and methods for managing permissions and authorizing access to a service supported by a computing device. The methods comprise by a computing device: intercepting a request to access the service sent along with a certificate including a first tenant identifier (the first tenant identifier identifying a first business entity other than a second business entity providing the service); using the first tenant identifier to obtain permission information from a datastore (the permission information specifying which resources of a plurality of resources can be returned in response to requests from the first business entity); generating a web authentication token including the first tenant identifier and the permission information; and initiating operations of the service in response to a validation of the web authentication token.

Abstract: Disclosed herein are systems, methods, and computer program products for generating and using map information. For example, the method includes: identifying data collection mission area(s) (DCMAs) within a geographic location that is to be covered by robotic device(s) during a data collection mission (DCM); generating a route to be traversed by robotic device(s) in DCMAs (the route being configured to cause robotic device(s) to traverse each two-way road at least one time in two opposing directions); causing robotic device(s) to perform DCM by following the route and collecting data; causing robotic device(s) to discontinue collecting data in response to a trigger event; and using the data collected during DCM to generate or update the map information. The map information may be used to facilitate controlled movement of a vehicle.

Abstract: Methods and systems for estimating a time of arrival for a vehicle at a destination are disclosed. The system will access an adjacency graph comprising nodes and edges. Each node is associated with a unique location in a geographic area in which the vehicle is traveling. Each edge connects two of the nodes and is associated with an estimated travel time between the two connected nodes. The system will select, from the locations in adjacency graph, a first location that is near the vehicle and a second location that is near the destination. The location and destination are each associated with nodes in adjacency graph. The system will calculate a shortest path along the edges in the adjacency graph from the location and destination nodes, and it will calculate an estimated time of arrival for the vehicle as a function of the estimated travel times along the shortest path.

Abstract: Methods and systems for generating a planned path for a vehicle are disclosed. Upon receiving a trip service request, a processor will access a data store containing multiple candidate motion planning systems, each of which is associated with at least one vehicle or fleet. The processor will identify a starting point and a destination for the trip service request, and it will use an identifier for the vehicle or its fleet to select, from the candidate systems, a motion planning system. The processor will use the functions of the selected motion planning system to generate candidate trajectories for the first vehicle from the starting point to the destination in a high definition map. The processor will select a planned route from the candidate trajectories, and it will output trip instructions to cause the vehicle to move along the planned route.

Abstract: Systems and methods for managing permissions and authorizing access to a service supported by a computing device. The methods comprise by a computing device: intercepting a request to access the service sent along with a certificate including a first tenant identifier (the first tenant identifier identifying a first business entity other than a second business entity providing the service); using the first tenant identifier to obtain permission information from a datastore (the permission information specifying which resources of a plurality of resources can be returned in response to requests from the first business entity); generating a web authentication token including the first tenant identifier and the permission information; and initiating operations of the service in response to a validation of the web authentication token.

Abstract: Methods and systems for obtaining serviceable areas for a robotic system in a metropolitan area are described. A computing device obtains information about places where (i) the system can route to and from in the area and/or (ii) the system can stop in the area. The computing device uses the information to generate clusters of places where the robotic system can route or stop in the metropolitan area. The computing device creates a geometric shape for each cluster, wherein each shape which has a boundary defined by outermost places contained in the cluster. The computing device uses the geometric shapes to define the serviceable areas for the robotic system within the metropolitan area. The computing device uses the serviceable areas to generate a map displaying at least one geographic area representing a portion of the metropolitan area where a concentrated number of the places exist.

Abstract: Methods and systems that use a phantom vehicle to help generate a planned path for a real-world vehicle are described. The system will identify a starting point and a destination for a trip of the real-world vehicle. The system will select, from the data store of vehicle profiles, a phantom vehicle having an associated motion planning system that corresponds to a system that is deployed on the real-world vehicle. The system will use a high definition map to generate a planned route for the real-world vehicle from the starting point to the destination in the map. The system will run a simulation in which the phantom vehicle moves along the planned route in the map. The system will then output a record of the simulation to a user of the real world-vehicle or to a system of the real-world vehicle.

Abstract: An optical fiber adapter and method of fabricating the same from a wafer including a double silicon-on-insulator layer structure. The optical fiber adapter may include a mode converter, a trench, and a V-groove, the V-groove and the trench operating as passive alignment features for an optical fiber, in the transverse translational and rotational degrees of freedom, and in the longitudinal translational degree of freedom, respectively. The mode converter may include a buried tapered waveguide.

Abstract: An optical fiber adapter and method of fabricating the same from a wafer including a double silicon-on-insulator layer structure. The optical fiber adapter may include a mode converter, a trench, and a V-groove, the V-groove and the trench operating as passive alignment features for an optical fiber, in the transverse translational and rotational degrees of freedom, and in the longitudinal translational degree of freedom, respectively. The mode converter may include a buried tapered waveguide.

Abstract: An optical mode converter and method of fabricating the same from wafer including a double silicon-on-insulator layer structure. The method comprising: providing a first mask over a portion of a device layer of the DSOI layer structure; etching an unmasked portion of the device layer down to at least an upper buried oxide layer, to provide a cavity; etching a first isolation trench and a second isolation trench into a mode converter layer, the mode converter layer being: on an opposite side of the upper buried oxide layer to the device layer and between the upper buried oxide layer and a lower buried oxide layer, the lower buried oxide layer being above a substrate; wherein the first isolation trench and the second isolation trench define a tapered waveguide; filling the first isolation trench and the second isolation trench with an insulating material, so as to optically isolate the tapered waveguide from the remaining mode converter layer; and regrowing the etched region of the device layer.

Abstract: An optical mode converter and method of fabricating the same from wafer including a double silicon-on-insulator layer structure. The method comprising: providing a first mask over a portion of a device layer of the DSOI layer structure; etching an unmasked portion of the device layer down to at least an upper buried oxide layer, to provide a cavity; etching a first isolation trench and a second isolation trench into a mode converter layer, the mode converter layer being: on an opposite side of the upper buried oxide layer to the device layer and between the upper buried oxide layer and a lower buried oxide layer, the lower buried oxide layer being above a substrate; wherein the first isolation trench and the second isolation trench define a tapered waveguide; filling the first isolation trench and the second isolation trench with an insulating material, so as to optically isolate the tapered waveguide from the remaining mode converter layer; and regrowing the etched region of the device layer.

Abstract: An optical mode converter and method of fabricating the same from wafer including a double silicon-on-insulator layer structure. The method comprising: providing a first mask over a portion of a device layer of the DSOI layer structure; etching an unmasked portion of the device layer down to at least an upper buried oxide layer, to provide a cavity; etching a first isolation trench and a second isolation trench into a mode converter layer, the mode converter layer being: on an opposite side of the upper buried oxide layer to the device layer and between the upper buried oxide layer and a lower buried oxide layer, the lower buried oxide layer being above a substrate; wherein the first isolation trench and the second isolation trench define a tapered waveguide; filling the first isolation trench and the second isolation trench with an insulating material, so as to optically isolate the tapered waveguide from the remaining mode converter layer; and regrowing the etched region of the device layer.

Abstract: The disclosed embodiments provide a system that globally optimizes instruction code. During operation, the system obtains the instruction code, wherein the instruction code was previously generated from the source code, and wherein the instruction code is stored along with symbol table information. Next, the system constructs a symbol table from the symbol table information stored along with the instruction code. The system then creates a data structure for the instruction code, wherein the data structure contains a call graph for the instruction code, and wherein creating the data structure involves accessing the symbol table. Finally, the system performs optimizations on the instruction code to produce optimized instruction code, wherein performing the optimizations involves accessing the data structure.

Abstract: An internal recirculating ball screw and nut system that is easier to manufacture and more reliant by virtue of a particular configuration of the grooves on the interior of the nut or the follower. Crossback portions of select nut grooves are arranged in a manner that allows the bearing balls to recirculate by slipping over the top of adjacent thread lands of the screw, advancing and recirculating within a single 360 degree rotation within said nut. Said recirculation is accomplished solely through the design of the path of a unitary nut, without use of any ancillary devices.

Abstract: A system and method of deep space communication between a deep space location and Earth which includes communicating between a planetoid and the deep space location via an optical communications link and communicating between a user and the planetoid.