8 results about "Path cost" patented technology

The application provides a multi-target waypoint planning method and system fusing an improved A* algorithm and an SPFA algorithm, and the method mainly comprises the following steps: a mobile navigator rasterizes the surrounding environment, and calibrates a target point set and a starting point of the navigator to simulate a task scene; a distance value calculation of the starting point to the target point is performed through construction of the improved A* algorithm; a negative edge weight map with point priority, direction and without negative loop is established through fusion of the improved A* algorithm and the SPFA algorithm, and the best waypoint order can be obtained according to the point priority in the negative edge weight map; the navigator moves according to the waypoint order to traverse the task target points, and global path planning and local path planning algorithms are realized. Through the application, a large number of path points and inflection points are reduced, the total path length is shortened, the total path cost is reduced, the overall efficiency is improved, and a reasonable and fast feasible path is planned in a multi-target waypoint task in a complex environment.

This invention provides a delivery route scheduling optimization method, system, and storage medium based on spatial indexing. The method divides the delivery geographic space into spatial partitions using a spatial index structure and records order ownership relationships. It utilizes spatial filling curves to perform one-dimensional dimensionality reduction mapping on pick-up and delivery locations to generate one-dimensional sorting codes, which are then arranged in ascending order to obtain an order sequence with spatial proximity clustering characteristics. Constrained by rider load capacity, consecutive orders are extracted along the order sequence to form candidate order combination combinations. The travel cost of these candidate combination combinations is estimated segment by segment using the spatial index structure, and the cyclic path cost is accumulated according to the access order. The cyclic path costs of all candidate combination combinations are compared, and the one with the lowest cost is selected as the scheduling execution result. Rider assignment information and pick-up / delivery order suggestions are output. This method effectively reduces the computational complexity of delivery route planning and improves the spatial rationality and route economy of order combination.

The application discloses a multi-modal freight transport path optimization method driven by endogenous congestion and multi-dimensional overlap, aiming to solve the technical problem that the existing model cannot simultaneously process multi-dimensional endogenous correlation such as link congestion feedback, hub transfer bottleneck, path physical overlap and mode perception similarity. The application constructs a multi-layer directed multi-modal transport network and generates a candidate path set; establishes a generalized path cost function containing road section and hub endogenous congestion; constructs a road space correlation penalty term based on shared length and a mode similarity penalty term based on hub betweenness centrality; incorporates the above elements into a multi-objective optimization framework based on maximum entropy, and converts it into an improved nested fixed point equation; uses instrumental variable substitution method to solve the endogeneity problem in parameter estimation, and obtains network equilibrium flow through iterative solution. The application breaks through the independent and irrelevant assumption of the traditional model, and significantly improves the accuracy and behavior explanation ability of freight flow prediction in a complex multi-modal transport network.

This invention discloses a trajectory planning method for an H-shaped motion platform based on the A* algorithm and fifth-order polynomial interpolation, belonging to the field of intelligent motion control technology. A two-dimensional grid map is used to model the operating environment of the H-shaped motion platform. An initial discrete path node sequence is obtained through an 8-neighborhood search using the A* algorithm. The actual path cost is calculated using Euclidean distance, and the heuristic cost is calculated using Manhattan distance, satisfying an underestimation condition to ensure the globally optimal path. The initial path node sequence is optimized and segmented. Redundant nodes are removed and key path points are extracted based on the direction vectors of adjacent three points, reducing path inflection points and improving path smoothness. A fifth-order polynomial interpolation algorithm is used, with adjacent key path points as boundaries, combined with six boundary conditions (position, velocity, acceleration) to construct the trajectory, completing the transformation from a discrete path to a smooth, continuous trajectory. This invention is suitable for precision operation scenarios such as semiconductor processing, panel inspection, and laser cutting, and has good engineering application value.

This invention discloses a path planning method for unmanned aerial vehicles (UAVs) in confined environments based on the BAT-RRT* (Bi-directional Adaptive Tangential RRT*) algorithm. The method acquires environmental data and establishes a 3D environment model including narrow passages and non-convex obstacles. It constructs a path cost evaluation function for the UAV and solves the evaluation function based on the BAT-RRT* algorithm to obtain the optimal and smooth path planning result. Firstly, this invention employs an adaptive flat corridor sampling mechanism for topology awareness and dynamic sampling, which actively conforms to the direction of the narrow passage, fundamentally solving the problem of narrow passage crossing from a probabilistic perspective. Secondly, it introduces a cascaded decision-making and fluid dynamics-inspired tangential gliding field, breaking the force balance of the traditional potential field at the saddle point and guiding the random tree to achieve agile wall-attaching and bypassing, effectively avoiding local minima and suppressing potential field oscillations. Finally, it combines subtree cost propagation and smoothing algorithms to correct the lag in cost updates and ensure the asymptotic optimality and continuity of the trajectory.

This invention discloses a cost optimization method for implementing net-zero carbon emissions in canals, relating to the field of canal construction and operation technology. It addresses the problem that existing technologies offer numerous options but lack a unified cost decision-making framework, preventing the achievement of global optimization. First, this invention obtains four types of basic parameters, transforming different technologies into quantifiable decision variables, providing a unified cost measurement benchmark for heterogeneous technologies and solving the problem of incomparability between technical solutions. Second, it sets an objective function, focusing on minimizing net present value, integrating investment, operation and maintenance, fuel, carbon costs and subsidies, and carbon revenue, achieving dynamic accounting of the entire life-cycle cost. Finally, by combining constraints and using algorithms, it automatically finds the equilibrium point between the marginal emission reduction cost and the carbon shadow price of each technology, controlling the overall cost within a preset range and preventing nonlinear runaway marginal costs, thus realizing the transformation from experience-based judgment to data-driven decision-making.

This invention proposes an efficient K-short path calculation method and system for dynamic road networks, relating to the field of path planning technology. It involves obtaining multiple OD pairs from a directed graph of the road network, constructing a list, and initializing it. For each OD pair, a shortest path is calculated, and a set of deviation paths is constructed based on the shortest path. The shortest path and the set of deviation paths are stored as an initial K-short path set. When the edge weights of the road network structure are adjusted, potentially affected OD pairs are screened based on the changed edge attributes and the initial K-short path set. The initial K-short paths from the potentially affected OD pairs are obtained, and a substantial impact test is performed: if an initial K-short path does not contain any changed edges, and its path cost is less than the total cost of potential new paths constructed from the changed edges, then the path is retained; otherwise, the path is deleted. New paths are supplemented based on the set of deviation paths until K shortest paths are satisfied, thereby significantly reducing computational complexity and improving the efficiency and accuracy of path updates in dynamic scenarios.