Corpus ID: 237941153

Dynamic Allocation of Visual Attention for Vision-based Autonomous Navigation under Data Rate Constraints

@article{Pedram2021DynamicAO,
  title={Dynamic Allocation of Visual Attention for Vision-based Autonomous Navigation under Data Rate Constraints},
  author={Ali Reza Pedram and Riku Funada and Takashi Tanaka},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.13146}
}
  • A. Pedram, Riku Funada, Takashi Tanaka
  • Published 27 September 2021
  • Computer Science, Engineering, Mathematics
  • ArXiv
This paper considers the problem of taskdependent (top-down) attention allocation for vision-based autonomous navigation using known landmarks. Unlike the existing paradigm in which landmark selection is formulated as a combinatorial optimization problem, we model it as a resource allocation problem where the decision-maker (DM) is granted extra freedom to control the degree of attention to each landmark. The total resource available to DM is expressed in terms of the capacity limit of the in… Expand

Figures from this paper

References

SHOWING 1-10 OF 23 REFERENCES
Attention and anticipation in fast visual-inertial navigation
  • L. Carlone, S. Karaman
  • Computer Science, Engineering
  • 2017 IEEE International Conference on Robotics and Automation (ICRA)
  • 2017
TLDR
This papers develops a computational approach for visual attention in robots that enables accurate visual-inertial navigation while the state of the art fails to track robot's motion during aggressive maneuvers. Expand
On efficient sensor scheduling for linear dynamical systems
TLDR
This work investigates the development of tractable algorithms to solve for the optimal and suboptimal sensor schedule with a condition on the non-optimality of an initialization of the schedule. Expand
Optimal Data Rate Allocation for Dynamic Sensor Fusion over Resource Constrained Communication Networks
TLDR
This work considers a dynamic sensor fusion problem where a large number of remote sensors observe a common Gauss-Markov process and the observations are transmitted to a fusion center over a resource constrained communication network, and shows that the problem can be formulated as a difference-of-convex program. Expand
LQG Control With Minimum Directed Information: Semidefinite Programming Approach
TLDR
This work identifies the state-space realization of the optimal policy, which can be synthesized by an efficient algorithm based on semidefinite programming, and shows that the optimal control law is a linear–Gaussian randomized policy. Expand
Sensor selection for Kalman filtering of linear dynamical systems: Complexity, limitations and greedy algorithms
TLDR
It is shown that the a priori and a posteriori error covariance-based sensor selection problems are both NP-hard, even under the additional assumption that the system is stable, and via simulations that greedy algorithms perform well in practice. Expand
Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
TLDR
An efficient randomized greedy algorithm is developed for sensor selection and guarantees on the estimator's performance in this setting are established, compared to state-of-the-art greedy and semidefinite programming relaxation methods. Expand
Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
TLDR
This paper focuses on observations that are related to a general non-linear model and forms the sensor selection problem as the design of a sparse vector, which in its original form is a nonconvex ℓ0-(quasi) norm optimization problem. Expand
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
TLDR
A stochastic sensor selection strategy that is easy to implement and is computationally tractable is described that is applied to the sensor coverage problem and the sensor selection problem, which has multiple sensors that cannot operate simultaneously. Expand
A Framework for Control System Design Subject to Average Data-Rate Constraints
TLDR
This paper develops a framework to deal with average data-rate constraints in a tractable manner that combines ideas from both information and control theories and shows that the proposed class of coding schemes can achieve mean square stability at averageData-rates that are, at most, 1.254 bits per sample away from the absolute minimum rate for stability. Expand
Rate-cost tradeoffs in control
  • V. Kostina, B. Hassibi
  • Computer Science, Mathematics
  • 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2016
TLDR
The fundamental tradeoff between the communication rate r bits/sec and the limsup of the expected cost b is studied, and a lower bound on the rate necessary to attain b is shown. Expand
...
1
2
3
...