International Business Machines Corporation

Philippe Laborie

Paul Shaw

Olivier Oudot

Olivier M D Lhomme

This invention relates to a system, method and computer program product for determining which anytime technique is the most efficient at solving an anytime problem using a first anytime technique and a second anytime technique to determine a first and a second plurality of solutions, respectively, wherein each of the first and the second the plurality of solutions includes a value and an associated computation time, respectively, and each of the first and the second plurality solutions including a minimized value and associated computation time, respectively. Determining a set of delta value ordinates and computation time ordinates. Determining a representative value ordinate and representative computation time ordinate. Determining an efficient anytime technique.

Performance comparison for determining a travel path for a robot

According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log(n) added constraints.

Growing community of inventors

L'Hay-les-Roses, France

Philippe Laborie