96 results about "A* search algorithm" patented technology

The invention discloses a document generation system and method based on multi-agent collaboration, and the method comprises the steps: understanding and extracting the high-level semantic information of a text input by a user, and dynamically generating a problem to guide the user to define a demand, so as to form a detailed document demand; recognizing the theme and key elements of the document from the detailed document requirements; the optimal sequence of task execution is determined based on a shortest path algorithm, potential conflicts in task execution are predicted and solved through parallel processing and a search algorithm, and optimized task planning is formed through feedback circulation; generating a document outline according to user requirements, retrieving associated contents of document chapters so as to write chapter contents, and performing grammar and format verification to form a preliminary document; defining a document quality evaluation index according to user requirements and industry standards, performing document quality evaluation on the preliminary document, and feeding back the document quality evaluation result to the user; and generating a complete final document and presenting the complete final document to the user. According to the invention, the document generation quality is improved.

The invention relates to the technical field of laser spectrum gas detection, and particularly discloses a TDLAS (tunable diode laser absorption spectroscopy) double-gas concentration synchronous calibration and decoupling method in the presence of spectrum aliasing interference, and the method comprises the following steps: acquiring a multi-band harmonic signal subjected to adaptive optimization while acquiring environmental parameters; an optimal frequency band signal is determined based on the signal quality index; and calculating a spectral aliasing coefficient according to the characteristics of the optimal frequency band signal, dynamically adjusting operation parameters of a search algorithm based on a numerical value interval in which the spectral aliasing coefficient is located, and determining an initial range of dual-gas concentration in a search space. According to the method, the improved genetic algorithm based on the spectral aliasing coefficient dynamic adjustment search strategy is combined with the incremental support vector regression model, stage processing from coarse calibration to fine decoupling is achieved, and the calculation efficiency and the search precision can be automatically balanced when the spectral aliasing degree changes; and online correction is carried out on the model in combination with aging characteristics.

The invention relates to the technical field of automatic driving, and discloses a tramcar path planning method, device and equipment based on a reference line and a storage medium. According to the method, an improved A * search algorithm is combined with reference line discretization and smoothing processing, the node expansion number is reduced, the path smoothness is optimized, and the tramcar path planning efficiency is improved. Meanwhile, a double-factor heuristic function and dynamic constraint verification are utilized to ensure that the path is safe and feasible, and the method has the advantages of improving path planning efficiency, reducing path fluctuation, meeting special terrain and dynamic constraint requirements of a mining area and ensuring that the mine car stably travels along a predetermined reference line.

The invention relates to the technical field of service scheduling, and discloses a dynamic rule engine and state tracking service request automatic scheduling processing system. According to the system, scheduling is realized through a five-stage processing chain of request intake, state acquisition, rule fusion, decision generation and execution monitoring which are connected in sequence. The request intake stage captures a service request stream and generates a request feature topology; in the state acquisition stage, resource operation data is acquired in real time, and a state multi-dimensional map is constructed; in the rule fusion stage, time-space alignment is carried out on the two, and scheduling fitness is output through rule reasoning; in the decision generation stage, based on the scheduling fitness, a search algorithm is adopted to generate a scheduling command sequence; and tracking an execution result in the execution monitoring stage, calculating a scheduling deviation value and feeding back the scheduling deviation value to the request intake stage, and adjusting a feature topology generation parameter. According to the system, a closed-loop scheduling mechanism is formed, the dynamic adaptation of the service request and the resource state is realized, and the flexibility and pertinence of scheduling processing are improved.

The invention belongs to the technical field of fan arrangement, and discloses a fan point location automatic arrangement method and system based on artificial intelligence, and the method comprises the steps: firstly receiving a plurality of spatial constraint layers and deployment parameters, and unifying the coordinates; a conflict relation graph is constructed based on the processed constraint layers, nodes of the graph are different constraint layers, and edges are conflict strength among constraints; inputting the map into a pre-training map attention network, and reasoning to obtain a conflict slow-release factor which quantifies a constraint relaxation degree; then the factors are fed back to a point location search algorithm, and candidate point locations are evaluated by using a scoring function of the fusion factors; and finally, outputting a final arrangement scheme according to a scoring result. According to the method, through artificial intelligence middleware, such as a graph attention network, an artificial intelligence-based search algorithm and the like, the problem of excessive region deletion of a traditional method is solved, and the area and arrangement reasonability of a deployable region are improved.

