2results about How to "Heavy calculation" patented technology

This application discloses a method and system for measuring operating condition information for vehicle energy management control. The method includes: determining the type of operating condition information; quantifying the uncertainty of static information using empirical entropy if the information is static; and measuring the information content of static information by reducing the entropy of empirical entropy; and quantifying the uncertainty of dynamic information using information entropy if the information is dynamic; and measuring the information content of dynamic information by reducing the entropy of information entropy. According to this method for measuring operating condition information for vehicle energy management control, by classifying the operating condition information and measuring static and dynamic information using empirical entropy and information entropy respectively, the operating condition information can be measured in a standardized manner.

This invention belongs to the field of path planning, specifically relating to a method for obtaining the shortest path between nodes. The method first obtains the sets of cut vertices on the original graph through several traversals, and then maps the cut vertex set subgraphs corresponding to these sets of cut vertices into a high-level tree of nodes. Preprocessing and parallel shortest path queries are then performed using the high-level tree with the cut vertex set subgraphs as the smallest unit, thereby obtaining the overall shortest path. This method transforms the shortest path analysis for a large number of nodes in a topologically complex original graph into a shortest path analysis for cut vertex sets. It eliminates a large number of useless nodes when obtaining the shortest path, saving related calculations and reducing computational load, thus improving the speed of shortest path acquisition. Furthermore, preprocessing is performed on the subgraphs formed by cut vertex sets, avoiding the computationally cumbersome problem of directly obtaining the shortest path for complex topological structures of large subgraphs.