<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xmlns:xhtml="http://www.w3.org/1999/xhtml">
  <url>
    <loc>https://kat-hendrickson.com/contact</loc>
    <changefreq>daily</changefreq>
    <priority>0.75</priority>
    <lastmod>2021-11-02</lastmod>
  </url>
  <url>
    <loc>https://kat-hendrickson.com/home</loc>
    <changefreq>daily</changefreq>
    <priority>1.0</priority>
    <lastmod>2021-12-02</lastmod>
    <image:image>
      <image:loc>https://images.squarespace-cdn.com/content/v1/6181cbb07144b7737f112f4f/1635901096790-TXADHZ23ZW1V8WKC579P/image-asset.jpeg</image:loc>
      <image:title>Home</image:title>
    </image:image>
  </url>
  <url>
    <loc>https://kat-hendrickson.com/research</loc>
    <changefreq>daily</changefreq>
    <priority>0.75</priority>
    <lastmod>2021-12-02</lastmod>
    <image:image>
      <image:loc>https://images.squarespace-cdn.com/content/v1/6181cbb07144b7737f112f4f/1635905312763-L8PDMVG5ZQ4MM2IKSD4U/image-asset.png</image:loc>
      <image:title>Research - Hybrid Algorithms</image:title>
      <image:caption>Some applications inherently require a hybrid systems approach which combine continuous-time dynamics and discrete-time events. I develop multi-agent hybrid algorithms that perform gradient descent in continuous-time to solve optimization problems and model communication events between agents in discrete-time.</image:caption>
    </image:image>
    <image:image>
      <image:loc>https://images.squarespace-cdn.com/content/v1/6181cbb07144b7737f112f4f/1635905468304-E7X6ZD8VEY6AGSOVM4Y3/image-asset.png</image:loc>
      <image:title>Research - Discrete-Time Algorithms</image:title>
      <image:caption>I develop discrete-time optimization algorithms that tolerate asynchrony between agents. Rather than impose assumptions on the environment, I consider certain types of problems that allow for delays between updates and communications among agents. These problems are found in a wide range of settings including machine learning, AI, networks, communications, and robotics.</image:caption>
    </image:image>
  </url>
  <url>
    <loc>https://kat-hendrickson.com/publications</loc>
    <changefreq>daily</changefreq>
    <priority>0.75</priority>
    <lastmod>2022-06-29</lastmod>
  </url>
  <url>
    <loc>https://kat-hendrickson.com/presentations</loc>
    <changefreq>daily</changefreq>
    <priority>0.75</priority>
    <lastmod>2022-04-16</lastmod>
  </url>
  <url>
    <loc>https://kat-hendrickson.com/just-for-fun</loc>
    <changefreq>daily</changefreq>
    <priority>0.75</priority>
    <lastmod>2021-11-03</lastmod>
  </url>
</urlset>

