A Method of Call-Search for UUV to Search Markovian Motion Target


The target motion is described by the model of discretestate, discrete-time markov chain. According to hospitability map of bathygram, the target's probabilistic state transition matrix is figured out. On the basis of target's initial distribution and state transition matrix, unmanned underwater vehicle continuously estimates and updates the the target's present state, uses a new greedy algorithm to get the optimum searching paths. This new searching method is proved by the results of simulation in the end, and is worthful for the tactics of unmanned underwater vehicle.

  • Abstract
  • Keywords
  • 1. Introduction
  • 2. The Definition of Markov Chain
  • 3. The Model of Target's Position Predicition
  • 4. Search Algorithm
  • 5. Simulation
  • 6. Conclusion and Future Work
  • Acknowledgments
  • References
Topics: Motion

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In