The problem of determining the number of plane partitions invariant under various symmetry groups is among the most difficult problems in enumerative combinatorics. A tremendous amount of work has been devoted to these problems. This is a survey of the results on plane partitions which are invariant under various actions.