• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Riemannian Distance For Robust Downlink Beamforming

Xu, Lijin 10 1900 (has links)
<p>We examine the robust downlink beamforming design from the point of outage probability constraint. We further reason that since the estimated downlink channel correlation (DCC) matrices form a manifold in the signal space, the estimation error should be measured in terms of Riemannian distance (RD) instead of the commonly used Euclidean distance (ED). Applying this concept of measure to our design constraint, we establish approximated outage probability constraints using multidimensional ball set and multidimensional cube set. We transform the design problem into a convex optimization problem which can be solved efficiently by standard methods. Our proposed methods apply to both Gaussian distribution assumption and uniform distribution assumption. Simulation results show that the performance of our design is superior to those of other robust beamformers recently developed.</p> / Master of Applied Science (MASc)
2

Geometrie neholonomních mechanismů / Nonholonomic mechanisms geometry

Bartoňová, Ludmila January 2019 (has links)
Tato diplomová práce se zabývá popisem kinematického modelu řízení neholonomního mechanismu, konkrétně robotického hada. Model je zkoumán prostředky diferenciální geometrie. Dále je odvozena jeho nilpotentní aproximace. Lokální říditelnost je zjištěna pomocí dimenze Lieovy algebry generované řídícími vektorovými poli a jejich Lieovými závorkami. V závěru jsou navrženy dva jednoduché řídící algoritmy, jeden pro globální a druhý pro lokální řízení, a poté následuje srovnání jednotlivých modelů.

Page generated in 0.0832 seconds