297 results about "Optimum route" patented technology

A system and method for providing call management services in a Virtual Private Network of the present invention uses the advantages of end-to-end Internet Protocol signaling. The system and method of the present invention includes a user profile which offers both a customer address and a user name as search keys. The method includes locating the called party who may be at a multiplicity of possible physical locations, evaluating the calling and called party privileges, routing preferences and busy / idle status for establishing permission to set up the call, determining an optimum route to establish the telephone call. Due to the system and method of the present invention, the telephone call takes the optimum route and preferably the most direct route to the destination with a high probability of completion.

A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.

Traffic information, including flow information and incident information, obtained through a traffic management system for providing and facilitating the exchange of traffic information between a remote location and a vehicle may be used in route calculation by a navigation device. The navigation device may recalculate a route based on anticipated user error. Alternatively, the navigation device may recalculate a route using received traffic information triggered by the receipt of a traffic information update, or triggered by the passage of an amount of time. The broadcast rate of traffic information updates may vary temporally (providing more frequent updates during peak commute times) or geographically (providing more frequent updates to metropolitan areas with increased traffic information needs). If route calculation is triggered by an elapsed amount of time, the amount of time may vary to be shorter during peak commute times. Additional route calculation techniques allow the incorporation of historical traffic information or the use of the most recent traffic information if incomplete traffic information is available. Still further route calculation techniques may calculate a best route by avoiding zigzagging or evaluating an assigned cost of a potential route.

There is provided a navigation system using a wireless communication system and a route guidance method thereof. In the navigation system, an information center searches out an optimum route between a present vehicle position and a destination referring to map data in its map database and generates route guidance data. A navigation terminal inside the vehicle calculates the present position of the vehicle, transmits the vehicle's current position information to the information center, receives the route guidance data, and announces a notification message. A wireless communication network connects the information center to the navigation terminal wirelessly.

A navigation ECU records a charge-possible point through charging position record processing and records the history of traveling conditions near the charge-possible point through learning control processing. If a destination point on an optimum route is the charge-possible point, the navigation ECU determines a continuous section where the EV traveling is possible up to the charge-possible point based on the history through SOC management plan preparation processing, and changes over the HV traveling and the EV traveling according to the determination through in-travel processing.

PCIe is a point-to-point protocol. A PCIe switch fabric has multi-path routing supported by adding an ID routing prefix to a packet entering the switch fabric. The routing is converted within the switch fabric from address routing to ID routing, where the ID is within a Global Space of the switch fabric. Rules are provided to select optimum routes for packets within the switch fabric, including rules for ordered traffic, unordered traffic, and for utilizing congestion feedback. In one implementation a destination lookup table is used to define the ID routing prefix for an incoming packet. The ID routing prefix may be removed at a destination host port of the switch fabric.

A route search method for a navigation system using the XML map data that is layered based on administrative regions improves efficiency and accuracy of finding an optimum route. The method includes the steps of establishing boundary nodes on boundaries of administrative regions, creating cost information on virtual links that connect the boundary nodes on the administrative regions and physical links on a base layer, selecting candidate virtual links regions by evaluating the cost information, detecting candidate total routes between the start point and destination by connecting the candidate virtual links and other routes, and applying physical links in the base layer to the candidate total routes for further evaluating the costs of the total routes to select the most cost effective total route.

A computer assisted navigation system determines a recommended route for a vehicle to travel between a source and destination location, and provides exception notifications in some events where the vehicle travels a route different that the recommended route. The vehicle includes a navigation system that has a location monitoring component. It is determined if the location of the vehicle is different than a location along the recommended route. An exception notification is generated when the vehicle is not along the recommended route it is likely that the reason the recommended route was not used is because the recommended route is not the optimal route between the source and destination locations.

Disclosed is a method and system for link state report in order to select an optimum route in a wireless communication system which includes a mobile station, a base station for providing a service to the mobile station, and one or more relay stations for relaying information between the base station and the mobile station. The method includes: detecting a physical channel from the base station and measuring a link state of a link with the base station based on the detected physical channel, and inserting information of the measured link state into a message and broadcasting the message through a wireless channel.

