357 results about "A* search algorithm" patented technology

A search engine provides intelligent multi-dimensional searches, in which the search engine always presents a complete, holistic result, and in which the search engine presents knowledge (i.e. linked facts) and not just information (i.e. facts). The search engine is adaptive, such that the search results improve over time as the system learns about the user and develops a user profile. Thus, the search engine is self personalizing, i.e. it collects and analyzes the user history, and/or it has the user react to solutions and learns from such user reactions. The search engine generates profiles, e.g. it learns from all searches of all users and combines the user profiles and patterns of similar users. The search engine accepts direct user feedback to improve the next search iteration One feature of the invention is locking/unlocking, where a user may select specific attributes that are to remain locked while the search engine matches these locked attributes to all unlocked attributes. The user may also specify details about characteristics, provide and/or receive qualitative ratings of an overall result, and introduce additional criteria to the search strategy or select a search algorithm. Additionally, the system can be set up such that it does not require a keyboard and/or mouse interface, e.g. it can operate with a television remote control or other such human interface.

Input text data undergoes language analysis to generate prosody, and a speech database is searched for a synthesis unit on the basis of the prosody. A modification distortion of the found synthesis unit, and concatenation distortions upon connecting that synthesis unit to those in the preceding phoneme are computed, and a distortion determination unit weights the modification and concatenation distortions to determine the total distortion. An Nbest determination unit obtains N best paths that can minimize the distortion using the A* search algorithm, and a registration unit determination unit selects a synthesis unit to be registered in a synthesis unit inventory on the basis of the N best paths in the order of frequencies of occurrence, and registers it in the synthesis unit inventory.

A method includes receiving a text description of a system capability request, and converting the text description into a normalized description of the system capability request. A repository is then queried, based on the normalized description and using a search algorithm, to identify multiple candidate application software units (ASUs). The candidate ASUs are displayed to a user for selection. The user-selected ASU is then deployed, either locally or to at least one remote compute device, in response to receiving the user selection. Deployment can include the user-selected candidate ASU being integrated into a local or remote software package, thus defining a modified software package that is configured to provide the system capability.

A playlist of multimedia content is generated based on the results of a search algorithm operating on a metadata database connected to a network. The search algorithm utilizes a search vector that is generated using demographic data and consumer profile data, and/or based on a consumer search request. The playlist, which can list heterogeneous titles of multimedia content, may be accessed anywhere on the network by any suitable authorized device.

The invention discloses an unmanned path planning method, a system and a device thereof. The method comprises the following steps: acquiring environment perception information and vehicle positioningand navigation information, wherein the environment perception information contains barrier information, curb information and lane line information, and the vehicle positioning and navigation information contains vehicle pose and a target path; conducting subpath generation according to the environment perception information and the vehicle positioning and navigation information to obtain a candidate subpath which satisfies vehicle constraints; conducting collision detection on the candidate subpath which satisfies vehicle constraints, so as to obtain a collisionless candidate subpath; conducting subpath search on the collisionless candidate subpath by A* search algorithm; and obtaining a vehicle local path according to the subpath search result. The requirement on storage space is low, and the requirement on nonholonomic constraints of vehicles can be met. The method of the invention has advantages of good adaptability and good extensibility, and can be widely applied in the field ofautomatic drive.

The method uses an HTML table cell sizing method designed to measure and layout horizontal HTML table cell elements, and implements a logical view and a search algorithm to layout table cells with the vertical character flow property. The method is also readily adaptable to layout other HTML elements with the vertical character flow property.

A computer-readable medium including computer-readable information thereon including instructions providing a method for refining a search algorithm is provided, the method comprising displaying a document, displaying at least one metadata about the search result, receiving instructions about a selection of at least one of the metadata; and modifying a search algorithm by including the selected metadata in the search algorithm. The method can be applied to internet pages based on met tags. A method for linking documents to an object is also provided. A system and interface for carrying same is also provided herein.

