Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Filtrar
Mais filtros

Base de dados
Ano de publicação
Tipo de documento
País de afiliação
Intervalo de ano de publicação
1.
Sensors (Basel) ; 12(2): 1930-49, 2012.
Artigo em Inglês | MEDLINE | ID: mdl-22438746

RESUMO

Water monitoring is important in domains including documenting climate change, weather prediction and fishing. This paper presents a simple and energy efficient localization strategy for near surface buoy based sensors. Sensors can be dropped randomly in the ocean and thus self-calibrate in terms of geographic location such that geo-tagged observations of water quality can be made without the need for costly and energy consuming GPS-hardware. The strategy is based on nodes with an accurate clock and light sensors that can regularly sample the level of light intensity. The measurements are fitted into a celestial model of the earth motion around the sun. By identifying the trajectory of the sun across the skies one can accurately determine sunrise and sunset times, and thus extract the longitude and latitude of the sensor. Unlike previous localization techniques for underwater sensors, the current approach does not rely on stationary or mobile reference points.


Assuntos
Monitoramento Ambiental/instrumentação , Sistemas de Informação Geográfica/instrumentação , Tecnologia de Sensoriamento Remoto/instrumentação , Luz Solar , Transdutores , Água , Desenho de Equipamento , Análise de Falha de Equipamento
2.
Rep U S ; 2015: 2072-2078, 2015.
Artigo em Inglês | MEDLINE | ID: mdl-27004130

RESUMO

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into existing optimal planners, such as PRM*, RRT*, and FMT*. The objective of this paper is to fill this gap. Specifically, this paper presents a bi-directional, sampling-based, asymptotically-optimal algorithm named Bi-directional FMT* (BFMT*) that extends the Fast Marching Tree (FMT*) algorithm to bidirectional search while preserving its key properties, chiefly lazy search and asymptotic optimality through convergence in probability. BFMT* performs a two-source, lazy dynamic programming recursion over a set of randomly-drawn samples, correspondingly generating two search trees: one in cost-to-come space from the initial configuration and another in cost-to-go space from the goal configuration. Numerical experiments illustrate the advantages of BFMT* over its unidirectional counterpart, as well as a number of other state-of-the-art planners.

SELEÇÃO DE REFERÊNCIAS
Detalhe da pesquisa