Recent research on formulating and solving distributionally robust optimization problems has seen many different approaches for describing one’s ambiguity set,such as constraints on first and second moments or quanti...Recent research on formulating and solving distributionally robust optimization problems has seen many different approaches for describing one’s ambiguity set,such as constraints on first and second moments or quantiles.In this paper,we use theWasserstein distance to characterize the ambiguity set of distributions,which allows us to circumvent common overestimation that arises when other procedures are used,such as fixing the center of mass and the covariance matrix of the distribution.In particular,we derive closed-form expressions for distributions that are as“spread out”as possible,and apply our result to a problem in multi-vehicle coordination.展开更多
文摘Recent research on formulating and solving distributionally robust optimization problems has seen many different approaches for describing one’s ambiguity set,such as constraints on first and second moments or quantiles.In this paper,we use theWasserstein distance to characterize the ambiguity set of distributions,which allows us to circumvent common overestimation that arises when other procedures are used,such as fixing the center of mass and the covariance matrix of the distribution.In particular,we derive closed-form expressions for distributions that are as“spread out”as possible,and apply our result to a problem in multi-vehicle coordination.
