<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://shperb.github.io/portfolio/portfolio-1/</loc>
</url>
<url>
<loc>https://shperb.github.io/portfolio/portfolio-2/</loc>
</url>
<url>
<loc>https://shperb.github.io/posts/2012/08/blog-post-1/</loc>
<lastmod>2012-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/posts/2013/08/blog-post-2/</loc>
<lastmod>2013-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/posts/2014/08/blog-post-3/</loc>
<lastmod>2014-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/posts/2012/08/blog-post-4/</loc>
<lastmod>2015-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/posts/2012/08/blog-post-4/</loc>
<lastmod>2199-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2017-01-01-Monte-Carlo-Tree-Search-using-Batch-Value-of-Perfect-Information</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2017-01-01-Some-Properties-of-Batch-Value-of-Information-in-the-Selection-Problem-Extended-Abstract</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2017-01-01-Some-Properties-of-Batch-Value-of-Information-in-the-Selection-Problem</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2019-01-01-Algorithm-Selection-in-Optimization-and-Application-to-Angry-Birds</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2019-01-01-Allocating-Planning-Effort-When-Actions-Expire</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2019-01-01-Enriching-Non-Parametric-Bidirectional-Search-Algorithms-Extended-Abstract</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2019-01-01-Enriching-Non-Parametric-Bidirectional-Search-Algorithms</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/Improving-Bidirectional-Heuristic-Search-by-Bounds-Propagation</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-Bidirectional-Heuristic-Search-Expanding-Nodes-by-a-Lower-Bound</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-Multi-Directional-Heuristic-Search</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-Multi-Directional-Search</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-On-the-Differences-and-Similarities-of-fMM-and-GBFHS</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-Predicting-the-Effectiveness-of-Bidirectional-Heuristic-Search</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2020-01-01-Trading-Plan-Cost-for-Timeliness-in-Situated-Temporal-Planning</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2021-01-01-Iterative-Deepening-Bidirectional-Heuristic-Search-with-Restricted-Memory</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2021-01-01-Meta-level-Techniques-for-Planning-Search-and-Scheduling</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2021-01-01-Metareasoning-for-Interleaved-Planning-and-Execution</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2021-01-01-Situated-Temporal-Planning-Using-Deadline-aware-Metareasoning</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/publication/2021-01-01-The-Closed-List-is-an-Obstacle-Too</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/talks/2012-03-01-talk-1</loc>
<lastmod>2012-03-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/talks/2013-03-01-tutorial-1</loc>
<lastmod>2013-03-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/talks/2014-02-01-talk-2</loc>
<lastmod>2014-02-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/talks/2014-03-01-talk-3</loc>
<lastmod>2014-03-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/teaching/CS_intro</loc>
</url>
<url>
<loc>https://shperb.github.io/teaching/Compiler_Principles</loc>
</url>
<url>
<loc>https://shperb.github.io/teaching/CS_intro</loc>
</url>
<url>
<loc>https://shperb.github.io/teaching/Introduction_to_Artificial_Intelligent</loc>
</url>
<url>
<loc>https://shperb.github.io/teaching/Workshop_on_Software_Engineering_Project</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/2019-01-01-Improving-Bidirectional-Heuristic-Search-by-Bounds-Propagation</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Algorithm-Selection-in-Optimization-and-Application-to-Angry-Birds</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Allocating-Planning-Effort-When-Actions-Expire</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Enriching-Non-Parametric-Bidirectional-Search-Algorithms-Extended-Abstract</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Enriching-Non-Parametric-Bidirectional-Search-Algorithms</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Monte-Carlo-Tree-Search-using-Batch-Value-of-Perfect-Information</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Some-Properties-of-Batch-Value-of-Information-in-the-Selection-Problem-Extended-Abstract</loc>
</url>
<url>
<loc>https://shperb.github.io/publication/Some-Properties-of-Batch-Value-of-Information-in-the-Selection-Problem</loc>
</url>
<url>
<loc>https://shperb.github.io/</loc>
</url>
<url>
<loc>https://shperb.github.io/archive-layout-with-content/</loc>
</url>
<url>
<loc>https://shperb.github.io/categories/</loc>
</url>
<url>
<loc>https://shperb.github.io/collection-archive/</loc>
</url>
<url>
<loc>https://shperb.github.io/cv/</loc>
</url>
<url>
<loc>https://shperb.github.io/markdown/</loc>
</url>
<url>
<loc>https://shperb.github.io/non-menu-page/</loc>
</url>
<url>
<loc>https://shperb.github.io/page-archive/</loc>
</url>
<url>
<loc>https://shperb.github.io/portfolio/</loc>
</url>
<url>
<loc>https://shperb.github.io/publications/</loc>
</url>
<url>
<loc>https://shperb.github.io/sitemap/</loc>
</url>
<url>
<loc>https://shperb.github.io/tags/</loc>
</url>
<url>
<loc>https://shperb.github.io/talkmap.html</loc>
</url>
<url>
<loc>https://shperb.github.io/talks/</loc>
</url>
<url>
<loc>https://shperb.github.io/teaching/</loc>
</url>
<url>
<loc>https://shperb.github.io/terms/</loc>
</url>
<url>
<loc>https://shperb.github.io/year-archive/</loc>
</url>
<url>
<loc>https://shperb.github.io/markdown_generator/</loc>
</url>
<url>
<loc>https://shperb.github.io/files/Meta-level%20Techniques%20for%20Planning,%20Search,%20and%20Scheduling.pdf</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/files/dissertation.pdf</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/files/paper1.pdf</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/files/paper2.pdf</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/files/paper3.pdf</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
<url>
<loc>https://shperb.github.io/talkmap/map.html</loc>
<lastmod>2023-03-26T00:34:17-07:00</lastmod>
</url>
</urlset>
