Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"bounded suboptimality"”.

  1. Almost Sure Safety and Continual Improvement in Reinforcement Learning

    … that are recursively feasible and have bounded suboptimality.

    jhu Repository record for Almost Sure Safety and Continual Improvement in Reinforcement Learning (opens in a new tab)

  2. Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems

    … motion planning problems with completeness and bounded suboptimality guarantees. A set of heuristic search algorithms is developed to utilize relaxed notions of relevancy to more efficiently solve path planning, motion planning and multi-agent path finding problems. The main focus of this thesis …

    gatech Repository record for Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems (opens in a new tab)

  3. Parsimonious, Risk-Aware, and Resilient Multi-Robot Coordination

    … algorithm, and prove that its performance has bounded suboptimality and improves with running time. We also present an online version of the algorithm to adapt to real-time scenarios. In the third part of this dissertation, we focus on scenarios where a set of robots may fail naturally or due …

    vt Repository record for Parsimonious, Risk-Aware, and Resilient Multi-Robot Coordination (opens in a new tab)