Grant Agreement n. 224168Grant Agreement • July 25th, 2010
Contract Type FiledJuly 25th, 2010Under certain technical assumptions, the authors prove that the DMPC problems are feasible at each update step k, and under certain bounds on the update interval δ convergence to a given set is also proved. Note that closed-loop stability is ensured by constraining the state trajectory predicted by each agent to stay close enough to the trajectory predicted at the previous time step that has been broadcasted. The main drawback of the approach is the conservativeness of the compatibility constraint.