Computing budget allocation for optimization of sensor processing order in sequential multi-sensor fusion algorithms
Because target tracking is a stochastic process, comparison of different tracking algorithms or parameter sets within one algorithm relies on time-consuming and computationally demanding simulations. In this paper we present a method to minimize simulation time, yet to achieve a desirable confidence...
Uloženo v:
| Vydáno v: | Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) Ročník 3; s. 1841 - 1847 vol.3 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
2001
|
| Témata: | |
| ISBN: | 9780780364950, 0780364953 |
| ISSN: | 0743-1619 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Because target tracking is a stochastic process, comparison of different tracking algorithms or parameter sets within one algorithm relies on time-consuming and computationally demanding simulations. In this paper we present a method to minimize simulation time, yet to achieve a desirable confidence of the obtained results by applying ordinal optimization and computing budget allocation ideas and techniques. The developed method is applied to optimization of sensor processing order in sequential multisensor fusion algorithms. |
|---|---|
| ISBN: | 9780780364950 0780364953 |
| ISSN: | 0743-1619 |
| DOI: | 10.1109/ACC.2001.946004 |

