Pith. sign in

REVIEW 3 cited by

Learning Human Preferences Over Robot Behavior as Soft Planning Constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.19795 v1 pith:M3UQAD2P submitted 2024-03-28 cs.RO

classification cs.RO
keywords robotbehaviorpreferenceshumanlearningplanningconstraintsdesired
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Preference learning has long been studied in Human-Robot Interaction (HRI) in order to adapt robot behavior to specific user needs and desires. Typically, human preferences are modeled as a scalar function; however, such a formulation confounds critical considerations on how the robot should behave for a given task, with desired -- but not required -- robot behavior. In this work, we distinguish between such required and desired robot behavior by leveraging a planning framework. Specifically, we propose a novel problem formulation for preference learning in HRI where various types of human preferences are encoded as soft planning constraints. Then, we explore a data-driven method to enable a robot to infer preferences by querying users, which we instantiate in rearrangement tasks in the Habitat 2.0 simulator. We show that the proposed approach is promising at inferring three types of preferences even under varying levels of noise in simulated user choices between potential robot behaviors. Our contributions open up doors to adaptable planning-based robot behavior in the future.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Partner Capability Estimation for Task-Agnostic Adaptation in Ad-Hoc Teamwork

    cs.AI 2026-07 conditional novelty 6.0 of 10

    CE-CM infers discrete task-invariant partner capability vectors online via approximate Bayesian simulate-and-compare, and CE-CM-Div improves estimates when humans use diverse suboptimal strategies.

  2. Optimal Interactive Learning on the Job via Facility Location Planning

    cs.RO 2025-05 conditional novelty 6.0 of 10

    COIL casts multi-task interactive robot learning as an uncapacitated facility location problem and uses approximation algorithms to plan skill, preference, and help queries that reduce human effort.

  3. Learning Quantitative Automata Modulo Theories

    cs.FL 2024-11 reject novelty 6.0 of 10

    QUINTIC learns deterministic quantitative automata from preference queries using SMT-based conjectures over variable equivalences, with claimed guarantees of completeness and minimalism.

Pith tools