Moment-Sum-Of-Squares Approach For Fast Risk Estimation In Uncertain Environments

P. A. Parrilo, ”Semidefinite programming relaxations for semialgebraic problems”, Mathematical Programming, vol. 96, pp. 293-–320, 2003

2003

Earlier work this paper cites.

Z. Battles, L. N. Trefethen, ”An extension of MATLAB to continuous functions and operators”, SIAM Journal on Scientific Computing, vol. 25 , pp. 1743-–1770, 2004

2004

Earlier work this paper cites.

D. Bertsimas, I. Popescu, ”Optimal inequalities in probability theory: a convex optimization approach”, SIAM Journal on Optimization, vol. 15, No. 3, pp. 780-–804, 2005

2005

Earlier work this paper cites.

L. Blackmore, H. Li, B. C. Williams,”A probabilistic approach to optimal robust path planning with obstacles”, American Control Conference (ACC), Minneapolis, 2006

2006

Earlier work this paper cites.

A. Gil, J. Segura, N. M. Temme, ”Numerical methods for special functions”, Society for Industrial and Applied Mathematics (SIAM), 2007

2007

Earlier work this paper cites.

M. Ono, B. C. Williams, ”Iterative risk allocation: A new approach to robust model predictive control with a joint chance constraint”, IEEE Conference on Decision and Control (CDC), Cancun, Mexico, 2008

2008

Earlier work this paper cites.

L. Blackmore, M. Ono, ”Convex chance constrained predictive control without sampling”, AIAA Guidance, Navigation, and Control Conference, Chicago, 2009

2009

Earlier work this paper cites.

D. Henrion, J. B. Lasserre, C. Savorgnan, ”Approximate volume and integration for basic semialgebraic sets”, SIAM Review, 51(4), pp. 722–743, 2009

2009

Earlier work this paper cites.

M. Laurent, ”Sums of squares, moment matrices and optimization over polynomials”, In: Putinar M., Sullivant S. (eds) Emerging Applications of Algebraic Geometry. The IMA Volumes in Mathematics and its Applications, vol. 149, Springer, New York, 2009

2009

Cited alongside, same era.

D. Henrion, J. B. Lasserre, J. Loefberg, ”GloptiPoly 3: Moments, optimization and semidefinite programming”, Optimization Methods and Software Journal, vol. 24, pp. 761-–779, 2009

2009

Cited alongside, same era.

J. B. Lasserre, ”Global optimization with polynomials and the problem of moments”, SIAM Journal on Optimization, vol. 11, pp. 796-–817, 2011

2011

Cited alongside, same era.

A. Jasour, C. Lagoa, ”Convex relaxations of a probabilistically robust control design problem”, 52st IEEE Conference on Decision and Control (CDC), Florence, Italy, 2013

2013

Cited alongside, same era.

A. Jasour, N. S. Aybat, C. Lagoa ”Semidefinite programming for chance constrained optimization over semialgebraic sets”, SIAM Journal on Optimization, 25(3), 1411-–1440, 2015

2015

Later among the works it cites.

P. Florence, J. Carter, R. Tedrake, ”Integrated perception and control at high speed : Evaluating collision avoidance maneuvers without Maps”, 12th International workshop on the algorithm foundations of robotics (WAFR), San Francisco, 2016

2016

Later among the works it cites.

P. Santana, T. Vaquero, C. Toledo, A. Wang, C. Fang, B. Williams ”PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty”, 26th International Conference on Automated Planning and Scheduling (ICAPS), London, 2016

2016

Later among the works it cites.

E. Schmerling, M. Pavone, ”Evaluating trajectory collision probability through adaptive importance sampling for safe motion planning” Robotics: Science and Systems (RSS), MIT, 2017

2017