<p>Sorry, but I'm afraid you have to look a bit at the math of the DDPG algorithm here to understand why it is calld "target network". DDPG minimizes the following loss (from the original paper <a href="https://arxiv.org/pdf/1509.02971.pdf" rel="nofollow noreferrer">https://arxiv.org/pdf/1509.02971.pdf</a>):</p>

<p><a href="https://i.stack.imgur.com/Z9UHm.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Z9UHm.png" alt="enter image description here"></a></p>

<p>where <strong>Q</strong> is represented by your neural network aka. your "agent" and <strong>y</strong> is the so-called <strong>target</strong>. It is called <em>target</em>, because you want the values of you agent to be close to it. Just for clarification: <em>Q(s_t, a_t | theta)</em> corresponds to the output of your agent at time step <em>t</em>, given state <em>s</em>, action <em>a</em> and network weights <em>theta</em>.</p>

<p>However, as you can see, the target <em>y</em> depends on the same (neural network) parameters theta of your agent. In practice, this dependency leads to instabilities when minimizing the above loss. </p>

<p>One trick to mitigate this problems is to use a "second" target network, where the target network is either</p>

<ul>
<li>a frozen state of the agent ("regular") network and just copied over from the regular network every some-fixed-number of steps (e.g. every 10,000 iterations). This is the approach taken in DQN.</li>
<li>or a lagged version of the actual agent ("regular") network, where the lagging is achieved via so-called polyak averaging. That is, instead of updating the weights of your target network by just copying the ones of regular network, at each iteration you take some sort of weighted average. This is the approach taken in DDPG.</li>
</ul>

<p>So simply put, the target network is nothing else than just a lagged version of the regular network.</p>
What are Target Network in Policy Gradient algorithms in Reinforcement learning in simple terms with some example?
<blockquote>
  <p>How does it differ from regular network 
  Source Text -->  "In DDPG algorithm topology consist of two copies of network weights for each network, (Actor: regular and target) and (Critic: regular and target)"</p>
</blockquote>