activity
19962026
most citedOn the Complexity of Solving Markov Decision Problems

389 citations · 2.9k across the 113 of their papers we have counts for

collaborators
Showing 2018 · cs.AIShow all

5 papers · 2 filters

cs.AI2018

Learning Quickly to Plan Quickly Using Modular Meta-Learning

Rohan Chitnis, Leslie Pack Kaelbling, Tomás Lozano-Pérez

Multi-object manipulation problems in continuous state and action spaces can be solved by planners that search over sampled values for the continuous parameters of operators. The e…

cs.AI2018

Finding Frequent Entities in Continuous Data

Ferran Alet, Rohan Chitnis, Leslie P. Kaelbling +1

In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rathe…

cs.AI2018★ 3 cited

Learning What Information to Give in Partially Observed Domains

Rohan Chitnis, Leslie Pack Kaelbling, Tomás Lozano-Pérez

In many robotic applications, an autonomous agent must act within and explore a partially observed environment that is unobserved by its human teammate. We consider such a setting…

cs.AI2018

Integrating Human-Provided Information Into Belief State Representation Using Dynamic Factorization

Rohan Chitnis, Leslie Pack Kaelbling, Tomás Lozano-Pérez

In partially observed environments, it can be useful for a human to provide the robot with declarative information that represents probabilistic relational constraints on propertie…

cs.AI2018★ 24 cited

PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning

Caelan Reed Garrett, Tomás Lozano-Pérez, Leslie Pack Kaelbling

Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, coll…