35 results about "Route assignment" patented technology

Methods, computer-readable media, software, and apparatuses provide a system for forming and managing a caravan of vehicles. The system may include computing devices in a plurality of vehicles belonging to a caravan. The computing devices participating in the caravan may communicate various information to each other. This information may be used to generate and manage a route for the caravan. The system may also be used to select a leader and / or order of the caravan for a particular trip. During the trip, the system may monitor the caravan and analyze inputs from participants and vehicles. Further, the system may modify the route based on such inputs and distribute the modified route to participating computing devices so that the caravan may be maintained.

A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.

There is described a method and a device for automatically generating traffic management strategies in the event of suddenly occurring traffic events that lead to a disruption in the flow of traffic. During the method, a database is used in which information concerning elements of the influencing of traffic and control of traffic, which exist in the traffic network, local positions of the elements, switching states that can be adopted by the elements, and immediate effects of the respective switching states upon the traffic is contained in a form that can be processed by a computer program. Based on the incoming data concerning the traffic events or disruptions in the flow of traffic as well as an actual traffic situation, a simulation is automatically carried out with an analysis program, during which dynamics of the spread of the disruption in the traffic network are modeled and one or more new traffic-optimal route allocations with capacity values required therefore are calculated. A generation program selects from the database the elements that can make a contribution to the conversion of the new route allocation, and automatically parameterizes these elements using the adoptable switching states and their effect. The selected elements and their parameterization are suggested to an operator as a strategy. The method and the associated device make possible a quick reaction to unforeseeable events in the traffic network.

The embodiment of the invention provides a business importance-based risk-balancing routing assignment method and system used for the technical field of routing assignment of a power communication network. The method comprises the steps of obtaining request business in the power communication network and determining the importance of the request business; determining k paths of the request business through a calculation method of the shortest path of a directed graph and a routing risk decision function built in advance according to the importance of the request business, wherein k is a positive integer; obtaining the k paths and determining the optimal path according to the maximum-minimum fairness constraint principle; and completing routing assignment according to the optimal path. Through the business importance-based risk-balancing routing assignment method provided by the embodiment of the invention, improvement of the actual pertinence of a risk balancing method is achieved and the practicability is improved.

A computer system for executing a method for improving route assignment performance. A route data structure is provided with a labeling algorithm. The route data structure has one or more route vectors representing a set of route options for a plurality of available resources to fulfill a plurality of job orders at respective physical locations. A linear program is solved to obtain a route assignment solution for the set of route options in the route data structure. If the solution is non-fractional, then the solution is provided as the route assignment solution for the set of route options. If the solution is fractional, then route options having solution variables with a non-fractional route-is-assigned value are identified as assigned routes and a subset of the fractional solution variables are rounded to the route-is-assigned value.

A method for establishing a connection through a communication network that includes multiple segments includes providing a sharing definition defining a sharing of bandwidth among connections in the network. Two or more candidate routes for a new connection to be established through the network are identified. For each of the two or more candidate routes, a cumulative additional bandwidth reservation to be allocated to the new connection in the segments along the candidate route is calculated responsively to the sharing definition. A preferred route having a minimum value of the cumulative additional bandwidth reservation is selected out of the two or more candidate routes. The new connection is established using the preferred route.

A vehicle such as a combat aircraft, and methods of operating one or more such vehicles. In each vehicle, a processor receives status reports from a plurality of vehicle subsystems faster than the pilot can assimilate them. The processor presents to the pilot, on a display, selections of at least one course of action, based on the current status reports. When a plurality of vehicles are operated, with one of the pilots being a commander of the plurality of vehicles, the selections are presented to the commander, who assigns initial courses of action to the other pilots. Subsequently, either the commander or the pilot of each vehicle may select the course of action for the vehicle.

The invention provides a double-platform bus berth allocation optimizing method comprising steps of: computing the characteristic values of all bus stop route allocation schemes, dividing the characteristic values into areas, computing the average delay and evaluation index values of the subareas, singling out an optical subarea, cyclically comparing the evaluation index values of the randomly-selected bus stop route allocation schemes in the optical subarea, and finally singling out the optimal bus stop route allocation scheme. The method reasonably allocates bus berths while not reconstructing bus platforms, shortens bus delays, and relieves traffic jam around the bus stops.

A particular method includes sending a taxiing routing message from a device to a vehicle. The taxiing routing message indicates a route assignment associated with an airport. The method also includes in response to receiving an acknowledgment of the taxiing routing message from the vehicle, indicating a status at a graphical user interface. The status is associated with the taxiing routing message.

A method, system, and computer program product for providing popular routes via a global positioning satellite (GPS) system. A GPS device receives a route request from a user. The GPS device then determines a current location of the GPS device and connects to a network server. In response to connecting to the network server, the GPS device transmits a route selection request to the network server. In response, the GPS device receives a route selection list from the network server where the route selection list contains a plurality of routes previously taken by other drivers. Each route is assigned a popularity rating. The GPS device displays one or more of the routes of the route selection list, and requests that a user select a route. After the user selects a route the GPS device displays the selected route as an overlay on a map display.

