Create an Finite Deterministic Automata for a regular expression
I think your problem could be understood in two ways:

$abb$ is a subword of $w$ and the word $w$ doesn't start with $abb$
$abb$ is a subword of $w[1:]$, but the word $w$ can start with $abb$

I will assume the first one but correct me if I'm wrong.
One way to create an automaton for this language would be as follows:

From the start state $q_0$ go to $q_a$ on input $a$ and to $q_{abb?}$ on input $b$
From $q_a$ go to $q_{ab}$ on $b$ and to $q_{bb?}$ on $a$
From $q_{ab}$ go to $q_{reject}$ on $b$ and to $q_{bb?}$ on $a$
From $q_{abb?}$ loop on $b$ and go to $q_{bb?}$ on $a$
From $q_{bb?}$ go to $q_{b?}$ on $b$ and loop on $a$
From $q_{b?}$ go to $q_{accept}$ on $b$ and to $q_{bb?}$ on $a$
Loop on $q_{accept}$, which is the accepting state

The graphical representation would look as follows:

So what we are doing, in essence, is first checking if the word $w$ starts with $abb$ and if it does reject it and if it does not, then look for the subword $abb$.
Answering the other part of your question:

There is an algorithm that transforms regular expressions to Nondeterministic Finite Automata
Developing intuition is just a matter of practice. You have to write as many automata for regular languages as possible and see what are the common tricks and methods, and what are some traps that await you when constructing automata.