Refine your search

  • Books (6)

to

Custom price range (£)

to

Random Disambiguation Paths Models by Xugang (6 results)

Author: 
Title: 
Refine with Advanced Search
  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    £ 44.03

    £ 58.28 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: 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.…

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Softcover

    Seller: Mispah books, Redhill, SURRE, United KingdomMispah books

    4-star seller
    Contact seller

    Condition: Used - As new

    £ 133.00

    £ 25.00 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Language: English

    Published by LAP LAMBERT Academic Publishing Dez 2011, 2011

    384653174X / 9783846531747

    • Softcover
    • Print on Demand

    Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

    5-star seller
    Contact seller

    Condition: New

    £ 50.59

    £ 19.15 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Taschenbuch. Condition: 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.…

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 50.59

    £ 29.14 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: 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.…

  • Language: English

    Published by LAP LAMBERT Academic Publishing, 2011

    384653174X / 9783846531747

    • Softcover
    • Print on Demand

    Seller: moluna, Greven, Germanymoluna

    5-star seller
    Contact seller

    Condition: New

    £ 41.59

    £ 40.78 shipping 
    Ships from Germany to U.S.A.

    Quantity: Over 20 available

    Condition: 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.…

  • Language: English

    Published by LAP LAMBERT Academic Publishing Dez 2011, 2011

    384653174X / 9783846531747

    • Softcover
    • Print on Demand

    Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

    5-star seller
    Contact seller

    Condition: New

    £ 50.59

    £ 49.95 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: 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.…