no code implementations • 6 Jun 2022 • Abhinav Bhatia, Philip S. Thomas, Shlomo Zilberstein
Model-based reinforcement learning promises to learn an optimal policy from fewer interactions with the environment compared to model-free reinforcement learning by learning an intermediate model of the environment in order to predict future interactions.
no code implementations • 1 Jun 2022 • Emily Pruc, Shlomo Zilberstein, Joydeep Biswas
In the case of pedestrian-unaware mobile robots this desire for safety leads to the freezing robot problem, where a robot confronted with a large dynamic group of obstacles (such as a crowd of pedestrians) would determine all forward navigation unsafe causing the robot to stop in place.
no code implementations • 30 May 2022 • Samer B. Nashed, Saaduddin Mahmud, Claudia V. Goldman, Shlomo Zilberstein
We introduce a novel framework for causal explanations of stochastic, sequential decision-making systems built on the well-studied structural causal model paradigm for causal reasoning.
no code implementations • 28 Sep 2021 • Sadegh Rabiee, Connor Basich, Kyle Hollins Wray, Shlomo Zilberstein, Joydeep Biswas
First, perception errors are learned in a model-free and location-agnostic setting via introspective perception prior to deployment in novel environments.
1 code implementation • 1 Aug 2021 • Shane Parr, Ishan Khatri, Justin Svegliato, Shlomo Zilberstein
Autonomous systems often operate in environments where the behavior of multiple agents is coordinated by a shared global state.
no code implementations • 13 Feb 2021 • Sandhya Saisubramanian, Shlomo Zilberstein
The human shapes the environment through minor reconfiguration actions so as to mitigate the impacts of the agent's side effects, without affecting the agent's ability to complete its assigned task.
no code implementations • 8 Feb 2021 • Sainyam Galhotra, Sandhya Saisubramanian, Shlomo Zilberstein
Empirical evaluation on three real-world datasets demonstrates the effectiveness of our approach in quickly identifying the underlying fairness and interpretability constraints, which are then used to generate fair and interpretable clusters.
no code implementations • 10 Oct 2020 • Richard G. Freedman, Steven J. Levine, Brian C. Williams, Shlomo Zilberstein
As robotic teammates become more common in society, people will assess the robots' roles in their interactions along many dimensions.
no code implementations • 24 Aug 2020 • Sandhya Saisubramanian, Shlomo Zilberstein, Ece Kamar
Learning to recognize and avoid such negative side effects of an agent's actions is critical to improve the safety and reliability of autonomous systems.
no code implementations • 23 Jul 2020 • Connor Basich, Justin Svegliato, Kyle Hollins Wray, Stefan J. Witwicki, Shlomo Zilberstein
Given the complexity of real-world, unstructured domains, it is often impossible or impractical to design models that include every feature needed to handle all possible scenarios that an autonomous system may encounter.
no code implementations • 17 Mar 2020 • Connor Basich, Justin Svegliato, Kyle Hollins Wray, Stefan Witwicki, Joydeep Biswas, Shlomo Zilberstein
Interest in semi-autonomous systems (SAS) is growing rapidly as a paradigm to deploy autonomous systems in domains that require occasional reliance on humans.
1 code implementation • 17 Dec 2019 • Sandhya Saisubramanian, Sainyam Galhotra, Shlomo Zilberstein
The interpretability of the clusters is complemented by generating simple explanations denoting the feature values of the nodes in the clusters, using frequent pattern mining.
no code implementations • 13 Sep 2019 • Richard G. Freedman, Yi Ren Fung, Roman Ganchin, Shlomo Zilberstein
Many intelligent systems currently interact with others using at least one of fixed communication inputs or preset responses, resulting in rigid interaction experiences and extensive efforts developing a variety of scenarios for the system.
no code implementations • 22 May 2019 • Sandhya Saisubramanian, Shlomo Zilberstein
To that end, we propose planning using a portfolio of reduced models, a planning paradigm that minimizes the negative side effects of planning using reduced models by alternating between different outcome selection approaches.
no code implementations • 2 Mar 2019 • Sainyam Galhotra, Sandhya Saisubramanian, Shlomo Zilberstein
We introduce a rich model for multi-objective clustering with lexicographic ordering over objectives and a slack.
no code implementations • 18 Oct 2018 • Sandhya Saisubramanian, Kyle Hollins Wray, Luis Pineda, Shlomo Zilberstein
The framework extends the stochastic shortest path (SSP) model to dynamic environments in which it is impossible to determine the exact goal states ahead of plan execution.
no code implementations • 16 Feb 2018 • Siddharth Srivastava, Nishant Desai, Richard Freedman, Shlomo Zilberstein
We present a new approach where the high-level decision problem occurs in a stochastic setting and can be modeled as a Markov decision process.
no code implementations • 21 May 2017 • Luis Pineda, Shlomo Zilberstein
The stochastic shortest path problem (SSP) is a highly expressive model for probabilistic planning.
no code implementations • 1 Dec 2016 • Xiaojian Wu, Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein
We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers.
no code implementations • NeurIPS 2014 • Xiaojian Wu, Daniel R. Sheldon, Shlomo Zilberstein
We investigate the problem of stochastic network design in bidirected trees.
no code implementations • 15 Jan 2014 • Daniel S. Bernstein, Christopher Amato, Eric A. Hansen, Shlomo Zilberstein
The main contribution of this paper is an optimal policy iteration algorithm for solving DEC-POMDPs.
no code implementations • 15 Jan 2014 • Marek Petrik, Shlomo Zilberstein
Because the algorithm is formulated for bilinear programs, it is more general and simpler to implement.
no code implementations • NeurIPS 2010 • Akshat Kumar, Shlomo Zilberstein
We experiment on the real-world protein design dataset and show that EM's convergence rate is significantly higher than the previous LP relaxation based approach MPLP.
no code implementations • NeurIPS 2009 • Martin Allen, Shlomo Zilberstein
The worst-case complexity of general decentralized POMDPs, which are equivalent to partially observable stochastic games (POSGs) is very high, both for the cooperative and competitive cases.
no code implementations • NeurIPS 2009 • Marek Petrik, Shlomo Zilberstein
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds.