Monte Carlo tree search for priced timed automata

DOI10.1007/978-3-031-16336-4_19zbMath1522.68273MaRDI QIDQ6160783

Kim Guldstrand Larsen, Jeppe Høiriis Mortensen, Andrej Kiviriga, Ulrik Nyman, Adriana Mijačika, Peter Gjøl Jensen

Publication date: 2 June 2023

Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)

Full work available at URL: https://vbn.aau.dk/da/publications/4c277232-7315-49fd-961c-645874faeb23

zbMATH Keywords

model checkingplanningMonte Carlo tree search (MCTS)priced timed automata (PTA)upper confidence bounds for trees (UCT)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic job-shop scheduling: Past, present and future
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Model-checking precision agriculture logistics: the case of the differential harvest
• On the optimal reachability problem of weighted timed automata
• Symbolic Optimal Reachability in Weighted Timed Automata
• Formal Methods for Components and Objects

This page was built for publication: Monte Carlo tree search for priced timed automata