TY - GEN
T1 - Planning and learning in permutation groups
AU - Fiat, Amos
AU - Moses, Shahar
AU - Shamir, Adi
AU - Shimshoni, Ilan
AU - Tardos, Gabor
PY - 1989
Y1 - 1989
N2 - Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.
AB - Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.
UR - http://www.scopus.com/inward/record.url?scp=0024766726&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1989.63490
DO - 10.1109/sfcs.1989.63490
M3 - Conference contribution
AN - SCOPUS:0024766726
SN - 0818619821
SN - 9780818619823
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 274
EP - 279
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
T2 - 30th Annual Symposium on Foundations of Computer Science
Y2 - 30 October 1989 through 1 November 1989
ER -