Optimal paths for avoiding a radiating source

被引:0
|
作者
Pachter, LS [1 ]
Pachter, M [1 ]
机构
[1] Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of navigating between points in the plane so as to minimize the exposure to a radiating source. Specifically, given two points z(1), z(2) in the complex plane, we solve the problem of finding the path C(t) (0 less than or equal to t less than or equal to 1) such that C(0) = z(1), C(1) = z(2) and integral(0)(1) [C-1(t)]/[C(t)](k) dt is minimized. The parameter k specializes to a number of interesting cases: in particular k = 2 pertains to the passive sensor avoidance problem and k = 4 entails the active radar avoidance problem. The avoidance paths which minimize exposure may have infinite arc-length. To overcome this problem we introduce a weighted exposure and path length optimization problem whose solution requires a variational approach. The optimal trajectory results we obtain are surprisingly intuitive in the cases of interest.
引用
收藏
页码:3581 / 3586
页数:6
相关论文
共 50 条
  • [1] Optimal self-avoiding paths in dilute random medium
    Seno, F
    Stella, AL
    Vanderzande, C
    PHYSICAL REVIEW E, 1997, 55 (04): : 3859 - 3864
  • [3] OPTIMAL RECOVERY OF A RADIATING SOURCE WITH MULTIPLE FREQUENCIES ALONG ONE LINE
    Brander, Tommi
    Ilmavirta, Joonas
    Piiroinen, Petteri
    Tyni, Teemu
    INVERSE PROBLEMS AND IMAGING, 2020, 14 (06) : 967 - 983
  • [4] Simple Paths and Cycles Avoiding Forbidden Paths
    Momege, Benjamin
    SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 285 - 294
  • [5] APPROXIMATE SHORTEST PATHS AVOIDING A FAILED VERTEX : OPTIMAL SIZE DATA STRUCTURES FOR UNWEIGHTED GRAPHS
    Khanna, Neelesh
    Baswana, Surender
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 513 - 524
  • [6] On the complexity of paths avoiding forbidden pairs
    Kolman, Petr
    Pangrac, Ondrej
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (13) : 2871 - 2876
  • [7] Avoiding bottlenecks in networks by short paths
    Levi, Chen
    Segal, Michael
    TELECOMMUNICATION SYSTEMS, 2021, 76 (04) : 491 - 503
  • [8] Linkages and removable paths avoiding vertices
    Du, Xiying
    Li, Yanjia
    Xie, Shijie
    Yu, Xingxing
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 169 : 211 - 232
  • [9] Shortest paths avoiding forbidden subpaths
    Ahmed, Mustaq
    Lubiw, Anna
    NETWORKS, 2013, 61 (04) : 322 - 334
  • [10] Avoiding bottlenecks in networks by short paths
    Chen Levi
    Michael Segal
    Telecommunication Systems, 2021, 76 : 491 - 503