The invention relates to the technical field of tunnel construction geological disaster early warning, and discloses a tunnel construction geological disaster early warning method and system. According to the method, multi-source geological monitoring data and environment dynamic parameters of a tunnel construction area are collected; and then through data fusion and feature engineering processing, data contradiction and redundancy are eliminated, and a standardized training data set is formed. And then training and verifying a disaster risk prediction model by using the data set and adopting a machine learning algorithm so as to obtain an optimized model to accurately predict the disaster risk. And performing risk value prediction on different geological structure units by applying the optimization model, generating a risk distribution map, and determining an optimal geological structure unit through a search algorithm. Based on this, numerical simulation of geological disaster triggering and propagation is executed, a disaster evolution rule is analyzed, and a path simulation data set is output. And finally, performing multi-objective optimization on the data set according to a safety early warning objective, generating a geological disaster early warning scheme, and performing iterative calibration.

The invention discloses an aircraft taxiing path automatic generation method and system, and the method comprises the steps: obtaining airport GIS map data, and constructing a taxiway hierarchy graph based on an H3 space grid; after an instruction containing a sliding path name sequence is received, the instruction is automatically integrated with machine position and target point information and mapped into starting and ending nodes in a graph structure; and furthermore, a search algorithm combining path name matching and turning angle punishment is executed in the graph, and a continuous and reasonable optimal geometric sliding path is automatically generated. According to the method, full-automatic mapping from a text instruction to a standardized geometric path is realized, the defects of dependence on manpower, low efficiency and high error rate in the prior art are overcome, and the intelligent level and operation safety of airport ground sliding guidance are remarkably improved.

The invention discloses an intelligent adaptive personalized learning method and system based on AIGC and a knowledge graph. The technical problems that an existing online learning system is low in individuation degree, a knowledge system is fragmented, the evaluation dimension is single, the adaptive capacity is weak, and different requirements of teachers and students are not distinguished are solved. The method comprises the following steps: constructing and updating a domain knowledge graph library with weights, establishing a self-adaptive course resource library associated with knowledge entities, respectively generating multi-dimensional portraits of teachers and students, generating differentiated personalized learning / teaching paths based on an A * search algorithm, and realizing self-adaptive content recommendation, continuous self-adaptive evaluation and dynamic adjustment through a mixed recommendation algorithm. A closed-loop intelligent ecology is formed; the corresponding system comprises core modules such as a knowledge graph library, a self-adaptive course resource library and a teacher and student portrait module. According to the method, all-dimensional personalized support of teachers and students, dynamic self-adaptive adjustment and resource generation according to needs are realized, the teaching and learning efficiency is remarkably improved, and the method is suitable for practical subjects and has system self-evolution ability.

The invention discloses an evolved memory system and interaction method for a universal virtual agent in a GUI (Graphical User Interface) environment, and the system integrates sub-task nodes after decomposition of various tasks and the dependency relationship thereof by constructing a global memory graph, forms a memory graph, and generates a feasible GUI operation sequence by adopting a search algorithm based on the graph. And abstracting the sequence into a transferable guide rule by means of a large language model. When the task is executed, the matching rule and the subtask nodes are retrieved through semantic and structure mixing, the agent decision is assisted, the memory graph is updated after successful execution, and continuous evolution is achieved. When the system is practically applied, the intelligent agent can be driven to execute a GUI task through a natural language instruction, the intelligent agent generates an operation action by utilizing a rule and a retrieval mechanism in the memory graph, interacts with an interface to complete the task, and feeds back an interaction track which is successfully executed to the system, so that the structure of the memory graph is continuously optimized.

