The computational difficulty of planning search paths that seek to maximize a general deterministic value function increases dramatically as desired path lengths increase. Mobile …
We present a multi-agent approach to receding horizon path planning that utilizes terminal costs. We show that the value of the receding horizon paths produced using the proposed …
This thesis describes the development of an indoor water tank facility for controls research and the design, testing, and system identification of a miniature underwater vehicle capable …
G Gutow, JD Rogers - IEEE Robotics and Automation Letters, 2022 - ieeexplore.ieee.org
Expected value computations are a key bottleneck for path planning under uncertainty. Computing an expected value requires integrating over the uncertainty domain, which may …
CI Sprague, P Ögren - 2020 IEEE/OES Autonomous …, 2020 - ieeexplore.ieee.org
Learning How to Learn Bathymetry Page 1 Learning How to Learn Bathymetry Christopher Iliffe Sprague, Petter Ogren Robotics, Perception, and Learning (RPL) KTH Royal Institute of …
This work is inspired by robotic search applications where a robot or team of robots is equipped with sensors and tasked to autonomously acquire as much information as …