Name
Abstract | ||
|---|---|---|
Motivated by circumstances with severe computational resource limits (e.g., settings with strong constraints on memory or communication), this paper addresses the problem of concisely representing and processing information for estimation and planning tasks. In this paper, conciseness is a measure of explicit representational complexity: for filtering, we are concerned with maintaining as little s... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TASE.2017.2701648 | IEEE Transactions on Automation Science and Engineering |
Keywords | Field | DocType |
Robot sensing systems,Planning,Complexity theory,Estimation,NP-hard problem,Automata,Algorithm design and analysis | Observability,Decision problem,Mathematical optimization,Information processing,Algorithm design,Information transfer,Subroutine,Computer science,Filter (signal processing),Algorithm,Theoretical computer science,Computational resource | Journal |
Volume | Issue | ISSN |
14 | 4 | 1545-5955 |
Citations | PageRank | References |
1 | 0.36 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jason M. O'Kane | 1 | 203 | 27.01 |
| Dylan A. Shell | 2 | 334 | 47.94 |