The invention discloses a method and system for cooperatively chasing a moving target by an unmanned surface vehicle cluster in an obstacle environment, and relates to the technical field of unmanned surface vehicles, and the method comprises the steps: obtaining the surrounding environment related information of the unmanned surface vehicles, carrying out the fusion processing of the surrounding environment related information of the unmanned surface vehicles, and obtaining the global environment information of a whole chasing region; based on the global environment information of the whole chasing area, adopting an algorithm to track and predict the position and the motion state of the moving target in real time to obtain the motion trail of the moving target in a future period of time, and based on the global environment information of the whole chasing area and the motion trail of the moving target in the future period of time, adopting a search algorithm to search the moving target in the future period of time; generating a chasing path of the unmanned ship; the tracking task is generated based on the tracking path of the unmanned ship, the related data of the unmanned ship is acquired, the tracking task is allocated based on the related data of the unmanned ship, the unmanned ship tracks the moving target based on the tracking task, and the tracking efficiency and success rate of the unmanned ship cluster in a complex environment can be improved.

The invention discloses a parking path planning method and related equipment, and relates to the technical field of vehicle control, and the method comprises the steps: obtaining environment information of a target parking space and a parking starting point and a parking terminal point of a vehicle; constructing a grid map corresponding to the environment information; executing a mixed A * search algorithm in the grid map, performing node expansion on the parking starting point to form a grid index sequence, and storing node state information in the node expansion process in a data chain table according to a grid index corresponding to the node state information; and generating a target parking path from the parking starting point to the parking ending point based on the grid index sequence. According to the method, a node expansion and index linked list management mechanism based on mixed A * is introduced into the grid map, the feasible node state is completely reserved on the premise of meeting the vehicle motion constraint, the continuous, reliable and high-performability parking path can be generated, and the stability and success rate of parking path planning are improved.

The invention provides a composite material fan blade cold state blade profile parallel extraction method and device. The method comprises the following steps: S1, inputting a guide node and a cold state finite element model surface unit; s2, according to the number of the guide nodes, determining the number of parallel computing cores, equally dividing the guide nodes, and sending the equally divided guide nodes and surface nodes to each sub-process by the host process; s3, executing a search algorithm by each sub-process, and determining all nodes of a cross section where each guide node is located; and S4, each sub-process sends the node of each section of the sub-process to the host process, and the host process outputs a cold-state leaf profile according to the sections after merging. According to the cold-state leaf profile parallel extraction method and device, cold-state leaf profile extraction can be automatically executed, the calculation efficiency is improved, the error probability is reduced, and the design efficiency is improved.

This invention discloses a method, apparatus, medium, and device for parameter optimization of analog circuits, relating to the field of analog circuit technology. The invention automatically identifies current paths through a search algorithm to deeply analyze the circuit topology, determine the symmetry structure in the analog circuit, and constructs symmetry constraints based on the identical optimization parameters of electrical components within the symmetry structure. Simultaneously, it transforms the product of the transistor's gate width and the number of parallel connections into the total width and sets the optimization boundary. This combination reduces the dimensionality of the optimization variables while ensuring that the parameter optimization process conforms to the layout design of the analog circuit. Furthermore, it combines a population mutation algorithm and a non-dominated sorting genetic algorithm with an elitist strategy to perform iterative optimization within the constructed efficient search space, significantly improving the convergence speed of analog circuit parameter optimization, reducing computational costs, and enhancing the practicality of the analog circuit parameter optimization method.

The application discloses an automatic generation method and system of an aircraft taxiway, which comprises the following steps: acquiring airport GIS map data, and constructing a taxiway hierarchical graph based on an H3 spatial grid; after receiving an instruction containing a taxiway name sequence, automatically integrating the instruction with gate and target point information, and mapping starting and ending nodes in a graph structure; and then, automatically generating a continuous and reasonable optimal geometric taxiway by executing a search algorithm combining path name matching and turning angle punishment in the graph. The application realizes automatic mapping from a text instruction to a standardized geometric path, overcomes the defects of the prior art, such as dependence on manual operation, low efficiency and error-prone, and significantly improves the intelligent level and operation safety of airport ground taxiway guidance.

