Mathematical optimization
Related papers: 20
About
Mathematical optimization is the process of systematically finding input values that minimize or maximize an objective function, often subject to constraints. It encompasses a broad family of techniques—including gradient-based methods, convex programming, evolutionary algorithms, particle swarm methods, and sampling-based planners—each suited to different problem structures and computational demands. In robotics and AI, optimization is foundational: it underlies motion planning (finding collision-free, time-optimal paths), trajectory generation, grasp planning, reinforcement learning policy updates, simultaneous localization and mapping, and control synthesis. Algorithms like RRT*, sequential convex optimization, and trust region policy optimization all cast their core problems as finding solutions that extremize some measure of performance or cost. Mathematical optimization matters because real-world robotic tasks involve competing demands—speed, safety, energy efficiency, and uncertainty—that must be formally balanced. By framing these challenges as optimization problems, engineers gain principled, scalable tools that can handle high-dimensional configuration spaces, nonlinear dynamics, and probabilistic uncertainty, making robust autonomous behavior achievable across diverse platforms and environments.
Top Researchers
Top Cited Papers
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
Citations: 14853 • 2002
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Lydia E. Kavraki, P. Švestka, J.-C. Latombe, M.H. Overmars
Citations: 6256 • 1996
Robot Motion Planning
Jean‐Claude Latombe
Citations: 5429 • 1991
CasADi: a software framework for nonlinear optimization and optimal control
Joel A.E. Andersson, Joris Gillis, Greg Horn, James B. Rawlings, Moritz Diehl
Citations: 3693 • 2018
Randomized Kinodynamic Planning
Steven M. LaValle, James Kuffner
Citations: 3241 • 2001
Trust Region Policy Optimization
John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, Pieter Abbeel
Citations: 3141 • 2015
Applications of second-order cone programming
Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, Hervé Lebret
Citations: 2415 • 1998
High-Dimensional Continuous Control Using Generalized Advantage Estimation
John Schulman, Philipp Moritz, Sergey Levine, Michael I. Jordan, Pieter Abbeel
Citations: 1750 • 2015
STRIPS: a new approach to the application of theorem proving to problem solving
Richard Fikes, Nils J. Nilsson
Citations: 1487 • 1971
Practical Methods for Optimal Control using Nonlinear Programming
JT Betts, Ilya Kolmanovsky
Citations: 1462 • 2002
A Tutorial on Particle Filtering and Smoothing: Fifteen years later
Randal Douc, Adam M. Johansen
Citations: 1407 • 2008
Time-Optimal Control of Robotic Manipulators Along Specified Paths
J.E. Bobrow, Steven Dubowsky, J.S. Gibson
Citations: 1301 • 1985
Mixture density networks
Chris Bishop
Citations: 1273 • 1994
Coverage for robotics – A survey of recent results
Howie Choset
Citations: 1189 • 2001
Parallel Problem Solving from Nature - PPSN VIII
Citations: 1151 • 2004
Monte Carlo localization: efficient position estimation for mobile robots
Dieter Fox, Wolfram Burgard, Frank Dellaert, Sebastian Thrun
Citations: 1073 • 1999
Learning and executing generalized robot plans
Richard Fikes, Peter E. Hart, Nils J. Nilsson
Citations: 1033 • 1972
Semi-Infinite Programming: Theory, Methods, and Applications
R. Hettich, K. O. Kortanek
Citations: 1017 • 1993
Minimum-time control of robotic manipulators with geometric path constraints
Kang G. Shin, Neil David McKay
Citations: 992 • 1985
Robot Motion Planning: A Distributed Representation Approach
Jérôme Barraquand, Jean‐Claude Latombe
Citations: 988 • 1991