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 4 of 4 for “"Convex Optimizations"”.
-
convex segmentation and mixed-integer footstep planning for a walking robot
… the footstep planning problem as a mixed-integer convex optimization. The footstep planning problem involves choosing a set of footstep locations which a walking robot can follow to safely reach a goal through an environment with obstacles. Rather than attempting to avoid the obstacles, which …
-
Distributive Time Division Multiplexed Localization Technique for WLANs
… multiplexed localization technique based on the convex semidefinite programming. Convex optimizations have proven to give promising results but have limitations of computational complexity for a larger problem size. In the case of localization problem the size is determined depending on the …
-
Outage Capacity and Code Design for Dying Channels
In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such circumstances, it is critical to quantify how fast and reliably the …
-
Multichannel blind deconvolution in underwater acoustic channels
… by minimizing a quadratic function over a non-convex set. We demonstrated the efficiency and robustness of both multichannel blind deconvolution methods on realistic acoustic channels in ocean waveguides and experimentally validated the methods using at-sea data. In the end, we investigated …