Lookup NU author(s): Fedor Shmarov,
Dr Paolo Zuliani
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Many practical applications (e.g., plannning for cyberphysical systems) require reasoning about hybrid domains that contain both probabilistic and nondeterministic parametric uncertainty. In general, this is an undecidable problem. We use δ-satisfiability to sidestep undecidability, and we develop an algorithm that computes an enclosure for the range of probability of reaching a goal region in a given number of discrete steps. We utilize SMT techniques that enable reasoning in a safe way, i.e., the computed enclosure is formally guaranteed to contain the reachability probability. We demonstrate the usefulness of our technique on challenging nonlinear hybrid domains.
Author(s): Shmarov F, Zuliani P
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: AAAI Workshop - Technical Report
Year of Conference: 2016
Online publication date: 29/03/2016
Acceptance date: 01/01/1900
Publisher: AI Access Foundation
Library holdings: Search Newcastle University Library for this item