Skip to content
arXiv Robotics — research abstracts· Negin Musavi, Gokul Puthumanaillam, Ruben Hernandez, William Schafer, Melkior Ornik·· 2 days agoSignalEditorial score75

When Should a Robot Replan? Regret-Guided Update Scheduling in Time-Varying MDPs

When Should a Robot Replan? Regret-Guided Update Scheduling in Time-Varying MDPs

Summary

Robots operating in non-stationary environments must adapt their policies as dynamics drift, but limited onboard energy and compute constrain how often full state estimation and re-planning can occur. This work formulates the problem within time-varying Markov decision processes (TVMDPs) with a known bound on transition drift rate, modeling execution via a skip-update scheme where the agent estimates the transition kernel by maximum likelihood at chosen update times and reuses the policy between updates under propagated state estimates. The authors analyze dynamic regret growth during skip intervals and derive an online, regret-guided update rule that adaptively allocates the budget. Evaluation in simulated Mars-rover navigation with time-varying slip dynamics and on a Crazyflie quadrotor in indoor obstacle fields shows adaptive allocation outperforms other budgeted baselines.

Editorial context

The authors propose a regret-guided update scheduling method for robots operating in non-stationary environments, demonstrating adaptive budget allocation in simulated Mars-rover navigation and Crazyflie quadrotor tasks.

Source: arXiv Robotics — research abstracts · Read original article ↗

Loading article text…

What the source reports

Publisher-reported claims, with original evidence. These results have not been independently verified by RoboSignal.

Environment
SimulationOpen source S4
  • paper: not_reported
  • code: not_reported
  • weights: not_reported
  • dataset: not_reported
Source excerpts and review record

Automatically extracted; no manual editorial approval recorded.

intervals in terms of the properties of the TVMDP and the skip lengths; the resulting bound answers the opening question via an online, regret-guided update rule that allocates the budget adaptively. We evaluate the rule in a simulated Mars-rover navigation task with time-varying slip dynamics and on a Crazyflie quadrotor in indoor obstacle fields. Adaptive allocation outperforms other budgeted baselines.

Open source S4

Source:arXiv Robotics — research abstracts · arxiv.org

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).