Method and apparatus for optimization of an allocation matrix in determining solutions of the association problem in the course of tracking several moving objects
US5794173A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Oct 27, 1995 |
| Grant date | Aug 11, 1998 |
| Priority date | — |
| Expiry date | Oct 27, 2015 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG01S13/726
- WIPO fieldMeasurement
- WIPO sectorInstruments
Abstract
In optimization of combinatory optimization problems, it is possible to perform deterministic as well as more or less randomized searches. A new allocation matrix is generated, based on a more or less coincidentally selected, but valid allocation matrix. A check is made thereafter whether it constitutes a better solution than the old allocation matrix. If this is the case, this matrix is used as the new starting point for the further search. If this is not the case, the old allocation matrix is kept as the starting point for the further search. This process is continued until the time made available for the solution has expired, or until it is determined by the method itself that no better solution can be found in the course of the instantaneously realized search.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.