<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Aerospace Control Laboratory: Manuscripts</title>
<link href="https://hdl.handle.net/1721.1/37333" rel="alternate"/>
<subtitle>Drafts of documents written by laboratory members</subtitle>
<id>https://hdl.handle.net/1721.1/37333</id>
<updated>2026-04-11T12:18:43Z</updated>
<dc:date>2026-04-11T12:18:43Z</dc:date>
<entry>
<title>Information-Theoretic Motion Planning for Constrained Sensor Networks</title>
<link href="https://hdl.handle.net/1721.1/71738" rel="alternate"/>
<author>
<name>Levine, Daniel</name>
</author>
<author>
<name>Luders, Brandon</name>
</author>
<author>
<name>How, Jonathan P.</name>
</author>
<id>https://hdl.handle.net/1721.1/71738</id>
<updated>2025-02-06T18:38:02Z</updated>
<published>2012-07-20T00:00:00Z</published>
<summary type="text">Information-Theoretic Motion Planning for Constrained Sensor Networks
Levine, Daniel; Luders, Brandon; How, Jonathan P.
This paper considers the problem of online informative motion planning for a network of heterogeneous sensing agents, each subject to dynamic constraints, environmental constraints, and sensor limitations.  Prior work has not yielded algorithms that are amenable to such general constraint characterizations.  In this paper, we propose the Information-rich Rapidly-exploring Random Tree (IRRT) algorithm as a solution to the constrained informative motion planning problem that embeds metrics on uncertainty reduction at both the tree growth and path selection levels.  IRRT possesses a number of beneficial properties, chief among them being the ability to find dynamically feasible, informative paths on short timescales, even subject to the aforementioned constraints.  The utility of IRRT in efficiently localizing stationary targets is demonstrated in a progression of simulation results with both single-agent and multiagent networks.  These results show that IRRT can be used in real-time to generate and execute information-rich paths in tightly constrained environments.
</summary>
<dc:date>2012-07-20T00:00:00Z</dc:date>
</entry>
<entry>
<title>Planning under Uncertainty using Nonparametric Bayesian Models</title>
<link href="https://hdl.handle.net/1721.1/69058" rel="alternate"/>
<author>
<name>Campbell, Trevor</name>
</author>
<author>
<name>Ponda, Sameera</name>
</author>
<author>
<name>Chowdhary, Girish</name>
</author>
<author>
<name>How, Jonathan</name>
</author>
<id>https://hdl.handle.net/1721.1/69058</id>
<updated>2025-02-06T18:38:33Z</updated>
<published>2012-08-01T00:00:00Z</published>
<summary type="text">Planning under Uncertainty using Nonparametric Bayesian Models
Campbell, Trevor; Ponda, Sameera; Chowdhary, Girish; How, Jonathan
</summary>
<dc:date>2012-08-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Intelligent Cooperative Control Architecture</title>
<link href="https://hdl.handle.net/1721.1/49418" rel="alternate"/>
<author>
<name>How, Jonathan</name>
</author>
<author>
<name>Choi, Han-Lim</name>
</author>
<author>
<name>Undurti, Aditya</name>
</author>
<author>
<name>Redding, Joshua</name>
</author>
<id>https://hdl.handle.net/1721.1/49418</id>
<updated>2025-02-06T18:39:00Z</updated>
<published>2009-10-07T00:00:00Z</published>
<summary type="text">An Intelligent Cooperative Control Architecture
How, Jonathan; Choi, Han-Lim; Undurti, Aditya; Redding, Joshua
This paper presents an extension of existing cooperative control algorithms that have been developed for multi-UAV applications to utilize real-time observations and/or performance metric(s) in conjunction with learning methods to generate a more intelligent planner response.  We approach this issue from a decentralized&#13;
cooperative control perspective and embed elements of feedback control&#13;
and active learning, resulting in an new intelligent Cooperative Control Architecture (iCCA).  We describe this architecture, discuss some of the issues that must be addressed, and present illustrative examples of cooperative control problems where iCCA can be applied effectively.
</summary>
<dc:date>2009-10-07T00:00:00Z</dc:date>
</entry>
</feed>
