Disturbance-Aware Informative Planning in Spatiotemporal Environments
Authors: Kaleb Ben Naveed, Haejoon Lee, Anouck Girard, Dimitra Panagou
Organizations: Department of Robotics, University of Michigan, Ann Arbor · Embry-Riddle Aeronautical University · Department of Robotics, Department of Aerospace Engineering, University of Michigan, Ann Arbor
Autonomous robots are widely used for persistent monitoring of spatiotemporal environments, where quantities of interest (QoI) change across space and time and require repeated measurements. In practice, robot motion can be affected by external disturbances that vary across the environment. When such external disturbances are not considered in trajectory optimization, it can lead to inaccurate predictions of robot motion and, consequently, the information acquired about the QoI during execution. However, estimating disturbances throughout the environment can be inefficient, as disturbances in regions with little overlap with monitoring trajectories have limited impact on monitoring performance. We therefore propose a two-stage informative planning framework for unknown, spatially varying but time-invariant disturbances, combining informed disturbance sampling with disturbance-aware trajectory optimization. First, we identify where QoI measurements are needed and generate alternative paths to these locations using the environment geometry. We then prioritize disturbance measurements based on their expected reduction of disturbance uncertainty along these paths. Second, rather than optimizing information acquisition based on nominal robot motion, we incorporate the learned disturbance belief into trajectory optimization to account for its effects on robot motion and information acquisition. Across four simulation scenarios, the proposed method reduces disturbance-learning time by 25.0--52.3 percent compared with environment-wide estimation and identifies paths that appear costly under nominal dynamics but become preferable when disturbances are considered.
Figures & tables
Figure 1: Overview of monitoring-informed disturbance estimation and disturbance-aware informative planning.
Figure 2: Monitoring across four scenarios. Top: environments and proposed trajectories; bottom: mean clarity-deficit histories for all methods. Comparison durations are 532 , 560 , 544 , and 514s for Scenarios 1–4, respectively.
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
Method
Scenario 1
Scenario 2
Scenario 3
Scenario 4
T=532s
T=560s
T=544s
T=514s
B1
Contact: 4.4 s
Contact: 15.6 s
Contact: 4.8 s
0.181 (0.161)
B2
0.293 (0.366)
0.301 (0.367)
0.078 (0.081)
0.180 (0.180)
B3
0.224 (0.280)
0.221 (0.267)
0.047 (0.035)
0.186 (0.184)
B4
Contact: 399.0 s
0.190 (0.156)
0.054 (0.040)
0.221 (0.177)
Proposed
0.166 (0.146)
0.177 (0.171)
0.042 (0.027)
0.189 (0.189)
Appendix
Table 1: Monitoring performance: DT , with final deficit D(T) in parentheses. Bold indicates the lowest DT among completed runs; contact times are reported for terminated runs.
Scenario
B4 (s)
Proposed (s)
Reduction
1
240
180
25.0%
2
370
200
45.9%
3
244
124
49.2%
4
214
102
52.3%
Appendix
Table 2: Dedicated wind-estimation time.
Figure 3: The four evaluation environments. Scenarios 1 and 2 test alternative passages under opposing wind; Scenario 3 has two monitoring regions within a larger workspace; Scenario 4 has a largely calm monitoring region. The lower-left and lower-right panels correspond to Scenarios 3 and 4 in the main text; their embedded labels are reversed.
Figure 4: Trajectories of the proposed method and baselines, with rows corresponding to Scenarios 1–4 in the main text. The embedded labels in the final two rows are reversed. Runs ending in contact are terminated, not completed comparisons; Table 1 reports the numerical results.
Informative path planning chooses robot routes and sensing actions that gather useful information while respecting travel, energy, time, and safety constraints.
We present a provably safe sampling-based motion planning algorithm for robotic systems affected by random disturbances of unknown distribution. We consider systems with linear or linearizable dynamics evolving in workspace with arbitrary-shaped obstacles subject to state and control constraints. Safety requirements are formulated as chance-constraints. Our approach leverages data from trajectories of the system to learn a Wasserstein ambiguity tube, i.e., a sequence of ambiguity sets, which contains the trajectory of the system's state distribution with high confidence. This ambiguity tube is then used in a probabilistically complete algorithm to grow a sampling-based motion planning tree that respects the constraints of the problem. We show that learning several lower-dimensional ambiguity tubes instead of a single high-dimensional one effectively reduces the conservatism and boosts scalability. Additionally, we design an efficient bandit-based validity checker that remarkably increases the empirical performance of our approach without sacrificing probabilistic completeness. Case studies show our algorithm finds valid plans in cluttered environments under strict safety thresholds, outperforming state-of-the-art methods.
Ibon Gracia, Qi Heng Ho, Luca Laurenti +1
Department of Aerospace Engineering Sciences at the University of Colorado Boulder, CO, USA · Department of Aerospace and Ocean Engineering, Virginia Tech, VA, USA · Delft University of Technology, the Netherlands, and the Italian Institute of Artificial Intelligence, Italy
For autonomous space exploration, robotic agents need to perform motion planning in which environmental interactions may be unknown. Learning these interactions, such as terrain mechanics for wheeled robots, can introduce uncertainties that lead to risky motion plans and potentially hazardous operations or mission failures. Moreover, uncertainties induced by perception-based systems can exacerbate the problem of safe motion planning. In this letter, we address the problem of performing cost-optimal kinodynamic motion planning with risk awareness. We approach this in two steps. First, a sampling-based planner (AO-RRT) generates a dynamically feasible, risk-aware, and asymptotically cost-optimal trajectory. Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution. By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over ∼97% across trajectories in simulation and hardware experiments.
Disturbances encountered during autonomous navigation generally vary across space, often discontinuously, as obstacles redirect wind and changing terrain alters traction. Tracking controllers typically assume sufficient control authority to mitigate disturbances and maintain safety; the regime where this assumption fails remains underexplored. We present Belief-guided Residual Adaptive Control (BRACE), a hierarchical reinforcement learning (RL) framework for reach-avoid navigation under unknown, bounded, spatially varying disturbances. BRACE infers a disturbance belief from model prediction errors and uses that to condition a high-level policy that adapts the reference trajectory. The policy combines a nominal and a belief-guided residual term, trained jointly with a likelihood-ratio advantage reweighting heuristic. We evaluate BRACE in three simulated quadcopter environments with abruptly switching wind fields, and validate it on Crazyflie hardware with fan-generated disturbances. Across these settings, BRACE improves reach-avoid performance over model predictive control and RL baselines.
Jaeyoun Choi, Niklas Schmid, Oswin So +2
Reliable Autonomous Systems Lab, Massachusetts Institute of Technology, Cambridge, MA 02139, USA · Automatic Control Laboratory (IfA), ETH Zürich, 8092 Zürich, Switzerland