For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called “CR”, in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A* algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal? This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it’s a realizable stratergy.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Xugang Ye is a research fellow at the Natinal Institutes of Health. Hereceived his Ph.D. in Applied Mathematics and Statistics from the Johns Hopkins University in Dec. 2008. His research intersts include operations research, statistics and machine learning.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called CR , in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it s a realizable stratergy. 136 pp. Englisch. Codice articolo 9783846531747
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called CR , in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it s a realizable stratergy. Codice articolo 9783846531747
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ye XugangXugang Ye is a research fellow at the Natinal Institutes of Health. Hereceived his Ph.D. in Applied Mathematics and Statistics from the Johns Hopkins University in Dec. 2008. His research intersts include operations research. Codice articolo 5497116
Quantità: Più di 20 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. pp. 136. Codice articolo 2698359794
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 136 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Codice articolo 95118893
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 136. Codice articolo 1898359800
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -For a RDP problem, the central issue is to optimize the navigation/disambiguation protocol. In this study, we explore the idea of the dynamic shortest path algorithm for the planning and re-planning. We proposed a protocol called 'CR', in which the uncertainty is incorporated into the cost function. We have proved in simple theoretical setting that this strategy is optimal. We have implemented this strategy using dynamic A\* algorithm and extensive simulation results appear to be very promising. Given a good protocol at hand, an important question is: does a better sensor imply a better traversal This is the sensor information monotonicity problem that we have investigated thoroughly. Under some simple theoretical settings, we found that the CR-protocol can be proved to have the monotonicity property. For more realistic scenarios, we performed large scale Monte Carlo Simulations. The statistics still show amazing Monotonicity results. This finding is sensible for the decision making of the sensor deployment. For the CR protocol, empirically, it's a realizable stratergy.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 136 pp. Englisch. Codice articolo 9783846531747
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Random Disambiguation Paths: Models, Algorithms, and Analysis | Exploring the methodologies for traversing mapped uncertain terrain under optimized navigation/disambiguation protocols | Xugang Ye | Taschenbuch | 136 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846531747 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Codice articolo 106706644
Quantità: 5 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA758384653174X5
Quantità: 1 disponibili