Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 465 for “"Near-Optimal"”.
-
Near-optimal bin packing algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.
-
Near-optimal stochastic terminal controllers.
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Thesis. 1971. Sc.D.
-
Near-Optimal Learning in Sequential Games
… learning techniques are needed to find the optimal decision rule. One popular approach is the reinforcement learning (RL) perspective, in which an agent learns the optimal decision rule by receiving rewards based on its actions. In the presence of multiple learning agents, sequential …
-
Optimal and on-board near-optimal midcourse guidance
Optimal midcourse guidance is examined for an air-to-air missile featuring boost-coast-sustain propulsion. A vertical plane, point-mass model is studied with load factor as a control variable. Time-range-energy optimal trajectories are computed, open-loop, via the usual necessary conditions and a …
-
On-board near-optimal climb-dash energy management
… same ideas, i.e. that the energy determines the optimal altitude and pathangle, and trajectories which do not initially lie on the optimal schedule rapidly fair into it. (The optimal schedule is an Euler solution to the twopoint- -boundary-value-problem, found by a multiple shooting technique) . …
-
Near-optimal feedback guidance for an accurate lunar landing
… is posed as a finite-time, fixed-terminal, optimal control problem. As a key finding of this work, the method of solution that is applied to construct the guidance mechanism employs a new extension of the State-Dependent Riccati Equation (SDRE) technique for constrained nonlinear dynamical …
-
Cooperative Strategies for Near-Optimal Computation in Wireless Networks
… remains unclear. In this thesis, I seek after near-optimal computation strategies under realistic wireless models. For both network coding and averaging con- sensus, cooperative communications plays a key role. For network cod- ing, I consider two topologies: a single-layer network in which …
-
Event-triggered near optimal adaptive control of interconnected systems
… have attracted researchers to develop optimal adaptive control schemes to elicit a desired performance when the complex system dynamics are uncertain. In this dissertation, motivated by the fact that aperiodic event sampling saves network resources while ensuring system stability, a …
-
Near-Optimal Learning and Planning in Separated Latent MDPs
… main thrust of this paper is in establishing a nearly-sharp statistical threshold for the horizon length necessary for efficient learning. On the computational side, we show that under a weaker assumption of separability under the optimal policy, there is a quasi-polynomial algorithm with time …
-
Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures
Asymptotically optimal planners, such as PRM*, guarantee thatsolutions approach optimal as iterations increase. Roadmaps with this property, however, may grow too large. If optimality is relaxed,asymptotically near-optimal solutions produce sparser graphs by notincluding all edges. The idea stems …
-
Some Optimal and Near-Optimal Low Rate Algebraic Convolutional Codes
Made available in DSpace on 2014-12-14T13:09:41Z (GMT). No. of bitstreams: 1 8004161.pdf: 2733449 bytes, checksum: 8d8ffe6487a5994678a19af55d7627f5 (MD5) Previous issue date: 1979
-
A near-optimal wavelet-based estimation technique for video sequences
… a Wiener lter, which can de-noise signals and is optimal in the mean-square error sense, but is hard to implement because second-order statistics may be unknown and because of the inversion of a possibly large matrix. Instead, an approximation of the Wiener lter is accomplished by rst performing a …
-
Efficient planning for near-optimal contact-rich control under uncertainty
… reliable solutions under action uncertainty. But optimal manipulation plans that leverage environmental contact are difficult to compute. Environmental contact produces complex kinematics that create difficulties for planning. This complexity is usually addressed by discretization over state and …
-
Near-Optimal Sensor Placement for Detection of Poisson Distributed Targets
… mean of the uncertain target model to yield a suboptimal yet tractable solution suitable for real-time applications. We evaluate the accuracy of this approximation by quantifying its deviation from the original formulation and providing an upper bound on the approximation error. While the initial …
-
On Switching Diffusions: The Feynman-Kac Formula And Near-Optimal Controls
… value problem. Second, we show the existence of near-optimal controls for a system driven by wideband noise in the presence of regime-switching. Using a relaxed control formulation, together with weak convergence methods, we show that given a stochastic optimal control problem, one may find a …
-
Dimension reduction algorithms for near-optimal low-dimensional embeddings and compressive sensing
… Euclidean space, and the goal is to find a linear function from Rd into Rk , where k << d, such that the resulting embedding of the input pointset into k-dimensional Euclidean space has various desirable properties. We focus on two classes of theoretical results: -- First, we examine linear …
-
Assortment and inventory optimization : from predictive choice models to near-optimal algorithms
Finding optimal product offerings is a fundamental operational issue in modern retailing, exemplified by the development of recommendation systems and decision support tools. The challenge is that designing an accurate predictive choice model generally comes at the detriment of efficient …
-
Near-Optimal Control of Atomic Force Microscope For Non-contact Mode Applications
… and cantilever probe positioning, including nonlinear surface interaction forces, for atomic force microscopes (AFM) is considered. By considering a relatively large cantilever stiffness, singular perturbation methods reduce complexity in the model and allows for faster responses to Van der Waals …
-
Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes
… that obtained in an earlier work; this number is optimal for all hypercube dimensions n ≤ 12, except for n = 10.
Page 1 of 24