The invention discloses an SQL (Structured Query Language) fuzzy test case generation method based on dynamic metadata dependence. The method comprises the following steps: firstly, extracting structural metadata from a database system directory in a dynamic introspection manner during operation to construct a base layer of a hierarchical semantic model, and initializing an enhancement layer of the hierarchical semantic model for storing explicit semantic rules and implicit semantic rules learned during operation; secondly, converting the structural metadata into a semantic dependency graph to describe a semantic relationship; in the test case generation stage, ANTLR is adopted to analyze SQL and mutate SQL intermediate representation, a semantic dependency graph is utilized to analyze semantic requests and detect conflicts, and restored semantic effective queries are automatically generated through a search algorithm. In the execution stage, the next round of SQL generation is guided according to operation feedback. Through the dynamic metadata extraction and runtime learning mechanism, the semantic validity of the SQL test case and the database defect discovery efficiency are effectively improved.

Disclosed are systems and methods for enhancing local node performance in a storage system through offloading cache replacement tasks to remote nodes. A periodic time-series analysis of CPU cycle utilization and network latency is conducted on one or more arrays to identify and / or forecast underutilized nodes in the one or more arrays. A first array detects a shortage of available cache slots in an allocation queue and identifies underutilized remote nodes in either its own array or another array. The array shares the metadata pages with the remote node. A worker thread on the remote node runs a search algorithm on the received meta data pages and creates a list of candidate replacement memory slots.

A method, apparatus and product comprising: obtaining alternative quantum circuits implementing a quantum program, each having a respective design error; identifying, for each quantum circuit, respective quantum resources that are used by the quantum circuit and are associated with respective hardware errors of a quantum computer; determining a total hardware error bound for the quantum circuit; determining a total error bound for the quantum circuit; applying a search algorithm over a plurality of total error bounds of the plurality of alternative quantum circuits, to identify an optimal total error bound that is associated with an optimal quantum circuit; and providing the optimal quantum circuit for execution on the quantum computer.

The invention provides an unmanned aerial vehicle multi-mode topological map navigation method based on language guidance. The unmanned aerial vehicle multi-mode topological map navigation method comprises the steps that a multi-frame image sequence and a natural language task instruction in the flight process of an unmanned aerial vehicle are obtained; based on the natural language task instruction, extracting a semantic key frame from the multi-frame image sequence; based on the semantic key frame, constructing a topological node representing image, language and spatial information; based on the topological node, determining a topological edge of semantic space joint constraint; and on a semantic space topological graph, the optimal path of the unmanned aerial vehicle is determined by adopting a search algorithm, and the semantic space topological graph is constructed by topological nodes and topological edges. According to the invention, the unmanned aerial vehicle can autonomously construct the semantic map in an unknown environment and complete effective navigation according to the language instruction.

The invention provides a data processing method which can be applied to the technical field of big data and the technical field of financial science and technology. The data processing method comprises the steps that in response to a received query statement for a database, an index search tree corresponding to the database is obtained, the index search tree is pre-constructed based on a data table field of the database and a preset action space, and all nodes of the index search tree represent corresponding index configurations; the index configuration at least comprises a single-column index or a multi-column index; a target index combination is obtained based on the index search tree, the target index combination is obtained by searching the index search tree in advance based on a search algorithm and calculating node revenue, the node revenue is determined based on a cost estimation model, and a target execution plan of the query statement is determined based on the query statement and the target index combination. The invention further provides a data processing device, equipment, a medium and a program product.

The invention provides a multi-granularity code clone detection method based on clustering search and a large model, and belongs to the technical field of code clone detection. Comprising the steps that an MGCD analyzes a code library to generate a vector database, and each vector represents a function-level code snippet; the code to be detected is analyzed, and the MGCD identifies function clone candidate items in a database by using a search algorithm; an automatic heuristic method is used as a filter to obtain a highly correlated and accurate function-level result; and the MGCD realizes multi-granularity clone detection. According to the method, the semantic clone recognition capability is remarkably enhanced, and complex code snippets with similar semantics are effectively detected. The clustering algorithm improves the retrieval efficiency in a large-scale code library and reduces the calculation cost. The multi-granularity code clone detection is supported, multiple levels such as a function level, a module level and a project level are covered, a more comprehensive and multi-dimensional code similarity analysis result is provided for a user, the detection efficiency is improved, and the flexibility and expansibility of the system are enhanced.

