THE INVISIBLE HAND ALGORITHM - SOLVING THE ASSIGNMENT PROBLEM WITH STATISTICAL PHYSICS

被引:99
作者
KOSOWSKY, JJ
YUILLE, AL
机构
关键词
ASSIGNMENT PROBLEM; STATISTICAL PHYSICS; AUCTION ALGORITHM; INTERIOR POINT METHOD; OPTIMIZATION; NEURAL NETWORKS;
D O I
10.1016/0893-6080(94)90081-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
We propose a novel method for solving the assignment problem using techniques adapted from statistical physics. We derive a convex effective energy function whose unique minimum corresponds to the optimal assignment. Steepest descent results in a continuous-time dynamical system that is guaranteed to converge arbitrarily close to the optimal solution. Our algorithm has an appealing economic interpretation and has very interesting connections to the discrete auction algorithm proposed by Bertsekas. We also derive an alternative discrete algorithm for minimizing the effective energy based on a theorem by Sinkhorn.
引用
收藏
页码:477 / 490
页数:14
相关论文
共 24 条
[1]
[Anonymous], 1989, MODELING BRAIN FUNCT
[2]
Bertsekas D.P., 1989, PARALLEL DISTRIBUTED
[3]
DUAL COORDINATE STEP METHODS FOR LINEAR-NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP ;
ECKSTEIN, J .
MATHEMATICAL PROGRAMMING, 1988, 42 (02) :203-243
[4]
A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM [J].
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1981, 21 (02) :152-171
[5]
THE AUCTION ALGORITHM FOR ASSIGNMENT AND OTHER NETWORK FLOW PROBLEMS - A TUTORIAL [J].
BERTSEKAS, DP .
INTERFACES, 1990, 20 (04) :133-149
[6]
BERTSEKAS DP, 1989, LIDSP1925 MIT REP
[7]
Birkoff G, 1946, U NAC TUCUMAN REV SE, V5, P147
[8]
AN ANALOG APPROACH TO THE TRAVELING SALESMAN PROBLEM USING AN ELASTIC NET METHOD [J].
DURBIN, R ;
WILLSHAW, D .
NATURE, 1987, 326 (6114) :689-691
[9]
FAYBUSOVICH L, 1991, PROCEEDINGS OF THE 30TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-3, P2094, DOI 10.1109/CDC.1991.261499
[10]
PARALLEL AND DETERMINISTIC ALGORITHMS FROM MRFS - SURFACE RECONSTRUCTION [J].
GEIGER, D ;
GIROSI, F .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (05) :401-412