<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://hdl.handle.net/1721.1/37332">
<title>Aerospace Control Laboratory</title>
<link>http://hdl.handle.net/1721.1/37332</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/77933"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/77931"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/77915"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/71875"/>
</rdf:Seq>
</items>
<dc:date>2013-05-21T16:48:22Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/1721.1/77933">
<title>Supplementary material for nonparameteric adaptive control of time varying systems using gaussian processes</title>
<link>http://hdl.handle.net/1721.1/77933</link>
<description>Supplementary material for nonparameteric adaptive control of time varying systems using gaussian processes
Chowdhary, Girish; Kingravi, Hassan A.; How, Jonathan P.; Vela, Patricio A.
Real-world dynamical variations make adaptive control of time-varying systems highly relevant. However, most adaptive control literature focuses on analyzing systems where the uncertainty is represented as a weighted linear combination of fixed number of basis functions, with constant weights. One approach to modeling time variations is to assume time varying ideal weights, and use difference integration to accommodate weight variation. However, this approach reactively suppresses the uncertainty, and has little ability to predict system behavior locally. We present an alternate formulation by leveraging Bayesian nonparametric Gaussian Process adaptive elements. We show that almost surely bounded adaptive controllers for a class of nonlinear time varying system can be formulated by incorporating time as an additional input to the Gaussian kernel. Analysis and simulations show that the learning-enabled local predictive ability of our adaptive controllers significantly improves performance.
This technical report has supplementary material for "Bayesian Nonparametric Adaptive Control of Time-varying Systems using Gaussian Processes" American Control Conference paper
</description>
<dc:date>2013-03-15T04:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/77931">
<title>Bayesian Nonparametric Adaptive Control using Gaussian Processes</title>
<link>http://hdl.handle.net/1721.1/77931</link>
<description>Bayesian Nonparametric Adaptive Control using Gaussian Processes
Chowdhary, Girish; Kingravi, Hassan A.; How, Jonathan P.; Vela, Patricio A.
Most current Model Reference Adaptive Control&#13;
(MRAC) methods rely on parametric adaptive elements, in&#13;
which the number of parameters of the adaptive element are&#13;
fixed a priori, often through expert judgment. An example of&#13;
such an adaptive element are Radial Basis Function Networks&#13;
(RBFNs), with RBF centers pre-allocated based on the expected&#13;
operating domain. If the system operates outside of the expected&#13;
operating domain, this adaptive element can become&#13;
non-effective in capturing and canceling the uncertainty, thus&#13;
rendering the adaptive controller only semi-global in nature.&#13;
This paper investigates a Gaussian Process (GP) based Bayesian&#13;
MRAC architecture (GP-MRAC), which leverages the power and&#13;
flexibility of GP Bayesian nonparametric models of uncertainty.&#13;
GP-MRAC does not require the centers to be preallocated, can&#13;
inherently handle measurement noise, and enables MRAC to&#13;
handle a broader set of uncertainties, including those that are&#13;
defined as distributions over functions. We use stochastic stability&#13;
arguments to show that GP-MRAC guarantees good closed loop&#13;
performance with no prior domain knowledge of the uncertainty.&#13;
Online implementable GP inference methods are compared in&#13;
numerical simulations against RBFN-MRAC with preallocated&#13;
centers and are shown to provide better tracking and improved&#13;
long-term learning.
This technical report is a preprint of an article submitted to a journal.
</description>
<dc:date>2013-03-15T04:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/77915">
<title>Efficient Distributed Sensing Using Adaptive Censoring-Based Inference</title>
<link>http://hdl.handle.net/1721.1/77915</link>
<description>Efficient Distributed Sensing Using Adaptive Censoring-Based Inference
Mu, Beipeng; Chowdhary, Girish; How, Jonathan P.
In many distributed sensing applications it is likely that only a few agents will have valuable information at any given time. Since&#13;
wireless communication between agents is resource-intensive, it is important to ensure that the communication effort is focused on&#13;
communicating valuable information from informative agents. This paper presents communication efficient distributed sensing algorithms&#13;
that avoid network cluttering by having only agents with high Value of Information (VoI) broadcast their measurements to the network,&#13;
while others censor themselves. A novel contribution of the presented distributed estimation algorithm is the use of an adaptively adjusted&#13;
VoI threshold to determine which agents are informative. This adaptation enables the team to better balance between the communication&#13;
cost incurred and the long-term accuracy of the estimation. Theoretical results are presented establishing the almost sure convergence of&#13;
the communication cost and estimation error to zero for distributions in the exponential family. Furthermore, validation through numerical&#13;
simulations and real datasets show that the new VoI-based algorithms can yield improved parameter estimates than those achieved by&#13;
previously published hyperparameter consensus algorithms while incurring only a fraction of the communication cost.
This technical report is a preprint of work submitted to a journal.
</description>
<dc:date>2013-03-15T04:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/71875">
<title>Efficient distributed information fusion using value of information based censoring</title>
<link>http://hdl.handle.net/1721.1/71875</link>
<description>Efficient distributed information fusion using value of information based censoring
Mu, Beipeng; How, Jonathan P.; Chowdhary, Girish
In many distributed sensing applications, not all agents have valuable information&#13;
at all times. Therefore, requiring all agents to communicate at all times can be&#13;
resource intensive. In this work, the notion of Value of Information (VoI) is used to&#13;
improve the efficiency of distributed sensing algorithms. Particularly, only agents&#13;
with high VoI broadcast their measurements to the network, while others censor&#13;
their measurements. New VoI realized data fusion algorithms are introduced, and&#13;
an in depth analysis of the costs incurred by these algorithms and conventional&#13;
distributed data fusion algorithms is presented. Numerical simulations are used&#13;
to compare the performance of the VoI realized algorithms with traditional data&#13;
fusion algorithms. A VoI based algorithm that adaptively adjusts the criterion for&#13;
being informative is presented and shown to strike a good balance between reduced&#13;
communication cost and increased accuracy.
</description>
<dc:date>2012-07-27T04:00:00Z</dc:date>
</item>
</rdf:RDF>
