Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity
审计近最优策略可能是指数级困难的:通过占用Rashomon容量的条件查询下界
Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma
机构
*
Department of Computer Science, Iowa State University(计算机科学系,爱荷华州立大学)
;
Department of Civil, Construction & Environmental Engineering, Iowa State University(土木、建设与环境工程系,爱荷华州立大学)
BEVIO: Efficient Bird's-Eye-View based Sparse-Update Visual-Inertial Odometry for Lunar Day-Night Navigation
BEVIO: 基于鸟瞰图的稀疏更新视觉-惯性里程计用于月球昼夜导航
Mohit Singh, Shehryar Khattak, Ashish Goel, Michael Paton, Kostas Alexis, Issa A. Nesnas
机构
*
Jet Propulsion Laboratory, California Institute of Technology(喷气推进实验室,加州理工学院)
;
Autonomous Robots Lab at the Norwegian University of Science and Technology(挪威科学技术大学自主机器人实验室)