Richard Anthony Valenzano

According to our database1, Richard Anthony Valenzano authored at least 25 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning reward machines: A study in partially observable reinforcement learning.
Artif. Intell., October, 2023

Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring.
CoRR, 2023

2022
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning.
J. Artif. Intell. Res., 2022

2021
Type-WA*: Using Exploration in Bounded Suboptimal Planning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
The act of remembering: a study in partially observable reinforcement learning.
CoRR, 2020

2019
Probably bounded suboptimal heuristic search.
Artif. Intell., 2019

Learning Reward Machines for Partially Observable Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
On polygon numbers of circle graphs and distance hereditary graphs.
Discret. Appl. Math., 2018

Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

Teaching Multiple Tasks to an RL Agent using LTL.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Advice-Based Exploration in Model-Based Reinforcement Learning.
Proceedings of the Advances in Artificial Intelligence, 2018

2017
A Formal Characterization of the Local Search Topology of the Gap Heuristic.
CoRR, 2017

An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

2016
Searching with a Corrupted Heuristic.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Using Metric Temporal Logic to Specify Scheduling Problems.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

On the Completeness of Best-First Search Variants That Use Random Exploration.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2014
A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Evaluating state-space abstractions in extensive-form games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Better Time Constrained Search via Randomization and Postprocessing.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Using Alternative Suboptimality Bounds in Heuristic Search.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Alternative Forms of Bounded Suboptimal Search.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

ArvandHerd: Parallel Planning with a Portfolio.
Proceedings of the ECAI 2012, 2012

2010
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010


  Loading...