3 results about "Partial solution" patented technology

A method, computer system, and a computer program product for model evaluation is provided. The present invention may include generating, by a first model, a first tree of thoughts for evaluating capabilities of second model that answers a user query, wherein the first tree of thoughts includes a plurality of nodes, each node of which indicates a solution to a task among a plurality of tasks for the evaluating. The present invention may include outputting an evaluation report based on at least part of solutions corresponding to the plurality of nodes.

This invention discloses a robot smooth path planning method based on an improved Harris Eagle optimization algorithm. The improved Harris Eagle algorithm optimizes the position of control points on a Bezier curve to find the shortest and smoothest path. The improved Harris Eagle algorithm introduces the concept of spiral search to improve the early update strategy, increase population diversity, and enhance the algorithm's global search capability. Sine chaotic mapping is used to improve the escape energy E, better balancing global search and local exploitation. An elite differential mutation strategy is used to mutate and recombine partial solutions in the search space, improving the algorithm's ability to escape local optima. Simulation experiments were conducted on two different grid maps. Simulation data demonstrate that this invention can more accurately find the collision-free shortest path, and the path curvature and its derivative are sufficiently small, satisfying the smoothness requirements of higher-order continuity.

A computer-implemented method for optimizing the disposition of items in one or more locations of a physical environment is provided. The method comprises: providing (132) a plurality of available locations in which items can be disposed; providing (131) a plurality of items to be located; defining (141) a problem associated to a WOP for storing as many items as possible at ground level, said problem being defined as a constrained quadratic model problem (CQM problem) to decide the location l in which each item i should be stored; solving (143) the CQM model problem by maximizing the amount of items i stored at the ground level of the available set of locations, thus obtaining partial solutions; completing (145) each partial solution (144) by stacking, if required, all items that have been left unstacked; eliminating (149) repeated and unfeasible solutions, thus obtaining a set of N feasible solutions to the WOP; selecting (16) one or more initial solutions of the N feasible solutions and optimizing (18) them, providing a most optimal one; wherein solving (143) the CQM problem is done at least partially in a quantum computer.