title: Clipping in neurocontrol by adaptive dynamic programming.
abstract: In adaptive dynamic programming, neurocontrol, and reinforcement learning, the objective is for an agent to learn to choose actions so as to minimize a total cost function. In this paper, we show that when discretized time is used to model the motion of the agent, it can be very important to do clipping on the motion of the agent in the final time step of the trajectory. By clipping, we mean that the final time step of the trajectory is to be truncated such that the agent stops exactly at the first terminal state reached, and no distance further. We demonstrate that when clipping is omitted, learning performance can fail to reach the optimum, and when clipping is done properly, learning performance can improve significantly. The clipping problem we describe affects algorithms that use explicit derivatives of the model functions of the environment to calculate a learning gradient. These include backpropagation through time for control and methods based on dual heuristic programming. However, the clipping problem does not significantly affect methods based on heuristic dynamic programming, temporal differences learning, or policy-gradient learning algorithms.
authors.forename: Michael
authors.initials: M
authors.lastname: Fairbank
authors.forename: Danil
authors.initials: D
authors.lastname: Prokhorov
authors.forename: Eduardo
authors.initials: E
authors.lastname: Alonso
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D006801:Humans; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D012054:Reinforcement, Psychology