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 条
  • [21] Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks
    Mao, Xufei
    Liu, Yunhao
    Tang, Shaojie
    Liu, Huafu
    Han, Jiankang
    Li, Xiang-Yang
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (12) : 2396 - 2406
  • [22] An Approach to Construct Weighted Minimum Spanning Tree in Wireless Sensor Networks
    Saha, Soumya
    McLauchlan, Lifford
    SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2015, 569 : 69 - 84
  • [23] Blocking Vulnerable Paths of Wireless Sensor Networks
    Zhou, Shu
    Wu, Min-You
    Shu, Wei
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
  • [24] Study on blind paths in wireless sensor networks
    Han Peng
    Chen Xun
    Chen Haiguang
    Gao Chuanshan
    2006 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-4, 2006, : 1101 - 1104
  • [25] Incremental algorithm for finding disjoint paths in sensor networks
    Zhang, Ke-Jia
    Gao, Hong
    Tongxin Xuebao/Journal on Communications, 2010, 31 (9 A): : 59 - 67
  • [26] Lightweight Construction of the Information Potential Field in Wireless Sensor Networks
    Du, Junzhao
    Liu, Sicong
    Xu, Chi
    Wang, Kai
    Liu, Hui
    Sha, Kewei
    2014 23RD INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN), 2014,
  • [27] Wireless Sensor Network Clustering Based on Minimum Energy Paths
    Cui, Guangcai
    Fang, Jingjing
    Wang, Shanshan
    Yang, Yudong
    INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING BIOMEDICAL ENGINEERING, AND INFORMATICS (SPBEI 2013), 2014, : 174 - 184
  • [28] Finding Degree Constrained k-Cardinality Minimum Spanning Trees for Wireless Sensor Networks
    Adasme, Pablo
    Soto, Ismael
    Seguel, Fabian
    MOBILE WEB AND INTELLIGENT INFORMATION SYSTEMS (MOBIWIS 2018), 2018, 10995 : 51 - 62
  • [29] New minimum exposure path problem and its solving algorithm in wireless sensor networks
    Ye M.
    Wang Y.-P.
    Dai C.
    Wang X.-L.
    Tongxin Xuebao/Journal on Communications, 2016, 37 (01):
  • [30] An Approach to Finding Weak Regions for Wireless Sensor Networks with Arbitrary Sensing Areas
    Fan, Gaojun
    Jin, Shiyao
    Cheng, Wei
    MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2008, : 445 - +