Rick Valenzano
Titel
Zitiert von
Zitiert von
Jahr
Evaluating state-space abstractions in extensive-form games
M Johanson, N Burch, R Valenzano, M Bowling
Proceedings of the 2013 international conference on Autonomous agents and …, 2013
822013
Using reward machines for high-level task specification and decomposition in reinforcement learning
RT Icarte, T Klassen, R Valenzano, S McIlraith
International Conference on Machine Learning, 2107-2116, 2018
642018
Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms
RA Valenzano, N Sturtevant, J Schaeffer, K Buro, A Kishimoto
Twentieth International Conference on Automated Planning and Scheduling, 2010
592010
Teaching multiple tasks to an RL agent using LTL
R Toro Icarte, TQ Klassen, R Valenzano, SA McIlraith
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
562018
Arvandherd: Parallel planning with a portfolio
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
ECAI 2012, 786-791, 2012
452012
LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning.
A Camacho, RT Icarte, TQ Klassen, RA Valenzano, SA McIlraith
IJCAI 19, 6065-6073, 2019
442019
A comparison of knowledge-based GBFS enhancements and knowledge-free exploration
RA Valenzano, NR Sturtevant, J Schaeffer, F Xie
Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014
392014
Using alternative suboptimality bounds in heuristic search
R Valenzano, SJ Arfaee, J Thayer, R Stern, N Sturtevant
Proceedings of the International Conference on Automated Planning and …, 2013
212013
Learning reward machines for partially observable reinforcement learning
R Toro Icarte, E Waldie, T Klassen, R Valenzano, M Castro, S McIlraith
Advances in Neural Information Processing Systems 32, 15523-15534, 2019
202019
Arvand: the art of random walks
H Nakhost, M Müller, R Valenzano, F Xie
The, 15-16, 2011
182011
Advice-based exploration in model-based reinforcement learning
RT Icarte, TQ Klassen, RA Valenzano, SA McIlraith
Canadian Conference on Artificial Intelligence, 72-83, 2018
112018
Better time constrained search via randomization and postprocessing
F Xie, R Valenzano, M Müller
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
112013
On the completeness of best-first search variants that use random exploration
R Valenzano, F Xie
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
92016
Worst-case solution quality analysis when not re-expanding nodes in best-first search
R Valenzano, N Sturtevant, J Schaeffer
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
92014
Arvandherd 2014
R Valenzano, H Nakhost, M Müller, J Schaeffer, N Sturtevant
The Eighth International Planning Competition. Description of Participant …, 2014
72014
Probably bounded suboptimal heuristic search
R Stern, G Dreiman, R Valenzano
Artificial Intelligence 267, 39-57, 2019
52019
Searching for Markovian subproblems to address partially observable reinforcement learning
RT Icarte, E Waldie, TQ Klassen, R Valenzano, MP Castro, SA McIlraith
Proceedings of the 4th Multi-disciplinary Conference on Reinforcement …, 2019
42019
Using metric temporal logic to specify scheduling problems
R Luo, RA Valenzano, Y Li, JC Beck, SA McIlraith
Fifteenth International Conference on the Principles of Knowledge …, 2016
42016
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
RT Icarte, TQ Klassen, R Valenzano, SA McIlraith
arXiv preprint arXiv:2010.03950, 2020
32020
An analysis and enhancement of the gap heuristic for the pancake puzzle
RA Valenzano, DS Yang
Tenth Annual Symposium on Combinatorial Search, 2017
32017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20