Incorporating prior knowledge in observability-based path planning for ocean sampling

被引:5
|
作者
Lagor, Francis D. [1 ]
Ide, Kayo [2 ]
Paley, Derek A. [1 ,3 ]
机构
[1] Univ Maryland, Dept Aerosp Engn, College Pk, MD 20742 USA
[2] Univ Maryland, Dept Atmospher & Ocean Sci, College Pk, MD 20742 USA
[3] Univ Maryland, Syst Res Inst, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
Observability; Ocean sampling; Path planning; KALMAN FILTER; ASSIMILATION; NETWORKS;
D O I
10.1016/j.sysconle.2016.09.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Observability-based path planning of autonomous sampling platforms for flow estimation is a technique by which candidate trajectories are evaluated based on their ability to enhance the observability of underlying flow-field parameters. Until now, observability-based path planning has focused primarily on forward-in-time integration. We present a novel approach that makes use of the background error covariance at the current time to account properly for uncertainty of the underlying flow. The reduced Hessian of an optimal, linear data-assimilation strategy properly accounts for prior knowledge in the linear case and must be full rank to infer the initial state. The reduced Hessian represents an observability Gramian augmented with an inverse prior covariance. We extend this concept to the nonlinear case to yield a new criterion for scoring candidate trajectories: the empirical augmented unobservability index. Solving the differential covariance Riccati equation of the Kalman Filter for deterministic dynamics also properly accounts for prior knowledge in the linear case, but at a later time. The solution to this equation reveals the important distinctions between observability-based, augmented observability-based, and anticipated covariance-based path planning. Path planning based on this unobservability index in the presence of prior information yields the desired behavior in numerical experiments of a guided Lagrangian sensor in a two-vortex flow pertinent to ocean sampling. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:169 / 175
页数:7
相关论文
共 50 条
  • [21] Increasing Diversity of Solutions in Sampling-based Path Planning
    Vonasek, Vojtech
    Saska, Martin
    ICRAI 2018: PROCEEDINGS OF 2018 4TH INTERNATIONAL CONFERENCE ON ROBOTICS AND ARTIFICIAL INTELLIGENCE -, 2018, : 97 - 102
  • [22] Potential functions based sampling heuristic for optimal path planning
    Qureshi, Ahmed Hussain
    Ayaz, Yasar
    AUTONOMOUS ROBOTS, 2016, 40 (06) : 1079 - 1093
  • [23] Sampling-Based Path Planning for UAV Collision Avoidance
    Lin, Yucong
    Saripalli, Srikanth
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2017, 18 (11) : 3179 - 3192
  • [24] Reactive Sampling-Based Temporal Logic Path Planning
    Vasile, Cristian Ioan
    Belta, Calin
    2014 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2014, : 4310 - 4315
  • [25] Adaptive Path Planning for UAV-Based Pollution Sampling
    Kosior, Mateusz
    Przystalka, Piotr
    Panfil, Wawrzyniec
    APPLIED SCIENCES-BASEL, 2024, 14 (24):
  • [26] Sampling based path planning algorithm for UAV collision avoidance
    Saravanakumar, A.
    Kaviyarasu, A.
    Ashly Jasmine, R.
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2021, 46 (03):
  • [27] Sampling-based Safe Path Planning for Robotic Manipulators
    Lacevic, Bakir
    Rocco, Paolo
    2010 IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2010,
  • [28] Path planning for multimodal quadruped robots based on discrete sampling
    Sun S.-S.
    Feng C.-X.
    Zhang L.
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2024, 54 (04): : 1120 - 1128
  • [29] Sampling based path planning algorithm for UAV collision avoidance
    A Saravanakumar
    A Kaviyarasu
    R Ashly Jasmine
    Sādhanā, 2021, 46
  • [30] Sampling-based A* algorithm for robot path-planning
    Persson, Sven Mikael
    Sharf, Inna
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (13): : 1683 - 1708