Systems and methods for optimizing delivery vehicle resources (e.g. a plurality of vehicles) are described herein. Available time slots for the plurality of vehicles are determined and presented to a user. In response to receiving a delivery order indicating a selected time slot, the delivery order is assigned to a vehicle from the plurality of vehicles based on a time slot indicated in the delivery order and a set of delivery parameters. A delivery route is calculated for each vehicle having a delivery order based on the set of delivery parameters. An optimized delivery route is calculated for each vehicle having a delivery order based on the set of delivery parameters.

The present invention relates to a method and device for processing patrol management information. The method includes: obtaining a patrol route drawn by a first terminal logged in with a patrol administrator account, and configuring a patrol weight value for the patrol route; according to the The patrolling weight value generates the patrolling plan information of the patrolling route; according to the patrolling plan information, the patrolling personnel account is assigned to the patrolling route, and the patrolling task information corresponding to the patrolling personnel account is generated; the patrolling task information is sent to The second terminal logged in with the corresponding patrol personnel account. The method and device for processing patrol management information provided by the present invention make the operation of the entire allocation process relatively simple when assigning patrol personnel to patrol routes, and improve the efficiency of assigning patrol personnel to patrol routes.

Embodiments of the present invention provide a route assignment method, a server, a terminal device, a control device and a system, the method including: receiving a target route selection instructionsent by the terminal device; determining a target route according to the target route selection instruction; sending the target route to a control terminal of a drone to enable the control terminal to control the drone to execute the target route. According to the embodiments of the present invention, the target route selection instruction sent by the terminal device is received by the server, the target route is determined according to the target route selection instruction, the target route is sent to the control terminal of the drone to enable the control terminal to control the drone to execute the target route, so that the manager of the drone can plan the route of the drone. Meanwhile, the control terminal of the drone is not required to pre-plan the route and then control the droneto execute the route, thereby improving the route execution efficiency of the drone.

The invention discloses a deployment method for collective passenger car rental, and aims at carrying out weekday commuting. According to the method, a driver side, a client and a background are provided. The method comprises the following steps of: A, in two days before a weekday, sending car sharing information to the client by the background; B, selecting departure places, destinations and departure time as car taking information by users through a user side and sending the car taking information to the background; C, processing all the received car taking information by the background, determining running routes of passenger cars and sending the routes to the client; D, selecting required running routes by the users through the user side and feeding back the selected running routes to the background; and E, in the day before the weekday, distributing a driver for each running route by the background according to the selection of the users, sending corresponding information to the driver side, and sending confirmation information to the user side at the same time. The deployment method has the advantages of appointing cars of weekdays before the weekdays to provide convenience, and adopting a unique car route planning method to provide high reliability.

The invention provides a route dynamic allocation method of an unmanned sweeper. The method comprises the steps: acquiring a plurality of sweeping routes of a to-be-swept area; acquiring vehicle position information of a plurality of sweepers; according to a preset distance priority rule and the vehicle position information, distributing the sweeping route to a corresponding sweeper, and obtainingvehicle state information and route completion information of the sweeper; according to the route completion information, screening out the motor sweeper completing the sweeping task as a completed motor sweeper; screening out the overload sweeper according to a preset screening rule and the route completion information; and according to the route completion information, dividing the uncompletedcleaning routes corresponding to the overload sweeper into temporary operation routes with the same number as the completed sweepers again, and according to a preset distance priority rule, distributing all the temporary operation routes to the corresponding completed sweepers. According to the route dynamic allocation method of the unmanned sweeper, the situation that operation is delayed or cannot be completed is avoided.

The present disclosure relates to an apparatus, a method, and a non-transitory computer readable storage medium for filtering routing assignment (RA) messages in a computer network. Methods, non-transitory computer readable storage medium, and apparatus consistent with the present disclosure may receive an RA message, extract information included in an RA message when identifying whether that particular RA messages should be forwarded or blocked. Information used to identify when to forward or block particular RA messages may be related to information that identifies a user of a computer or that identifies a computer that sends RA messages over a computer network.

The invention provides a starting point route recommendation method, device and system and a computer storage medium. The method comprises the steps of obtaining multiple pieces of historical communication data, wherein the historical communication data comprises communication data obtained by communication between a user terminal of a user and communication equipment and obtained when the user terminal initiates a positioning request; detecting users belonging to the same position area by using the historical communication data; enabling the distance between the positions where the users in the same position area to initiate the positioning request is smaller than a distance threshold value; and determining the recommended starting point route of the target user in the users belonging to the same position area as the recommended starting point route of the non-target user belonging to the same position area. The travel routes of the users appearing in the same position area may be consistent, and according to the scheme, the recommended starting point routes of the users configured with the recommended starting point routes are allocated to other users not configured with the recommended starting point routes in the same position area, so that the users with less historical navigation data can use the personalized navigation function.

