A Potential Field Approach to Finding Minimum-Exposure Paths in Wireless Sensor Networks

被引:19
|
作者
Ferrari, S. [1 ]
Foderaro, G. [1 ]
机构
[1] Duke Univ, Dept Mech Engn & Mat Sci, Lab Intelligent Syst & Control, Durham, NC 27708 USA
关键词
UNDERWATER VEHICLES;
D O I
10.1109/ROBOT.2010.5509193
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A novel artificial-potential approach is presented for planning the minimum-exposure paths of multiple vehicles in a dynamic environment containing multiple mobile sensors, and multiple fixed obstacles. This approach presents several advantages over existing techniques, such as the ability of computing multiple minimum-exposure paths online, while avoiding mutual collisions, as well as collisions with obstacles sensed during the motion. Other important advantages include the ability of utilizing heterogenous sensor models, and of meeting multiple objectives, such as minimizing power required, and reaching a set of goal configurations. The approach is demonstrated through numerical simulations involving autonomous underwater vehicles (AUVs) deployed in a region of interest near the New Jersey coast, with ocean currents simulated using real coastal ocean dynamics applications radar (CODAR) data.
引用
收藏
页码:335 / 341
页数:7
相关论文
共 50 条
  • [1] OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
    Kejia Zhang
    Qilong Han
    Guisheng Yin
    Haiwei Pan
    Journal of Combinatorial Optimization, 2016, 31 : 1623 - 1641
  • [2] OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
    Zhang, Kejia
    Han, Qilong
    Yin, Guisheng
    Pan, Haiwei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1623 - 1641
  • [3] Coverage and exposure paths in wireless sensor networks
    Huang, Liu-Sheng
    Xu, Hong-Li
    Wang, Yang
    Wu, Jun-Min
    Li, Hong
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (04) : 490 - 495
  • [4] Coverage and Exposure Paths in Wireless Sensor Networks
    Liu-Sheng Huang
    Hong-Li Xu
    Yang Wang
    Jun-Min Wu
    Hong Li
    Journal of Computer Science and Technology, 2006, 21 : 490 - 495
  • [5] OFDP: A Distributed Algorithm for Finding Disjoint Paths with Minimum Total Energy Cost in Wireless Sensor Networks
    Zhang, Kejia
    Gao, Hong
    Yin, Guisheng
    Han, Qilong
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2014, 2014, 8491 : 694 - 705
  • [6] A localized algorithm for finding disjoint paths in wireless sensor networks
    Hou, Ronghui
    Shi, Haoshan
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (12) : 807 - 809
  • [7] Finding sensing coverage and breach paths in wireless sensor networks
    Onur, E
    Ersoy, C
    Deliç, H
    PROCEEDINGS OF THE IEEE 12TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE, 2004, : 692 - 695
  • [8] Finding barriers with minimum number of sensors in wireless sensor networks
    He, Jun
    Shi, Hongchi
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [9] Efficient computation of minimum exposure paths in a sensor network field
    Djidjev, Hristo N.
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS, 2007, 4549 : 295 - 308
  • [10] Approximation Algorithms for Computing Minimum Exposure Paths in a Sensor Field
    Djidjev, Hristo N.
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2010, 7 (03)