A UCB-based Tree Search Approach to Joint Verification-Correction Strategy for Large Scale Systems

by   Peng Xu, et al.

Verification planning is a sequential decision-making problem that specifies a set of verification activities (VA) and correction activities (CA) at different phases of system development. While VAs are used to identify errors and defects, CAs also play important roles in system verification as they correct the identified errors and defects. However, current planning methods only consider VAs as decision choices. Because VAs and CAs have different activity spaces, planning a joint verification-correction strategy (JVCS) is still challenging, especially for large-size systems. Here we introduce a UCB-based tree search approach to search for near-optimal JVCSs. First, verification planning is simplified as repeatable bandit problems and an upper confidence bound rule for repeatable bandits (UCBRB) is presented with the optimal regret bound. Next, a tree search algorithm is proposed to search for feasible JVCSs. A tree-based ensemble learning model is also used to extend the tree search algorithm to handle local optimality issues. The proposed approach is evaluated on the notional case of a communication system.


page 6

page 7

page 10

page 12

page 13

page 19

page 21

page 23


A Parallel Tempering Approach for Efficient Exploration of the Verification Tradespace in Engineered Systems

Verification is a critical process in the development of engineered syst...

Limited depth bandit-based strategy for Monte Carlo planning in continuous action spaces

This paper addresses the problem of optimal control using search trees. ...

Tree search algorithms for the Sequential Ordering Problem

We present a study of several generic tree search techniques applied to ...

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

There has been a lot of recent work on Bayesian methods for reinforcemen...

Gaussian Process Bandits for Tree Search: Theory and Application to Planning in Discounted MDPs

We motivate and analyse a new Tree Search algorithm, GPTS, based on rece...

Open Loop Execution of Tree-Search Algorithms

In the context of tree-search stochastic planning algorithms where a gen...

Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)

Weighted A* (wA*) is a widely used algorithm for rapidly, but suboptimal...

Please sign up or login with your details

Forgot password? Click here to reset