I have some ideas about how to define morphism of morphisms in category theory, but I don't know anything about higher category theory. The idea is quite simple, and can be iterated easily. I'll only focus on Sets, but it is clear that the following concept could easily be categorifiable.
Let's give us some algebraic structure (magma, monoid, group, vector space, $\ldots$), and let $f : A \rightarrow B$ be a morphism of such structures. Notice that the graph of $f$, $\Gamma(f) = \{ (x, f(x)) \}$ inherits automatically of the same structure as $A$ and $B$, simply by defining the binary law as $(x,f(x)) * (y, f(y)) = (x*_A x', f(x) *_B f(y))$.
Let $f : A \rightarrow B$ and $g : C \rightarrow D$ two morphisms of the same type of structure. Call 2-morphism $\alpha : f \rightarrow g$ any morphism $\alpha : \Gamma(f) \rightarrow \Gamma(g)$, that is, any morphism of their graph. Clearly, $\Gamma(\alpha)$ also inherits of the same structure as $A$, $B$, $C$, and $D$, allowing us to iterate the process.
Is it known ? If not, does this sound a good idea to consider higher morphisms ?