A method for generating a title report for a target real estate parcel includes the steps of gathering data records pertaining to real estate parcels from a plurality of disparate sources, storing the gathered data records in a common format within a computer database, indexing the commonly formatted data records within the computer database to facilitate searching, searching the indexed data records within the computer database for data records pertaining to a target real estate parcel, selecting at least one record of data pertaining to the target real estate parcel, electronically abstracting pre-selected data directly into an associated file while simultaneously viewing said record and generating a title report containing the pre-selected data in a predefined format. A system for generating a title report for a target real estate parcel includes a computer database containing data records from a plurality of disparate sources, wherein the data records pertain to real estate parcels and are commonly formatted within the database. The system further includes a search algorithm for searching the computer database for data records pertaining to a target real estate parcel and a report building algorithm for electronically abstracting pre-selected data directly into an associated file and generating a title report containing said pre-selected data.

A method for ascertaining and/or evaluating the fill-state of a container filled with at least one medium, wherein high-frequency, electromagnetic, measuring signals are emitted by a fill-level measuring device and received back as wanted echos reflected at an interface of the media. The electromagnetic, measuring signals are received back as an end echo reflected at a measuring range end, wherein, from the received wanted echos and the end echo, an echo curve is formed as a function of travel-time and/or the travel-distance, wherein, by means of a search algorithm integrated in the fill-level measuring device, number, existence and/or position of individual wanted echos and of the end echo in the echo curve are/is ascertained and applied for classifying the currently present fill-state in the container relative to predetermined, stored, fill situations in the container. On the basis of the classified fill situation in the container, with a distance value of the fill-level and/or a distance value of the separating-layer are/is associated belonging travel-times and/or belonging travel-distances of the individual wanted echos and/or end echo in the echo curve.

A system, method and program product for evaluating search algorithms. A method is provided that includes: defining a population of searches and database records from a search history database; applying a sampling method and direct sampling rates to each search/record pair in the population using a computing system, wherein search/record pairs having a higher variability relative to the population are assigned a relatively higher probability; randomly sampling a direct sample of search/record pairs with the computing system using the direct sampling rates to increase a likelihood of obtaining search/record pairs having the higher variability; running a search algorithm and measuring errors for the direct sample and/or for an associated indirect sample; and calculating an estimated error rate for the search algorithm using inverse probability weighting.

The invention relates to an unmanned aerial vehicle route planning method based on a Dubins route and sparse A* searching (the method is called a Dubins-SAS route planning method for short), and belongs to the technical field of route autonomous planning. According to the method, the Dubins route and a sparse A* searching algorithm are combined, Dubins route length is used as a heuristic function of the sparse A* searching algorithm, the heuristic function is used for searching a space for nodes, and unmanned aerial vehicle route planning is achieved. The distance between the nodes can be estimated accurately, the accuracy of the heuristic function (also called heuristic function cost) is improved, the number of the nodes needed for expanding for completing route searching can be reduced, then route planning time is shortened, and unmanned aerial vehicle route planning efficiency is improved.

The invention discloses a mixed path planning method and system based on a grid map. The method comprises steps of according to an original grid map model, using a searchable neighborhood in the A*searching algorithm to acquire local obstacle potential field function of idle grid nodes; according to the obtained local obstacle potential field function, acquiring a cost function; using the A*searching algorithm to process the original grid map model so as to obtain passing cost of all target grid nodes; successively adding 0,1 to a weight factor mu and repeating above steps until the value of the mu is 10; finding a weight factor mu corresponding to the minimum value from the obtained passing cost; connecting all the corresponding target grid nodes to form a global passing cost smallest path; extracting all turning points in the global passing cost smallest path to serve as local target points; using the DWA algorithm to process the local target points; and connecting the processed results to form a local track meeting the global optimum.

The invention discloses a mobile robot route planning method based on a distance grid map. The mobile robot route planning method includes selecting front grids by a moving window method in the process of moving of a robot, updating the distance grid map, managing the front grids to be updated by an array management method during updating, and updating a control model of the mobile robot by an A*search algorithm in the mobile robot route planning method based on the distance grid map. The mobile robot route planning method based on the distance grid map is of great fundamental significance in high-ranking tasks like generating topological maps and planning a route in the unknown environment.