A method and system for planning and optimizing the movement of a robotic device comprises establishing a plurality of spatial locations where the device can possibly be positioned and establishing rule sets for constraining movement of the robotic device between the locations. Once a start and end point have been determined, the method of the invention calculates all possible routes for the device to move, via the established locations and following the constraints of the rule sets. The calculated routes are then compared to a criteria, such as minimizing time, and an optimum route, meeting the desired criteria is determined. The calculated routes may also be cached for future access. The invention also provides for an error recovery method for allowing a robotic device to recover should it encounter an error.

Each taxi detects, by a GPS terminal mounted thereon, its present location using information sent from a GPS satellite and sends to a center equipment the present location and information on a destination specified by a customer. The center equipment finds an optimal route, a charge for the route, and the like, according to the information on the present location and the destination, received via the Internet. The equipment then transmits the optimal route, charge, and the like to the taxi. The center equipment which controls taxis in a centralized manner has a function to calculate an optimal route from the present location to the destination. This minimizes the cost for a taxi company and simplifies administration of taxis.

The invention provides an automatic guided vehicle based on map matching and a guide method of the automatic guided vehicle. The automatic guided vehicle comprises a map creation module, a location module, a human-machine interaction module, a route planning module, an autonomous navigation module and a dispatching system module, wherein the map creation module is used for creating an environmental map; the automatic guided vehicle utilizes the carried location module to match the observed local environmental information with a preliminarily created global map to obtain pose information under the global situation; the human-machine interaction module is used for displaying the information and working state of the automatic guided vehicle in the map in real time; the route planning module is used for planning a feasible optimum route in the global map; the automatic guided vehicle is autonomously navigated by virtue of the autonomous navigation module according to the planned route; the dispatching system module is used for dispatching the automatic guided vehicle closest to a calling site to go to work. By adopting the automatic guided vehicle, no other auxiliary location facility is needed, no alteration is made for the environment, the capability of the automatic guided vehicle is completely depended, the automatic guided vehicle is utterly ignorant to the environment, and no priori information is provided.

A method and apparatus for a navigation system evaluates an overall cost of each candidate route by incorporating traffic information such as traffic incident types and traffic flow speeds. An optimum route to the destination is determined by comparing the costs of two or more candidate routes and selecting a candidate route of the least cost. The method and apparatus determines relevancy and accuracy of the traffic information and adjusting the cost of the candidate route. When the traffic information on the candidate route shows a conflicting situation, the method and apparatus modifies the cost derived from the traffic information. When modifying the cost, the traffic speed information is prioritized over other type of traffic information.

The present invention provides a route searching device that can detect an optimum route with higher precision, a route searching method, and a route searching program.The route searching device detects an optimum route among possible routes from a first point to a second point, on the basis of link costs that are set for a plurality of links constituting the possible routes. The route searching device makes at least one of a determination on whether there is a restricting element for restricting the movement of a movable body at the time of moving from the road corresponding to one link to the road corresponding to another link via the connecting portion corresponding to a node to which at least two links are connected, a determination on the number of links connected to the node, a determination on the shape formed with the roads corresponding to the links connected to the connecting portion corresponding to the node, a determination on attributes of at least one of the roads corresponding to the links connected to the node, and a determination on the conditions of the roads. The route searching device then acquires a node cost that represents the difficulty of the movement from the road corresponding to the one link to the road corresponding to the another link, the node cost being in accordance with one or a combination of two or more of factors including the existence of a restricting element, the number of connected links, the shape formed with the roads corresponding to the links, the attributes of the roads, and the conditions of the roads, the factors being on the basis of the determination results of the determining means. On the basis of the link cost and the acquired node cost, the route searching device searches for the optimum route.

An inventive system for delivering packages includes a computer system for determining an optimum route for delivering the package, an electronic tag associated with the package including a first transceiver, and a signaling device. The inventive system also includes a base station having a second transceiver for wirelessly communicating with the first transceiver.