The invention relates to the technical field of data processing, in particular to a path traffic estimation method, a computer system and a computer readable storage medium. A fusion strategy of a K shortest path algorithm and an A * search algorithm is introduced to screen and complement candidate paths, a candidate path set is generated, and particle weight updating is performed based on three dimensions of travel time consistency, path consistency and detector testability so as to guide the candidate path set to evolve towards a better and more feasible direction; dual prior information of tensor solution and particle reconstruction is introduced, a joint least square problem of path flow estimation is constructed, and a stable solution can be kept under the condition that steering flow or path observation is incomplete. The objective of the invention is to solve the problem of how to realize accurate path flow estimation in a scene covered by a low mobile detector.

The invention relates to a vehicle (1) that is at least partially automated, comprising a computing unit (3) for determining an optimal route between a starting node and a destination node using an A* search algorithm for cost determination based on a plurality of distance-based costs.In a vehicle that significantly reduces the computational effort required to plan an optimal route for at least partially automated driving, the computing unit (3) for planning a trajectory of the vehicle (1) using a modified A* search algorithm comprises an analysis unit (5) which evaluates characteristic parameters of the vehicle (1) at predecessor nodes from a trajectory history, which characterize dynamic influences, and a trajectory determination unit (7) which, together with the distance-based costs, evaluates the costs caused by the dynamic influences of the vehicle (1). The computing unit (3) is designed to control actuators (9) for longitudinal and lateral control of the vehicle (1) such that the vehicle (1) follows the trajectory determined by the modified A* search algorithm.

A mobile vision transformer network for use on mobile devices, such as smart eyewear devices and other augmented reality (AR) and virtual reality (VR) devices. The mobile vision transformer network considers factors including number of parameters, latency, and model performance, as they reflect disk storage, mobile frames per second (FPS), and application quality, respectively. The mobile vision transformer network processes images, e.g., for image classification, segmentation, and detection. The mobile vision transformer network has a fine-grained architecture including a search algorithm performing latency-driven slimming that jointly improves model size and speed.

The application discloses a method for mapping avionics resident applications to physical resources based on a heuristic algorithm, and comprises the following steps: step one, modeling the mapping of resident applications to physical resources; step two, taking application features and constraint conditions as inputs of the model, sampling mapping schemes in a mapping space formed by all possible application mapping schemes by using a search algorithm, and evaluating the mapping schemes; repeating the sampling and evaluation until a scheduled sampling number is reached, and taking the best mapping scheme obtained as an output; and step three, mapping the resident applications to the physical resources according to the best mapping scheme; wherein the search algorithm adopts a hybrid search algorithm combining exact solution and heuristic search, the hybrid search algorithm firstly obtains a group of feasible solutions with better performance in a short time through the heuristic search algorithm, and then takes the feasible solutions as initial values and upper bounds during solving by a solver, so that most solutions with poor performance are filtered and the solving efficiency is improved.

The invention relates to the technical field of task scheduling, in particular to a store patrol task dynamic allocation method based on load balancing. Comprising the steps of generating a task vector through a shop patrol task processing request; generating a node load vector through the mobile terminal state data; constructing a directed attribute graph, calculating transfer parameters, generating a space transfer matrix, and constructing a feature tensor; inputting the feature tensor into an evaluation network for processing, and outputting a score matrix; outputting candidate sites through a search algorithm; calculating a load variance variable quantity and an out-of-limit probability according to the candidate sites; inputting the load variance variable quantity and the out-of-limit probability into a multi-objective optimization function for calculation, and outputting a distribution strategy; and analyzing the distribution strategy, and generating a scheduling instruction containing a node routing sequence. According to the method, chain structured fusion is carried out through probability deduction of high-dimensional data, search pruning of physical boundaries and multi-target game of global dimensions, and long-term stability and dynamic balance of cluster load distribution are facilitated.

