1,720 research outputs found
Verification of system properties of polynomial systems using discrete-time approximations and set-based analysis
Magdeburg, Univ., Fak. fĂĽr Elektrotechnik und Informationstechnik, Diss., 2015von Philipp Rumschinsk
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with
continuous and discrete variables are among the most important challenges faced
by the designers of automated decision support systems. In this paper, we
describe a novel hybrid factored Markov decision process (MDP) model that
allows for a compact representation of these problems, and a new hybrid
approximate linear programming (HALP) framework that permits their efficient
solutions. The central idea of HALP is to approximate the optimal value
function by a linear combination of basis functions and optimize its weights by
linear programming. We analyze both theoretical and computational aspects of
this approach, and demonstrate its scale-up potential on several hybrid
optimization problems
Design of of model-based controllers via parametric programming
Imperial Users onl
A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
Recent years have seen significant advances in quantum/quantum-inspired
technologies capable of approximately searching for the ground state of Ising
spin Hamiltonians. The promise of leveraging such technologies to accelerate
the solution of difficult optimization problems has spurred an increased
interest in exploring methods to integrate Ising problems as part of their
solution process, with existing approaches ranging from direct transcription to
hybrid quantum-classical approaches rooted in existing optimization algorithms.
While it is widely acknowledged that quantum computers should augment classical
computers, rather than replace them entirely, comparatively little attention
has been directed toward deriving analytical characterizations of their
interactions. In this paper, we present a formal analysis of hybrid algorithms
in the context of solving mixed-binary quadratic programs (MBQP) via Ising
solvers. We show the exactness of a convex copositive reformulation of MBQPs,
allowing the resulting reformulation to inherit the straightforward analysis of
convex optimization. We propose to solve this reformulation with a hybrid
quantum-classical cutting-plane algorithm. Using existing complexity results
for convex cutting-plane algorithms, we deduce that the classical portion of
this hybrid framework is guaranteed to be polynomial time. This suggests that
when applied to NP-hard problems, the complexity of the solution is shifted
onto the subroutine handled by the Ising solver
Provably Robust Semi-Infinite Program Under Collision Constraints via Subdivision
We present a semi-infinite program (SIP) solver for trajectory optimizations
of general articulated robots. These problems are more challenging than
standard Nonlinear Program (NLP) by involving an infinite number of non-convex,
collision constraints. Prior SIP solvers based on constraint sampling cannot
guarantee the satisfaction of all constraints. Instead, our method uses a
conservative bound on articulated body motions to ensure the solution
feasibility throughout the optimization procedure. We further use subdivision
to adaptively reduce the error in conservative motion estimation. Combined, we
prove that our SIP solver guarantees feasibility while approaches the critical
point of SIP problems up to arbitrary user-provided precision. We have verified
our method on a row of trajectory optimization problems involving industrial
robot arms and UAVs, where our method can generate collision-free, locally
optimal trajectories within a couple minutes
Global optimization algorithms for semi-infinite and generalized semi-infinite programs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemical Engineering, 2008.Includes bibliographical references (p. 235-249).The goals of this thesis are the development of global optimization algorithms for semi-infinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding issue with semi-infinite programming (SIP) was a methodology that could provide a certificate of global optimality on finite termination for SIP with nonconvex functions participating. We have developed the first methodology that can generate guaranteed feasible points for SIP and provide e-global optimality on finite termination. The algorithm has been implemented in a branch-and-bound (B&B) framework and uses discretization coupled with convexification for the lower bounding problem and the interval constrained reformulation for the upper bounding problem. Within the framework of SIP we have also proposed a number of feasible-point methods that all rely on the same basic principle; the relaxation of the lower-level problem causes a restriction of the outer problem and vice versa. All these methodologies were tested using the Watson test set. It was concluded that the concave overestimation of the SIP constraint using McCormcick relaxations and a KKT treatment of the resulting expression is the most computationally expensive method but provides tighter bounds than the interval constrained reformulation or a concave overestimator of the SIP constraint followed by linearization. All methods can work very efficiently for small problems (1-3 parameters) but suffer from the drawback that in order to converge to the global solution value the parameter set needs to subdivided. Therefore, for problems with more than 4 parameters, intractable subproblems arise very high in the B&B tree and render global solution of the whole problem infeasible.(cont.) The second contribution of the thesis was the development of the first finite procedure that generates guaranteed feasible points and a certificate of e-global optimality for generalized semi-infinite programs (GSIP) with nonconvex functions participating. The algorithm employs interval extensions on the lower-level inequality constraints and then uses discretization and the interval constrained reformulation for the lower and upper bounding subproblems, respectively. We have demonstrated that our method can handle the irregular behavior of GSIP, such as the non-closedness of the feasible set, the existence of re-entrant corner points, the infimum not being attained and above all, problems with nonconvex functions participating. Finally, we have proposed an extensive test set consisting of both literature an original examples. Similar to the case of SIP, to guarantee e-convergence the parameter set needs to be subdivided and therefore, only small examples (1-3 parameters) can be handled in this framework in reasonable computational times (at present). The final contribution of the thesis was the development of techniques to provide optimal ranges of valid reduction between full and reduced kinetic models. First of all, we demonstrated that kinetic model reduction is a design centering problem and explored alternative optimization formulations such as SIP, GSIP and bilevel programming. Secondly, we showed that our SIP and GSIP techniques are probably not capable of handling large-scale systems, even if kinetic model reduction has a very special structure, because of the need for subdivision which leads to an explosion in the number of constraints. Finally, we propose alternative ways of estimating feasible regions of valid reduction using interval theory, critical points and line minimization.by Panayiotis Lemonidis.Ph.D
Planning in Hybrid Structured Stochastic Domains
Efficient representations and solutions for large structured decision problems with continuous and discrete variables are among the important challenges faced by the designers of automated decision support systems. In this work, we describe a novel hybrid factored Markov decision process (MDP) model that allows for a compact representation of these problems, and a hybrid approximate linear programming (HALP) framework that permits their efficient solutions. The central idea of HALP is to approximate the optimal value function of an MDP by a linear combination of basis functions and optimize its weights by linear programming. We study both theoretical and practical aspects of this approach, and demonstrate its scale-up potential on several hybrid optimization problems
A Partially Randomized Approach to Trajectory Planning and Optimization for Mobile Robots with Flat Dynamics
Motion planning problems are characterized by huge search spaces and complex obstacle structures with no concise mathematical expression. The fixed-wing airplane application considered in this thesis adds differential constraints and point-wise bounds, i. e. an infinite number of equality and inequality constraints.
An optimal trajectory planning approach is presented, based on the randomized Rapidly-exploring Random Trees framework (RRT*).
The local planner relies on differential flatness of the equations of motion to obtain tree branch candidates that automatically satisfy the differential constraints. Flat output trajectories, in this case equivalent to the airplane's flight path, are designed using BĂ©zier curves. Segment feasibility in terms of point-wise inequality constraints is tested by an indicator integral, which is evaluated alongside the segment cost functional.
Although the RRT* guarantees optimality in the limit of infinite planning time, it is argued by intuition and experimentation that convergence is not approached at a practically useful rate. Therefore, the randomized planner is augmented by a deterministic variational optimization technique. To this end, the optimal planning task is formulated as a semi-infinite optimization problem, using the intermediate result of the RRT(*) as an initial guess. The proposed optimization algorithm follows the feasible flavor of the primal-dual interior point paradigm. Discretization of functional (infinite) constraints is deferred to the linear subproblems, where it is realized implicitly by numeric quadrature. An inherent numerical ill-conditioning of the method is circumvented by a reduction-like approach, which tracks active constraint locations by introducing new problem variables. Obstacle avoidance is achieved by extending the line search procedure and dynamically adding obstacle-awareness constraints to the problem formulation.
Experimental evaluation confirms that the hybrid approach is practically feasible and does indeed outperform RRT*'s built-in optimization mechanism, but the computational burden is still significant.Bewegungsplanungsaufgaben sind typischerweise gekennzeichnet durch umfangreiche Suchräume, deren vollständige Exploration nicht praktikabel ist, sowie durch unstrukturierte Hindernisse, für die nur selten eine geschlossene mathematische Beschreibung existiert.
Bei der in dieser Arbeit betrachteten Anwendung auf Flächenflugzeuge kommen differentielle Randbedingungen und beschränkte Systemgrößen erschwerend hinzu.
Der vorgestellte Ansatz zur optimalen Trajektorienplanung basiert auf dem Rapidly-exploring Random Trees-Algorithmus (RRT*), welcher die Suchraumkomplexität durch Randomisierung beherrschbar macht. Der spezifische Beitrag ist eine Realisierung des lokalen Planers zur Generierung der Äste des Suchbaums. Dieser erfordert ein flaches Bewegungsmodell, sodass differentielle Randbedingungen automatisch erfüllt sind. Die Trajektorien des flachen Ausgangs, welche im betrachteten Beispiel der Flugbahn entsprechen, werden mittels Bézier-Kurven entworfen. Die Einhaltung der Ungleichungsnebenbedingungen wird durch ein Indikator-Integral überprüft, welches sich mit wenig Zusatzaufwand parallel zum Kostenfunktional berechnen lässt.
Zwar konvergiert der RRT*-Algorithmus (im probabilistischen Sinne) zu einer optimalen Lösung, jedoch ist die Konvergenzrate aus praktischer Sicht unbrauchbar langsam. Es ist daher naheliegend, den Planer durch ein gradientenbasiertes lokales Optimierungsverfahren mit besseren Konvergenzeigenschaften zu unterstützen. Hierzu wird die aktuelle Zwischenlösung des Planers als Initialschätzung für ein kompatibles semi-infinites Optimierungsproblem verwendet. Der vorgeschlagene Optimierungsalgorithmus erweitert das verbreitete innere-Punkte-Konzept (primal dual interior point method) auf semi-infinite Probleme. Eine explizite Diskretisierung der funktionalen Ungleichungsnebenbedingungen ist nicht erforderlich, denn diese erfolgt implizit durch eine numerische Integralauswertung im Rahmen der linearen Teilprobleme.
Da die Methode an Stellen aktiver Nebenbedingungen nicht wohldefiniert ist, kommt zusätzlich eine Variante des Reduktions-Ansatzes zum Einsatz, bei welcher der Vektor der Optimierungsvariablen um die (endliche) Menge der aktiven Indizes erweitert wird.
Weiterhin wurde eine Kollisionsvermeidung integriert, die in den Teilschritt der Liniensuche eingreift und die Problemformulierung dynamisch um Randbedingungen zur lokalen BerĂĽcksichtigung von Hindernissen erweitert.
Experimentelle Untersuchungen bestätigen, dass die Ergebnisse des hybriden Ansatzes aus RRT(*) und numerischem Optimierungsverfahren der klassischen RRT*-basierten Trajektorienoptimierung überlegen sind. Der erforderliche Rechenaufwand ist zwar beträchtlich, aber unter realistischen Bedingungen praktisch beherrschbar
- …