paper-with-me

홈 › Papers

Optimal Interactive Learning on the Job via Facility Location Planning

2025-05-01 · Shivam Vats, Michelle Zhao, Patrick Callaghan, Mingxi Jia, Maxim Likhachev, Oliver Kroemer, George Konidaris

Collaborative robots must continually adapt to novel tasks and user preferences without overburdening the user. While prior interactive robot learning methods aim to reduce human effort, they are typically limited to single-task scenarios and are not well-suited for sustained, multi-task collaboration. We propose COIL (Cost-Optimal Interactive Learning) -- a multi-task interaction planner that minimizes human effort across a sequence of tasks by strategically selecting among three query types (skill, preference, and help). When user preferences are known, we formulate COIL as an uncapacitated facility location (UFL) problem, which enables bounded-suboptimal planning in polynomial time using off-the-shelf approximation algorithms. We extend our formulation to handle uncertainty in user preferences by incorporating one-step belief space planning, which uses these approximation algorithms as subroutines to maintain polynomial-time performance. Simulated and physical experiments on manipulation tasks show that our framework significantly reduces the amount of work allocated to the human while maintaining successful task completion.

📄 PDF Abstract BibTeX arXiv:2505.00490

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Optimized Human-Robot Co-Dispatch Planning for Petro-Site Surveillance under Varying Criticalities

2026-02-08 · Nur Ahmad Khatim, Mansur Arief arxiv

Securing petroleum infrastructure requires balancing autonomous system efficiency with human judgment for threat escalation, a challenge unaddressed by classical facility location models assuming homogeneous resources. T…

Improved Bounds for Online Facility Location with Predictions

2021-07-17 · Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis, Nikolas Patris 외

We consider Online Facility Location in the framework of learning-augmented online algorithms. In Online Facility Location (OFL), demands arrive one-by-one in a metric space and must be (irrevocably) assigned to an open …

Strategy Proof Mechanisms for Facility Location with Capacity Limits

2020-09-17 · Toby Walsh

An important feature of many real world facility location problems are capacity limits on the facilities. We show here how capacity constraints make it harder to design strategy proof mechanisms for facility location, bu…

A Multi-Objective Simultaneous Routing, Facility Location and Allocation Model for Earthquake Emergency Logistics

2025-03-28 · Sakineh Khodadadi, Tohid Kargar Tasooji, Afshin Shariat-Mohayman, Navid Kalantari

Emergency preparedness reduces the severity and impact of major disasters. In the case of earthquakes, a rapid and efficient emergency response is essential to reduce the number of fatalities. Therefore, the design and p…

Proportional Fairness in Obnoxious Facility Location

2023-01-11 · Alexander Lam, Haris Aziz, Bo Li, Fahimeh Ramezani 외

We consider the obnoxious facility location problem (in which agents prefer the facility location to be far from them) and propose a hierarchy of distance-based proportional fairness concepts for the problem. These fairn…

Fairness