In this paper, we present a decentralized approach to solving the problem of moving N homogeneous agents into N, or more, goal locations along energy-minimizing trajectories. We propose a decentralized framework which only requires knowledge of the goal locations by each agent. The framework includes guarantees on safety through dynamic constraints, and a method to impose a dynamic, global priority ordering on the agents. A solution to the goal assignment and trajectory generation problems are derived in the form of a binary program and a linear system of equations. We also present the conditions for global optimality and characterize the assumptions under which the algorithm is guaranteed to converge to a unique assignment of agents to goals. Finally, we validate the efficacy of our approach through a numerical simulation in MATLAB.