2020 IEEE International Conference on Communications Workshops (ICC Workshops) 2020
DOI: 10.1109/iccworkshops49005.2020.9145208
|View full text |Cite
|
Sign up to set email alerts
|

Information-Criterion-Based Agent Selection for Cooperative Localization in Static Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…When dealing with large networks, full cooperation is sometimes not wanted, due to resource limitations with regard to energy consumption, measurement time, and computational power. In these cases, selecting highly informative cooperating partners can be essential since at some point increasing the set of cooperating partners does not increase the positioning performance any more [11], [37], [38]. For range-based CL, there exists a variety of different approaches like convex optimization [20] or a fully Bayesian treatment of the problem as in [8], [39]- [43].…”
Section: A State Of the Art And Related Workmentioning
confidence: 99%
“…When dealing with large networks, full cooperation is sometimes not wanted, due to resource limitations with regard to energy consumption, measurement time, and computational power. In these cases, selecting highly informative cooperating partners can be essential since at some point increasing the set of cooperating partners does not increase the positioning performance any more [11], [37], [38]. For range-based CL, there exists a variety of different approaches like convex optimization [20] or a fully Bayesian treatment of the problem as in [8], [39]- [43].…”
Section: A State Of the Art And Related Workmentioning
confidence: 99%
“…TD methods use a generalized policy iteration (GPI) mechanism to alternatively estimate the optimal policy in (1) and the optimal Q-value in (3). Choose a greedy action a k ∈ A corresponds to the maximum Q-value in Q(s k , :); (exploitation) end UAV moves to the new state, collects the reward r k+1 and updates the Q-table according to (12). end…”
Section: State Estimator: Mapping With Ogmentioning
confidence: 99%
“…In [5], an information-seeking algorithm is developed for extraterrestrial exploration and return-to-base application, whereas in [8,9] a similar problem is solved using RL for source localization. Algorithms for UAVs formation, navigation and self-localization have been proposed in [10][11][12][13][14], and RL for enhancing communications has been studied in [15][16][17][18].…”
Section: Introductionmentioning
confidence: 99%
“…When dealing with large networks, full cooperation is sometimes not wanted, due to resource limitations with regard to energy consumption, measurement time, and computational power. In these cases, selecting highly informative cooperating partners can be essential since at some point increasing the set of cooperating partners does not increase the positioning performance any more [11], [37], [38]. For range-based CL, there exists a variety of different approaches like convex optimization [20] or a fully Bayesian treatment of the problem as in [8], [39]- [43].…”
Section: A State Of the Art And Related Workmentioning
confidence: 99%