Shahaf S. Shperberg

Orcid: 0000-0001-7683-3031

According to our database1, Shahaf S. Shperberg authored at least 40 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adaptive Curriculum Learning With Successor Features for Imbalanced Compositional Reward Functions.
IEEE Robotics Autom. Lett., June, 2024

A collective AI via lifelong learning and sharing at the edge.
Nat. Mac. Intell., 2024

On Parallel External-Memory Bidirectional Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

On the Properties of All-Pair Heuristics.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Planning and Acting While the Clock Ticks.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Relaxed Exploration Constrained Reinforcement Learning.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Minimizing State Exploration While Searching Graphs with Unknown Obstacles.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Conflict-tolerant and conflict-free multi-agent meeting.
Artif. Intell., September, 2023

Enhancing Numeric-SAM for Learning with Few Observations.
CoRR, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Model-Based Meta Automatic Curriculum Learning.
Proceedings of the Conference on Lifelong Learning Agents, 2023

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

A Formal Metareasoning Model of Concurrent Planning and Execution.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Learning a Shield from Catastrophic Action Effects: Never Repeat the Same Mistake.
CoRR, 2022

When to Commit to an Action in Online Planning and Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

A Rule-based Shield: Accumulating Safety Rules from Catastrophic Action Effects.
Proceedings of the Conference on Lifelong Learning Agents, 2022

2021
Meta-level Techniques for Planning, Search, and Scheduling.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

The Closed List is an Obstacle Too.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Metareasoning for Interleaved Planning and Execution.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Iterative-deepening Bidirectional Heuristic Search with Restricted Memory.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Situated Temporal Planning Using Deadline-aware Metareasoning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
On the Differences and Similarities of fMM and GBFHS.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Multi-Directional Search.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Trading Plan Cost for Timeliness in Situated Temporal Planning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Multi-Directional Heuristic Search.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Predicting the Effectiveness of Bidirectional Heuristic Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improving Bidirectional Heuristic Search by Bounds Propagation.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Algorithm Selection in Optimization and Application to Angry Birds.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Enriching Non-Parametric Bidirectional Search Algorithms.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Allocating Planning Effort When Actions Expire.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017
Some Properties of Batch Value of Information in the Selection Problem.
J. Artif. Intell. Res., 2017

Monte-Carlo Tree Search using Batch Value of Perfect Information.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Some Properties of Batch Value of Information in the Selection Problem (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017


  Loading...