|
|
|
|
| LEADER |
01690 am a22002293u 4500 |
| 001 |
78584 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Hover, Franz S.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mechanical Engineering
|e contributor
|
| 100 |
1 |
0 |
|a Hover, Franz S.
|e contributor
|
| 100 |
1 |
0 |
|a Hummel, Robert
|e contributor
|
| 700 |
1 |
0 |
|a Hummel, Robert
|e author
|
| 700 |
1 |
0 |
|a Mitra, Urbashi
|e author
|
| 700 |
1 |
0 |
|a Sukhatme, G.
|e author
|
| 245 |
0 |
0 |
|a One-step-ahead kinematic compressive sensing
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2013-04-24T14:55:03Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/78584
|
| 520 |
|
|
|a A large portion of work on compressive sampling and sensing has focused on reconstructions from a given measurement set. When the individual samples are expensive and optional, as is the case with autonomous agents operating in a physical domain and under specific energy limits, the CS problem takes on a new aspect because the projection is column-sparse, and the number of samples is not necessarily large. As a result, random sampling may no longer be the best tactic. The underlying incoherence properties in l0 reconstruction, however, can still motivate the purposeful design of samples in planning for CS with one or more agents; we develop here a greedy and computationally tractable sampling rule that will improve errors relative to random points. Several example cases illustrate that the approach is effective and robust.
|
| 520 |
|
|
|a United States. Office of Naval Research (Grant N00014-09-1-0700)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the 2011 IEEE GLOBECOM Workshops (GC Wkshps)
|