A robot control apparatus allows a plurality of mobile robots to carry out tasks at a reduced or minimized cost as a whole with consideration given to costs derived from an encounter with an obstacle is provided. An action optimization controller provided in the robot control apparatus generates an instruction for optimizing actions of the plurality of mobile robots so that the plurality of mobile robots carry out the tasks at a minimized cost, based upon locomotion plan information indicative of locomotion plans of the plurality of mobile robots. A possibility that any robots have an encounter with an obstacle is determined by comparing distances from the robots to the obstacles. A locomotion plan implementation cost is calculated with consideration given to the possibility of encounter, and thus an optimum route is selected based upon the locomotion plan implementation cost with the encounter-derived cost. In accordance with the optimum route, the locomotion plan for the robot is modified.

A system and method of building a routing table for use in a multiprocessor computer system having a plurality of processing nodes and physical communication links interconnecting the processing nodes in a predefined topology. The system determines all single hops for each processing node, queries each adjacent node for its single hop routes, determines if all nodes can be reached and if all nodes cannot be reached, sets x=2. The system then queries each adjacent node for its “x” hop routes, eliminates all routes to a particular node that are longer than existing routes from the node where the routing table will reside to that particular node, eliminates all routes that introduce a cyclic dependency and chooses a best route for the node. The process is repeated as needed until all nodes can be reach all other nodes.

A method and system for generating optimal itineraries based on network connectivity. A computer receives a first message from which a current position of a vehicle on a trip, destination, service(s) being provided to mobile device(s) in the vehicle, service provider(s) and network(s) are extracted. Optimal itineraries are generated by generating sets of optimal parameters that include paths for which connectivity measures satisfy predefined criteria and hops that indicate positions associated with connectivity changes. A response to the first message indicates the optimal itineraries and the associated sets of optimal parameters and is sent to a vehicle-based device. Sending the response results in the mobile device(s) making the connectivity changes when the vehicle is detected at the hops.

A method for relaying a route request RREQ message by an intermediate node which is connected with at least one node using a tree topology in a mobile communication system including a destination node and a source node which sends the RREQ message to the destination node via at least one intermediate node, to thus establish an optimal route for communications. The RREQ message is received along the route other than the tree route, and the first information is updated using its information. The intermediate node relays to a next intermediate node the RREQ message containing the updated first information.

Computer aided design(CAD) methods and systems of routing pipes, ducts and other services, such as utility and HVAC(Heating Ventilation and Cooling) lines in three dimensions(3D) through congested areas in industrial plants, ships, land vehicles, air vehicles, structures, buildings, and the like. The invention combines high speed real-time two dimensional router software and a simple graphical user interface to create an environment in which a designer can rapidly create fully valid 3D(three dimensional) routes for piping, HVAC(Heating, Ventilation and Air Conditioning) ducting, cableways and other swept shapes. The designer can use the invention to generate optimal 3D routes nearly as fast as the designer can move his / her mouse, and the invention can be imbedded within existing 3D(three dimensional) CAD(computer aided design) systems.

The present invention relates to a method for setting multilayer satellite network system route, including steps of: 1. setting parameters for the network initialization; 2. fixing a time, solving satellite orbit parameters in the interval of time, calculating the location coordinates of the satellite and the length of the link between stars, and establishing a network topological structure; 3. calculating the load of link between stars of the multi-layer satellite network; 4. calculating the process and exchange time delay on stars according to the queuing theory; 5. searching source satellite and object satellite of each satellite layer; 6. selecting the satellite layer for transporting services according to the communication service instruction requirement and network states, and searching an optimum route according to routing algorithm. Relative to traditional stationary orbit satellite, the present invention has small transmission delay, and high validity. The system has advantages of more flexible routing, effective guaranty of service quality, multiple replaceable chain circuits, stronger survivability, a capacity of processing and exchanging on star, optical or microwave links between stars, and capability of providing wideband synthetic service for users in global scope.

A navigation system computes an optimal route between an origin and a destination using a map server. The map server identifies likely points of deviation from the optimal route, and prior to transmitting map data to a client device, establishes alternative optimal routes from the deviations to the destination. A search algorithm is employed in which computation effort is reduced through improved heuristics and enhanced recognition of previously expanded nodes and alternative routes through nodes determined in prior iterations of the search. A route corridor map including the optimal route and alternative routes is download from the map server to the client device.

