Abstract
Idempotent methods have been found to be extremely helpful in the numerical solution of certain classes of nonlinear control problems. In those methods, one uses the fact that the value function lies in the space of semiconvex functions (in the case of maximizing controllers), and approximates this value using a truncated max-plus basis expansion. In some classes, the value function is actually convex, and then one specifically approximates with suprema (i.e., max-plus sums) of affine functions. Note that the space of convex functions is a max-plus linear space, or moduloid. In extending those concepts to game problems, one finds a different function space, and different algebra, to be appropriate. Here we consider functions which may be represented using infima (i.e., min-max sums) of max-plus affine functions. It is natural to refer to the class of functions so represented as the min-max linear space (or moduloid) of max-plus hypo-convex functions. We examine this space, the associated notion of duality and min-max basis expansions. In using these methods for solution of control problems, and now games, a critical step is complexity-reduction. In particular, one needs to find reduced-complexity expansions which approximate the function as well as possible. We obtain a solution to this complexity-reduction problem in the case of min-max expansions.
Similar content being viewed by others
References
Akian, M., Gaubert, S., Lakhoua, A.: The max-plus finite element method for solving deterministic optimal control problems: basic properties and convergence analysis. SIAM J. Control Optim. 47, 817–848 (2008)
Akian, M., Gaubert, S., Lakhoua, A.: A max-plus finite element method for solving finite horizon deterministic optimal control problems. In: Proc. 16th International Symposium on Mathematical Theory of Networks and Systems (2004)
Baccelli, F.L., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity. Wiley, New York (1992)
Cochet-Terrasson, J., Gaubert, S., Gunawardena, J.: A constructive fixed point theorem for min-max function. Dyn. Stab. Syst. 14, 407–433 (1999)
Cohen, G., Gaubert, S., Quadrat, J.-P.: Duality and separation theorems in idempotent semimodules. Linear Algebra Appl. 379, 395–422 (2004)
Cohen, G., Gaubert, S., Quadrat, J.-P., Singer, I.: Max-plus convex sets and functions. In: Litvinov, G.L., Maslov, V.P. (eds.) Idempotent Mathematics and Mathematical Physics. Contemporary Mathematics, vol. 377, pp. 105–129. Am. Math. Soc., Providence (2005)
Cuninghame-Green, R.A.: Minimax Algebra. Lecture Notes in Economics and Mathematical Systems, vol. 166. Springer, New York (1979)
Fleming, W.H.: Max-plus stochastic processes. Appl. Math. Optim. 49, 159–181 (2004)
Fleming, W.H., McEneaney, W.M.: A max-plus based algorithm for an HJB equation of nonlinear filtering. SIAM J. Control Optim. 38, 683–710 (2000)
Kolokoltsov, V.N., Maslov, V.P.: Idempotent Analysis and Its Applications. Kluwer Academic, Dordrecht (1997)
Litvinov, G.L., Maslov, V.P., Shpiz, G.B.: Idempotent functional analysis: an algebraic approach. Math. Notes 69(5), 696–729 (2001)
McEneaney, W.M.: Max-Plus Methods for Nonlinear Control and Estimation. Birkhäuser, Boston (2006)
McEneaney, W.M.: Idempotent algorithms for discrete-time stochastic control through distributed dynamic programming. In: Proc. 48th IEEE CDC, pp. 1569–1574 (2009)
McEneaney, W.M.: Idempotent method for dynamic games and complexity reduction in min-max expansions. In: Proc. 48th IEEE CDC, pp. 163–168 (2009)
McEneaney, W.M.: Distributed dynamic programming for discrete-time stochastic control, and Idempotent Algorithms. Automatica 47, 443–451 (2011)
McEneaney, W.M.: Complexity reduction, cornices and pruning. In: Litvinov, G.L., Sergeev, S.N. (eds.) Tropical and Idempotent Mathematics. Contemporary Math., vol. 495, pp. 293–303. Am. Math. Soc., Providence (2009)
McEneaney, W.M., Deshpande, A., Gaubert, S.: Curse-of-complexity attenuation in the curse-of-dimensionality-free method for HJB PDEs. In: Proc. ACC, pp. 5041–5046 (2008)
McEneaney, W.M., Oran, A., Cavender, A.: Value-based tasking controllers for sensing assets. In: Proc. AIAA Guidance, Nav. and Control Conf., Honolulu (2008)
Rubinov, A.M., Singer, I.: Topical and sub-topical functions, downward sets and abstract convexity. Optimization 50, 307–351 (2001)
Singer, I.: Abstract Convex Analysis. Wiley-Interscience, New York (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by NSF Grant 0808131 and AFOSR.
Rights and permissions
About this article
Cite this article
Gaubert, S., McEneaney, W.M. Min-Max Spaces and Complexity Reduction in Min-Max Expansions. Appl Math Optim 65, 315–348 (2012). https://doi.org/10.1007/s00245-011-9158-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00245-011-9158-5