The invention relates to a method and system for identifying a conducted flow path in an anatomical map. A method includes receiving an anatomical map of wall tissue of at least a portion of a heart chamber, the map superimposed with an ablation tag. For at least some of the ablation tags, a non-conductive region is defined around each ablation tag to calculate a retardation region. Start and end point indicia of the potential conduction flow on the map are received from the user. Using a search algorithm, one or more possible conduction flow paths from the start point to the end point are searched, the one or more existing paths taking into account the retardation region. One or more flow paths found by the search algorithm are superimposed on the anatomical map. The superimposed anatomical map is presented to a user.

The invention discloses an efficient flexible molecular docking method and device based on PyTorch, and belongs to the technical field of artificial intelligence drug discovery. The docking method comprises the following steps: loading configuration parameters, and setting a computing device; analyzing the ligand file and the protein file to obtain ligand and protein data; creating a Vina scoring model and a transformation module, and initializing a search algorithm; the method comprises the following steps: generating initial conformation parameters based on an initialized search algorithm in combination with ligand and protein data, performing gradient descent optimization based on a Vina scoring model and a transformation module, generating a plurality of optimized ligand conformation coordinates, protein flexible residue coordinates and corresponding energy scores, and constructing a candidate conformation set; and calculating RMSD among conformations in the candidate conformation set, filtering redundant conformations, selecting an optimal conformation set, storing a PDBQT file of the optimal conformation, recording corresponding energy scoring information, and generating a docking report. And accelerating the molecular docking process by using a PyTorch deep learning framework and the parallel computing capability of the GPU.

The invention discloses a dynamic routing and user mobility management method and system for a low-orbit satellite constellation, and belongs to the technical field of satellite communication, and the method comprises the following steps: S1, reporting the real-time state information of a feed link; s2, storing and managing the real-time state information of the feed link; s3, selecting an exit gateway station; s4, searching the shortest delay path from the entrance satellite to the exit gateway station through an improved A * search algorithm; s5, extracting key forwarding nodes, packaging the key forwarding nodes into departure and return tickets, and issuing the departure and return tickets to an exit gateway station and an entrance satellite; s6, uplink and downlink communication is carried out through the packaged departure ticket and the packaged return ticket; according to the method, the states of the inter-satellite link and the user link with high-frequency jitter are ignored, only the dynamic change of the feed link is taken as a triggering condition of path re-calculation, and due to the characteristic, the path switching frequency is reduced, so that frequent re-routing caused by jitter of a non-key link can be avoided, and the path stability and the overall robustness of the network are remarkably improved.

The invention discloses a financial complex query statement generation method based on a search algorithm and action space decomposition, and belongs to the technical field of computers. The method comprises the following steps: acquiring user query data; screening a candidate atomic function set from the atomic function library according to user query data; constructing a function combination according to the candidate atomic function set; and verifying the function combination to obtain an optimal function combination as a query statement. According to the method, through action space decomposition, the difficulty of generating complex query statements is reduced, and common cascade errors of a single-step generation model are effectively avoided by utilizing the global planning capability of Monte Carlo tree search. Compared with the background technology, experimental data shows that the method improves the accuracy and robustness of generating the complex query statement to a certain extent. And meanwhile, simulation execution and consistency verification are assisted, so that the generated function combination is ensured to be correct in grammar and parameter.

The invention is suitable for the technical field of artificial intelligence, and provides a three-dimensional real-time navigation method and device of a robot and electronic device.The method comprises the steps that according to real-time operation data of the robot, the local updating range of Octomap information of an Octomap of an operation scene corresponding to the robot based on an octree is determined, and the local updating range of the Octomap information of the operation scene corresponding to the robot is determined; the observation occupancy probability and the attenuation coefficient corresponding to each three-dimensional grid to be updated in the local updating range are obtained; updating the occupancy probability of each three-dimensional grid to be updated according to the observation occupancy probability and the attenuation coefficient corresponding to each three-dimensional grid to be updated; and according to the updated operation scene Octomap information and an A * search algorithm, determining a real-time navigation path of the robot in the local update range. Therefore, the reliability, the safety and the calculation efficiency of three-dimensional space navigation of the robot are improved.