This system accompanies the alarms of TAWS type and in particular the alarms of “Avoid terrain” type indicating to the pilot that he has passed the limit point of success of a standard vertical avoidance maneuver, indications (32, 33) of free-travel distances in azimuth sectors suited to a clearance maneuver and one or more recommended relief avoidance maneuvers (A, B), both lateral and vertical. For the determination of the limit point, it monitors the penetration of a model of the terrain being flown over into a first protection volume (1) linked to the aircraft and configured in such a way as to model a standard vertical avoidance maneuver trajectory executed without notable delay. For the determination of the azimuth sectors open to a clearance maneuver, it analyzes the penetrations of the model of terrain being flown over in a second protection volume with large azimuth aperture, linked to the aircraft and configured in such a way as to contain the limit point protection volume (1). To evaluate the free-travel distances, it searches for limit points of effectiveness of a standard vertical avoidance maneuver, on arbitrary distancing trajectories in the azimuth sectors open to the clearance maneuvers. Based on the determination of these free-travel distances, the system determines the limit instant of manual initiation by the pilot or automatic initiation of an avoidance trajectory and determines the optimum route alteration to be initiated prior to the avoidance maneuver.

A navigation system for finding an optimum route to the destination using traffic incidents information provides a novel approach to enable a user easily and quickly to select which incidents should be avoided. The user can easily identify the important traffic incidents because the system can display only the traffic incidents on the calculated route as well as all the traffic incidents in the converged area. The user can select the incident to receive more detailed information including a live image of the traffic incident and specify one or more incidents to be avoided on the route to the destination. The system calculates a new optimum route to avoid the specified traffic incidents. The traffic incidents are illustrated on the navigation system by two or more different icons representing predefined types of traffic incidents

Disclosed is a mobile terminal capable of interworking a navigation function with a schedule management function. If a user previously registers schedule information including the origin, destination, appointment date / time and schedule alarm time, the mobile terminal will automatically generate an alarm when the schedule alarm time is reached on the date of appointment. Also, the mobile terminal displays an optimal route to the destination and time information to help the user to reach the destination at a desired time. To display the time information (for example, remaining time to reach the destination), the mobile terminal measures the traveling speed of the user and calculates the remaining time to reach the destination based on the measured traveling speed.

A navigation system determines one or more routes for a user from one location to another. The navigation system uses model data or information about weather, date, or time to determine an optimal route for a user. The navigation system may consider user preferences and dangerous or awkward conditions or criteria, and may perform a cost value analysis in determining the optimal route for a user.

A route searching system is provided with: a road map database for storing a road map data; a searching device for performing a link cost calculation on the basis of the road map data and thereby searching an optimal route. The searching device increases or decreases the link cost of a link corresponding to a road section that requires a difficult turn on a route option, the difficult turn being a right turn or a left turn, one of which is more difficult than the other in accordance with a traffic rule, and connecting a node corresponding to an intersection, in at least two cases depending on the difficulty of the difficult turn at the intersection.

The invention provides a multi-waypoint (destination) navigation route planning method and system in an actual demand situation that the multiple waypoints have different priority under multi-factor influence. The method adopts a weight scoring based optimum route determining model and a machine learning based multi-influence-factor weight coefficient determining method. Specifically, a multi-point road planning model oriented to multiple waypoints with different priority is designed firstly; the machine learning based influence factor weight coefficient determining method is provided for determining coefficients in the model; then the multi-point road planning system capable of being widely popularized to numerous fields is obtained. One new solution is provided for multi-influence-factor and multi-waypoint route navigation, and route planning is more intelligent, higher in efficiency, more dynamic and more automatic.

The invention discloses a method for seeking for an overall situation time optimal path under a dynamic time varying environment. The method comprises the following steps: extracting environment state information; molding the space of the environment; carrying out time division on the environment according to the environment state information, namely dividing a time axis into a plurality of time intervals and utilizing time consumption to represent an environment state of each time interval; utilizing an improved A* algorithm to search the environment state to obtain the overall situation time optimal path; introducing weight to realize a multi-scale path planning aim. The method can be used for realizing the aims of obstacle avoidance of indoor robots and path optimization of the complicated time varying environment of outdoor road traffic; the weighing can be carried out between time cost and distance cost according to different requirements of users to formulate the optimal path and accurately calculate the time spent for the route.