The invention provides a navigation mark inspection system based on unmanned aerial vehicle remote sensing and an inspection method thereof. The navigation mark inspection system comprises a control system, an inspection host and a navigation mark to be inspected, wherein the control system comprises a navigation mark historical information base; the control system further comprises a route distribution module, a navigation mark malfunction judgment module, a malfunction reason collection module and a route adjustment module; the route distribution module is used for distributing an inspection route of the inspection host; the navigation mark malfunction judgment module is used for judging whether the navigation mark is abnormal or not according to the navigation mark information obtained by the inspection host; the malfunction reason collection module is used for acquiring the abnormal information of abnormal navigation marks through the inspection host; the route adjustment module is used for adjusting the inspection route when the abnormal information of the abnormal navigation mark collected by the inspection host cannot judge the abnormal reason, and other inspection hosts are used for collecting the abnormal information of the abnormal navigation mark. The system is advantaged in that inspection efficiency is improved.

An object of the present disclosure is to enable efficient route assignment that guarantees a communication quality for each path between end terminals even if a state of a communication network varies.The present disclosure is a network controller apparatus connected to a communication network that performs data communication between end terminals by using a plurality of paths. The network controller apparatus stores log information about a communication state for each path collected from the communication network, determines whether there is a path with a deteriorated communication quality on the basis of the log information, if there is a deteriorated path, determines whether there is a path in which a communication quality between end terminals utilizing the deteriorated path can be guaranteed, from among other paths available to the end terminals utilizing the deteriorated path, and if the communication quality cannot be guaranteed, calculates a new route in which the communication quality between the end terminals utilizing the deteriorated path can be guaranteed, and switches the deteriorated path to a path on the new route.

A method for generating workforce street level routing is provided. The method includes ranking each job within a set of jobs available for assignment at times of day to a worker and producing a street level routing assignment schedule including a sequence of jobs assigned to the worker in which each of the sequence of jobs corresponds to a highest ranked job within the set of jobs available for assignment to the worker at each particular time of day during a work-shift. The ranking step includes creating a coefficient representing an appeal for venturing or homing of the worker at each particular time of day during the work-shift, developing a score from a plurality of factors for each job within the set of jobs at each particular time of day, and using the coefficient representing the appeal for venturing or homing to produce at least one of the factors.

A method for dynamically assigning routes of unmanned sweepers provided by the present invention includes obtaining several sweeping routes of an area to be cleaned; obtaining vehicle position information of several sweepers; Distribute to the corresponding sweeper, and obtain the vehicle status information and route completion information of the sweeper; filter out the sweeper that has completed the cleaning task as the completed sweeper according to the route completion information, and filter out the sweeper according to the preset filtering rules and route completion information. Overloaded sweepers, according to the route completion information, re-divide the unfinished cleaning routes corresponding to the overloaded sweepers into temporary operation routes with the same number of completed sweepers, and assign all temporary operation routes to the corresponding ones according to the preset distance priority rule. Completed on the sweeper. The dynamic route allocation method of the driverless sweeper of the present invention avoids the situation that the operation is delayed or cannot be completed.

The invention relates to a method for operating an elevator system (1) having a plurality of elevator cars (20, 21, 22, 23, 24, 25, 26), which can be moved individually between a plurality of floors, wherein in one elevator shaft (3, 4) of the elevator system (1), a plurality of elevator cars (20, 21, 22, 23, 24, 25, 26) can be moved simultaneously. In doing so, a predetermined travel route is assigned to an elevator car, or to a plurality of elevator cars (20, 21, 22, 22, 23, 24, 25, 26). Said travel route is defined by a sequence of stopping points, which is predetermined in advance for the respective elevator car (20, 21, 22, 23, 24, 25, 26), and at which the respective elevator car (20, 21, 22, 23, 24, 25, 26) is to make a scheduled stop. Those elevator cars (20, 21, 22, 22, 23, 24, 25, 26), to which a travel route is assigned, are then moved in accordance with the travel route (30, 31, 32, 33, 34, 35, 36) assigned to the respective elevator car (20, 21, 22, 23, 24, 25, 26). The invention further relates to an elevator controller (6), and to an elevator system (1) for carrying out such a method.

The invention discloses an automatic planning and arranging method for cargo distribution. The method comprises the following steps: S1, manually creating a distribution route; calculating and summarizing historical data of factors influencing a delivery route, setting a navigation route, estimating the number of required vehicles, calculating corresponding matching degrees according to the positions of drivers and the familiarity degree of the drivers to the set route, sorting the matching degrees of the drivers from large to small, and selecting the first three drivers as delivery drivers of the route; and S2, allocating and distributing drivers by one key; after a delivery route is created, for goods orders of each day, enabling the system to automatically match routes according to delivery addresses of the goods orders and then match drivers set according to the goods weight and the matched routes in sequence according to a driver setting sequence. The method considers the influence of a plurality of factors influencing route distribution, and the distribution mode is scientific, efficient and high in accuracy.