Improved Safe Real-time Heuristic Search

05/15/2019
by   Bence Cserna, et al.
0

A fundamental concern in real-time planning is the presence of dead-ends in the state space, from which no goal is reachable. Recently, the SafeRTS algorithm was proposed for searching in such spaces. SafeRTS exploits a user-provided predicate to identify safe states, from which a goal is likely reachable, and attempts to maintain a backup plan for reaching a safe state at all times. In this paper, we study the SafeRTS approach, identify certain properties of its behavior, and design an improved framework for safe real-time search. We prove that the new approach performs at least as well as SafeRTS and present experimental results showing that its promise is fulfilled in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2014

Avoiding and Escaping Depressions in Real-Time Heuristic Search

Heuristics used for solving hard real-time search problems have regions ...
research
02/14/2021

FaSTrack: a Modular Framework for Real-Time Motion Planning and Guaranteed Safe Tracking

Real-time, guaranteed safe trajectory planning is vital for navigation i...
research
10/22/2018

Mean-based Heuristic Search for Real-Time Planning

In this paper, we introduce a new heuristic search algorithm based on me...
research
06/15/2020

Neural Certificates for Safe Control Policies

This paper develops an approach to learn a policy of a dynamical system ...
research
02/27/2013

Epsilon-Safe Planning

We introduce an approach to high-level conditional planning we call epsi...
research
05/02/2020

Learning Model Predictive Control for Competitive Autonomous Racing

The goal of this thesis is to design a learning model predictive control...
research
02/20/2023

Probabilistic WCET Estimation for Weakly Hard Real-Time Systems

Weakly hard real-time systems can, to some degree, tolerate deadline mis...

Please sign up or login with your details

Forgot password? Click here to reset