  An acyclic edge coloring of a graph $G$ is a proper edge coloring such that
no bichromatic cycles are produced. The acyclic edge coloring conjecture by
Fiam{\v{c}}ik (1978) and Alon, Sudakov and Zaks (2001) states that every simple
graph with maximum degree $\Delta$ is acyclically edge $(\Delta +
2)$-colorable. Despite many milestones, the conjecture remains open even for
planar graphs. In this paper, we confirm affirmatively the conjecture on planar
graphs without intersecting triangles. We do so by first showing, by
discharging methods, that every planar graph without intersecting triangles
must have at least one of the six specified groups of local structures, and
then proving the conjecture by recoloring certain edges in each such local
structure and by induction on the number of edges in the graph.