The invention discloses a multi-target distribution and flight path planning method for multiple rescue helicopters, which relates to the technical field of aviation emergency rescue. The method comprises the steps of evaluating aviation rescue task execution feasibility, conducting disaster area map image processing, obtaining a feasibility matrix through the evaluation of the rescue task execution feasibility, taking the feasibility matrix as a coefficient matrix for a solution matrix Xij, solving distribution results according to tasks of different quantities of the rescue helicopters and target points through a Hungary algorithm, obtaining a flight path solution space by extracting a safety zone topological structure by adopting an image processing method and morphological characteristics, obtaining the shortest path in the flight path solution space by a heuristic A* search algorithm, combining the results of multi-target distribution for multiple rescue helicopters, forming an emergency plan for rescue task execution of the helicopters, and calling a Google Earth flight simulation API (Application Program Interface) to demonstrate the emergency rescue plan and making preflight preparation, so as to improve the efficiency and safety of the aviation emergency rescue. The method is simple, the time complexity is low, the flight path planning process is visual, and the result is distinct.

Adaptive out-of-service search behavior by a wireless user equipment (UE) device. The UE may perform cellular communications according to a radio access technology (RAT). It may be determined that cellular service according to the RAT is not available. A search algorithm may be selected from at least two possible search algorithms. A search for cellular service according to the RAT may be performed according to the search algorithm. The various possible search algorithms may specify different ratios of time spent scanning for cellular service to time spent sleeping. The selected search algorithm may be chosen based on any or all of an estimated remaining battery life of the UE, a user activity level, user input, or various other considerations.

Disclosed are apparatus and methods for verifying the ranking of search results, produced by a search algorithm executed for a particular search term. In certain embodiments, a plurality of users' knowledge and/or interest in specific categories are ranked to be used to calculate new rankings of search results, e.g., web pages based on search terms. Users may also be ranked by education level and field. These user rankings are then used to determine a new ranking of search results that are generated for a particular search term. For instance, the users that select (e.g., or click on) a particular search result cause a relevance score to be compiled based on such users' rankings in the categories to which the search results or search term belongs. Relevance scores are compiled for each search result that is selected by a plurality of users executing a plurality of searches. The new ranking of the search results for a particular search term is determined based on the relevance scores of such search results. It can then be determined whether the current ranking, produced for a particular search term by the search algorithm, is valid by comparing this new ranking to the current ranking.

The invention provides a method and a device for identifying a Chinese and English speech signal. The method mainly comprises the following steps of: carrying out feature extraction on a Chinese and English speech signal to be identified by a searching algorithm to acquire the feature information of the speech signal to be identified; and comparing the feature information with an acoustic model corresponding to each phoneme sequence in a mixed speech database, determining a phoneme sequence corresponding to the feature information based on the comparative result, and acquiring a Chinese and English mixed phrase corresponding to the phoneme sequence, wherein the Chinese and English mixed phrase is taken as an identification result of the Chinese and English speech signal to be identified. The invention can establish the acoustic model with less confusion, and does not need a large amount of labeled speech training data, thereby saving system resources. The invention can effectively raise the identification rate of the Chinese and English speech signal.

Embodiments of the present invention relate to a virtual machine integration technology, and in particular, to a method, an apparatus, and a system for virtual cluster integration. The method includes: performing a calculation through a search algorithm to obtain the minimum number of physical machines which are capable of accommodating all virtual machines in a virtual cluster, and obtaining all virtual integration solutions satisfying the minimum number of physical machines; then calculating CPU voltage consumption of each virtual integration solution, and selecting a solution with lowest CPU voltage consumption from these virtual integration solutions; and formulating a virtual integration migration policy according to the virtual integration solution with the lowest CPU voltage consumption. Therefore, through the embodiments of the present invention, a virtual integration solution with lower CPU voltage energy consumption can be obtained, thereby greatly improving an energy saving and emission reduction effect of a virtual cluster integration solution.