Shackling Uncertainty using Mixed Criticality in Monte-Carlo Tree Search
Franco Cordeiro, Samuel Tardieu, Laurent Pautet

TL;DR
This paper extends Monte Carlo Tree Search with Mixed Criticality concepts to better handle uncertain resource costs in embedded systems, improving decision-making under uncertainty across multiple resources.
Contribution
It introduces a novel $(MC)^2TS$ algorithm that incorporates mixed criticality and multiple resource considerations into MCTS for uncertain environments.
Findings
$(MC)^2TS$ outperforms traditional MCTS in active perception tasks.
The approach effectively manages uncertain costs for high- and low-criticality tasks.
Extends mixed criticality concepts to multiple resources beyond execution time.
Abstract
In the world of embedded systems, optimizing actions with the uncertain costs of multiple resources is a complex challenge. Existing methods include plan building based on Monte Carlo Tree Search (MCTS), an approach that thrives in multiple online planning scenarios. However, these methods often overlook uncertainty in worst-case cost estimations. A system can fail to operate before achieving a critical objective when actual costs exceed optimistic worst-case estimates. Conversely, a system based on pessimistic worst-case estimates would lead to resource over-provisioning even for less critical objectives. To solve similar issues, the Mixed Criticality (MC) approach has been developed in the real-time systems community. In this paper, we propose to extend the MCTS heuristic in three directions. Firstly, we reformulate the concept of MC to account for uncertain worst-case costs.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSimulation Techniques and Applications · AI-based Problem Solving and Planning
