Modified value iteration algorithm and Dynamic Element Matching based MDP for Distributed data fusion and sensor management
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, considering the problem of collaborative sensor management and data fusion for multitarget tracking, authors propose an altered version of a classical Value Iteration algorithm, one of the most commonly used techniques to calculate the optimal policy for Markov decision processes (MDPs). Dynamic element matching (DEM) algorithms, widely used for reducing harmonic distortion in Digital-to-Analog converters, are used as a core element in the modified algorithm. In this paper, the authors also introduce and demonstrate a number of new performance metrics, to verify the effectiveness of an MDP policy, especially useful for quantifying the impact of the modified DEM-based value iteration algorithm on an MDP policy. The new algorithm is applied to control a group of UAVs carrying out surveillance over a region that includes a number of moving targets with the objective to maximize the information obtained and to track as many targets as possible with the maximum possible accuracy. Simulation results show a clear improvement in performance compared to the classical algorithm. The proposed method demonstrated robust performance while guaranteeing polynomial computational complexity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it