9 results about "Route finding" patented technology

A computer-implemented method executed by data processing hardware of a robot causes the data processing hardware to perform operations including obtaining a topological map including waypoints and edges. Each edge connects adjacent waypoints. The waypoints and edges represent a navigation route for the robot to follow. Operations include determining, that an edge that connects first and second waypoints is blocked by an obstacle. Operations include generating, using image data and the topological map, one or more alternate waypoints offset from one of the waypoints. For each alternate waypoint, operations include generating an alternate edge connecting the alternate waypoint to a waypoint. Operations include adjusting the navigation route to include at least one alternate waypoint and alternate edge that bypass the obstacle. Operations include navigating the robot from the first waypoint to an alternate waypoint along the alternate edge connecting the alternate waypoint to the first waypoint.

A system can receive selection of endpoints for a spool on a graphical user interface (“GUI”) and attempt to assemble a spool based on the endpoints. To do so, a plugin can execute a route-finding process that traverses routes from the endpoints. The routes can be determined by retrieving connectors from the endpoints and, for each connector, determining what parts are connected. For each connected part, the process can repeat so long as the connected part is not one of the endpoints or already in another route or spool. When the routes are complete, the connected parts can be treated as an assembly of the spool. The GUI can generate a spool sheet that uses the assembly as the spool.

The present invention relates to a method, system and terminal for automatic path finding of a single pipe of a process pipeline of a nuclear power plant, comprising the following steps: obtaining input data; the input data includes: a plant layout scene model, an equipment obstacle model and a room obstacle model; performing global space path finding according to the plant layout scene model to obtain a room path through which the pipeline passes; obtaining a room to be traversed according to the determined room path through which the pipeline passes; performing local space path identification on the room to be traversed to obtain a local space path finding grid; performing path finding based on the local space path finding grid to obtain a path of the pipeline in a single room. The present invention adopts an automatic path finding method to overcome the problems existing in the traditional nuclear power process pipeline design method, such as high design difficulty, large workload, easy human error, high cost of iterative design solutions, and further reduce the design and construction costs of nuclear power engineering projects by improving the level of automation and intelligence of nuclear power process pipeline design.

This invention discloses a disaster prevention living circle optimization method based on evacuation-search virtual emergency route finding features, comprising: S1: extracting the spatiotemporal boundary of the disaster prevention living circle; S2: establishing emergency action units of the disaster prevention living circle; S3: establishing a virtual emergency route finding spatial model of the emergency action units; S4: establishing evacuation-search virtual emergency route finding interactive functions; S5: conducting evacuation-search virtual emergency route finding experiments; S6: analyzing the effectiveness index and route finding feature correlation index of the virtual emergency route finding experiments to obtain evacuation-search multi-role emergency route finding features; S7: proposing a disaster prevention living circle optimization strategy.

The invention relates to the technical field of route planning, and particularly discloses a route finding planning method for intelligent shared electric bicycles, and the method comprises the following steps: S1, screening to-be-recycled bicycles, obtaining the number of routes and the distance of a single route, calculating the mean value of the distances, and calculating the ideal time; calculating actual time according to the current traffic flow, and calculating a time coefficient; s2, calculating the total weight of the recycled bicycle, and calculating a loss value and energy consumption; and S3, calculating a comprehensive consumption coefficient of the recycled bicycle, calculating a dominance coefficient, and screening an optimal recovery route. According to the method for planning the finding route of the shared electric bicycle, the time cost and the energy cost consumed in the finding process of the shared electric bicycle are reduced by reasonably planning the finding route, and the operation efficiency in the finding process of the bicycle is improved.

A technique for interacting with map-related information integrates the use of a machine-trained language model. Upon submission of a query, the technique uses the machine-trained language model to assess at least one intent associated with the query. The technique then invokes an intent-specific processing flow to provide an output result. Each processing flow invokes the use of at least one processing engine to perform an engine-specific task, such as geocoding, route finding, or image retrieval. A processing flow can also call on the machine-trained language model one or more additional times. In some cases, the technique includes a feedback mechanism for soliciting additional information from a user.

An information processing unit (2) according to the present disclosure comprises a route finding unit (23) that performs an evaluation process of assessing whether at least one of a first stop or a second stop will occur on each of route candidates, based on signal information representing a light color change time of a traffic signal system and traffic congestion information representing a situation of the occurrence of traffic congestion, and determines a route to be traveled by a vehicle (1) from the route candidates using an evaluation result obtained by the evaluation process, wherein the first stop is a stop of the vehicle (1) due to a light color of the traffic signal system, and wherein the second stop is a stop of the vehicle (1) due to a traffic congestion.and the route candidates are candidates for a route from a boarding point to a destination of a user-passenger of the vehicle (1).

A device and method for route search using a dynamic resolution-based geospatial embedding are presented. The device includes a memory module configured to store digital map data and a processor configured to perform a route search based on an estimated time of arrival (ETA) prediction model in response to a route search request. The ETA prediction model is based on a road network divided into a plurality of tiles.

A computer-implemented method executed by data processing hardware of a robot causes the data processing hardware to perform operations including obtaining a topological map including waypoints and edges. Each edge connects adjacent waypoints. The waypoints and edges represent a navigation route for the robot to follow. Operations include determining, that an edge that connects first and second waypoints is blocked by an obstacle. Operations include generating, using image data and the topological map, one or more alternate waypoints offset from one of the waypoints. For each alternate waypoint, operations include generating an alternate edge connecting the alternate waypoint to a waypoint. Operations include adjusting the navigation route to include at least one alternate waypoint and alternate edge that bypass the obstacle. Operations include navigating the robot from the first waypoint to an alternate waypoint along the alternate edge connecting the alternate waypoint to the first waypoint.