Brian Charles Williams
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Brian Charles Williams has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Ashkan Jasour
University of Michigan 48109 Ann Arbor MI USA
4 shared publications - Lars Blackmore
Massachusetts Institute of Technology, 77 Mass. Ave., Cambridge, MA 02139, United States
4 shared publications - Allen Wang
Plasma Science and Fusion Center, Massachusetts Institute of Technology, Cambridge, USA
3 shared publications - Andreas Hofmann
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA
2 shared publications - Yuening Zhang
Massachusetts Institute of Technology
2 shared publications Andreas Hofmann
Department of Aeronautics and Astronautics Massachusetts Institute of Technology Cambridge 02139-4301 Massachusetts
1 shared publication
Latest Publications
- Open Access
- 1 August 2023
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 6969-6973
Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search (Extended Abstract)
Electronic proceedings of IJCAI 2023
- 1 August 2023
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 6969-6973
Open AccessMotion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search (Extended Abstract)
Electronic proceedings of IJCAI 2023
- 26 July 2023
- Published by Elsevier in Artificial Intelligence
- Vol. 323
A conflict-directed approach to chance-constrained mixed logical linear programming
- 26 July 2023
- Published by Elsevier in Artificial Intelligence
- Vol. 323
A conflict-directed approach to chance-constrained mixed logical linear programming
- Open Access
Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about Plans
When agents collaborate on a task, it is important that they have some shared mental model of the task routines -- the set of feasible plans towards achieving the goals. However, in reality, situations often arise that such a shared mental model cannot be guaranteed, such as in ad-hoc teams where agents may follow different conventions or when contingent constraints arise that only some agents are aware of. Previous work on human-robot teaming has assumed that the team has a set of shared routines, which breaks down in these situations. In this work, we leverage epistemic logic to enable agents to understand the discrepancy in each other's beliefs about feasible plans and dynamically plan their actions to adapt or communicate to resolve the discrepancy. We propose a formalism that extends conditional doxastic logic to describe knowledge bases in order to explicitly represent agents' nested beliefs on the feasible plans and state of execution. We provide an online execution algorithm based on Monte Carlo Tree Search for the agent to plan its action, including communication actions to explain the feasibility of plans, announce intent, and ask questions. Finally, we evaluate the success rate and scalability of the algorithm and show that our agent is better equipped to work in teams without the guarantee of a shared mental model.
Open AccessAdaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about Plans
When agents collaborate on a task, it is important that they have some shared mental model of the task routines -- the set of feasible plans towards achieving the goals. However, in reality, situations often arise that such a shared mental model cannot be guaranteed, such as in ad-hoc teams where agents may follow different conventions or when contingent constraints arise that only some agents are aware of. Previous work on human-robot teaming has assumed that the team has a set of shared routines, which breaks down in these situations. In this work, we leverage epistemic logic to enable agents to understand the discrepancy in each other's beliefs about feasible plans and dynamically plan their actions to adapt or communicate to resolve the discrepancy. We propose a formalism that extends conditional doxastic logic to describe knowledge bases in order to explicitly represent agents' nested beliefs on the feasible plans and state of execution. We provide an online execution algorithm based on Monte Carlo Tree Search for the agent to plan its action, including communication actions to explain the feasibility of plans, announce intent, and ask questions. Finally, we evaluate the success rate and scalability of the algorithm and show that our agent is better equipped to work in teams without the guarantee of a shared mental model.
- Open Access
- 1 July 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the International Conference on Automated Planning and Scheduling
- Vol. 33 (1) , 462-471
Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents’ Beliefs about Plans
When agents collaborate on a task, it is important that they have some shared mental model of the task routines -- the set of feasible plans towards achieving the goals. However, in reality, situations often arise that such a shared mental model cannot be guaranteed, such as in ad-hoc teams where agents may follow different conventions or when contingent constraints arise that only some agents are aware of. Previous work on human-robot teaming has assumed that the team has a set of shared routines, which breaks down in these situations. In this work, we leverage epistemic logic to enable agents to understand the discrepancy in each other's beliefs about feasible plans and dynamically plan their actions to adapt or communicate to resolve the discrepancy. We propose a formalism that extends conditional doxastic logic to describe knowledge bases in order to explicitly represent agents' nested beliefs on the feasible plans and state of execution. We provide an online execution algorithm based on Monte Carlo Tree Search for the agent to plan its action, including communication actions to explain the feasibility of plans, announce intent, and ask questions. Finally, we evaluate the success rate and scalability of the algorithm and show that our agent is better equipped to work in teams without the guarantee of a shared mental model.
- 1 July 2023
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the International Conference on Automated Planning and Scheduling
- Vol. 33 (1) , 462-471
Open AccessAdaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents’ Beliefs about Plans
When agents collaborate on a task, it is important that they have some shared mental model of the task routines -- the set of feasible plans towards achieving the goals. However, in reality, situations often arise that such a shared mental model cannot be guaranteed, such as in ad-hoc teams where agents may follow different conventions or when contingent constraints arise that only some agents are aware of. Previous work on human-robot teaming has assumed that the team has a set of shared routines, which breaks down in these situations. In this work, we leverage epistemic logic to enable agents to understand the discrepancy in each other's beliefs about feasible plans and dynamically plan their actions to adapt or communicate to resolve the discrepancy. We propose a formalism that extends conditional doxastic logic to describe knowledge bases in order to explicitly represent agents' nested beliefs on the feasible plans and state of execution. We provide an online execution algorithm based on Monte Carlo Tree Search for the agent to plan its action, including communication actions to explain the feasibility of plans, announce intent, and ask questions. Finally, we evaluate the success rate and scalability of the algorithm and show that our agent is better equipped to work in teams without the guarantee of a shared mental model.
- Open Access
- 6 February 2023
- Published by Springer Nature in Autonomous Robots
- Vol. 47 (5) , 617-633
An empowerment-based solution to robotic manipulation tasks with sparse rewards
In order to provide adaptive and user-friendly solutions to robotic manipulation, it is important that the agent can learn to accomplish tasks even if they are only provided with very sparse instruction signals. To address the issues reinforcement learning algorithms face when task rewards are sparse, this paper proposes an intrinsic motivation approach that can be easily integrated into any standard reinforcement learning algorithm and can allow robotic manipulators to learn useful manipulation skills with only sparse extrinsic rewards. Through integrating and balancing empowerment and curiosity, this approach shows superior performance compared to other state-of-the-art intrinsic exploration approaches during extensive empirical testing. When combined with other strategies for tackling the exploration challenge, e.g. curriculum learning, our approach is able to further improve the exploration efficiency and task success rate. Qualitative analysis also shows that when combined with diversity-driven intrinsic motivations, this approach can help manipulators learn a set of diverse skills which could potentially be applied to other more complicated manipulation tasks and accelerate their learning process.
- 6 February 2023
- Published by Springer Nature in Autonomous Robots
- Vol. 47 (5) , 617-633
Open AccessAn empowerment-based solution to robotic manipulation tasks with sparse rewards
In order to provide adaptive and user-friendly solutions to robotic manipulation, it is important that the agent can learn to accomplish tasks even if they are only provided with very sparse instruction signals. To address the issues reinforcement learning algorithms face when task rewards are sparse, this paper proposes an intrinsic motivation approach that can be easily integrated into any standard reinforcement learning algorithm and can allow robotic manipulators to learn useful manipulation skills with only sparse extrinsic rewards. Through integrating and balancing empowerment and curiosity, this approach shows superior performance compared to other state-of-the-art intrinsic exploration approaches during extensive empirical testing. When combined with other strategies for tackling the exploration challenge, e.g. curriculum learning, our approach is able to further improve the exploration efficiency and task success rate. Qualitative analysis also shows that when combined with diversity-driven intrinsic motivations, this approach can help manipulators learn a set of diverse skills which could potentially be applied to other more complicated manipulation tasks and accelerate their learning process.
- Open Access
Chance-Constrained Trajectory Optimization for High-DOF Robots in Uncertain Environments
Many practical applications of robotics require systems that can operate safely despite uncertainty. In the context of motion planning, two types of uncertainty are particularly important when planning safe robot trajectories. The first is environmental uncertainty -- uncertainty in the locations of nearby obstacles, stemming from sensor noise or (in the case of obstacles' future locations) prediction error. The second class of uncertainty is uncertainty in the robots own state, typically caused by tracking or estimation error. To achieve high levels of safety, it is necessary for robots to consider both of these sources of uncertainty. In this paper, we propose a risk-bounded trajectory optimization algorithm, known as Sequential Convex Optimization with Risk Optimization (SCORA), to solve chance-constrained motion planning problems despite both environmental uncertainty and tracking error. Through experiments in simulation, we demonstrate that SCORA significantly outperforms state-of-the-art risk-aware motion planners both in planning time and in the safety of the resulting trajectories.
Open AccessChance-Constrained Trajectory Optimization for High-DOF Robots in Uncertain Environments
Many practical applications of robotics require systems that can operate safely despite uncertainty. In the context of motion planning, two types of uncertainty are particularly important when planning safe robot trajectories. The first is environmental uncertainty -- uncertainty in the locations of nearby obstacles, stemming from sensor noise or (in the case of obstacles' future locations) prediction error. The second class of uncertainty is uncertainty in the robots own state, typically caused by tracking or estimation error. To achieve high levels of safety, it is necessary for robots to consider both of these sources of uncertainty. In this paper, we propose a risk-bounded trajectory optimization algorithm, known as Sequential Convex Optimization with Risk Optimization (SCORA), to solve chance-constrained motion planning problems despite both environmental uncertainty and tracking error. Through experiments in simulation, we demonstrate that SCORA significantly outperforms state-of-the-art risk-aware motion planners both in planning time and in the safety of the resulting trajectories.
- 30 December 2022
- Published by Elsevier in Artificial Intelligence
- Vol. 316
An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- 30 December 2022
- Published by Elsevier in Artificial Intelligence
- Vol. 316
An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- Open Access
Providing Insights for Open-Response Surveys via End-to-End Context-Aware Clustering
Teachers often conduct surveys in order to collect data from a predefined group of students to gain insights into topics of interest. When analyzing surveys with open-ended textual responses, it is extremely time-consuming, labor-intensive, and difficult to manually process all the responses into an insightful and comprehensive report. In the analysis step, traditionally, the teacher has to read each of the responses and decide on how to group them in order to extract insightful information. Even though it is possible to group the responses only using certain keywords, such an approach would be limited since it not only fails to account for embedded contexts but also cannot detect polysemous words or phrases and semantics that are not expressible in single words. In this work, we present a novel end-to-end context-aware framework that extracts, aggregates, and abbreviates embedded semantic patterns in open-response survey data. Our framework relies on a pre-trained natural language model in order to encode the textual data into semantic vectors. The encoded vectors then get clustered either into an optimally tuned number of groups or into a set of groups with pre-specified titles. In the former case, the clusters are then further analyzed to extract a representative set of keywords or summary sentences that serve as the labels of the clusters. In our framework, for the designated clusters, we finally provide context-aware wordclouds that demonstrate the semantically prominent keywords within each group. Honoring user privacy, we have successfully built the on-device implementation of our framework suitable for real-time analysis on mobile devices and have tested it on a synthetic dataset. Our framework reduces the costs at-scale by automating the process of extracting the most insightful information pieces from survey data.
Open AccessProviding Insights for Open-Response Surveys via End-to-End Context-Aware Clustering
Teachers often conduct surveys in order to collect data from a predefined group of students to gain insights into topics of interest. When analyzing surveys with open-ended textual responses, it is extremely time-consuming, labor-intensive, and difficult to manually process all the responses into an insightful and comprehensive report. In the analysis step, traditionally, the teacher has to read each of the responses and decide on how to group them in order to extract insightful information. Even though it is possible to group the responses only using certain keywords, such an approach would be limited since it not only fails to account for embedded contexts but also cannot detect polysemous words or phrases and semantics that are not expressible in single words. In this work, we present a novel end-to-end context-aware framework that extracts, aggregates, and abbreviates embedded semantic patterns in open-response survey data. Our framework relies on a pre-trained natural language model in order to encode the textual data into semantic vectors. The encoded vectors then get clustered either into an optimally tuned number of groups or into a set of groups with pre-specified titles. In the former case, the clusters are then further analyzed to extract a representative set of keywords or summary sentences that serve as the labels of the clusters. In our framework, for the designated clusters, we finally provide context-aware wordclouds that demonstrate the semantically prominent keywords within each group. Honoring user privacy, we have successfully built the on-device implementation of our framework suitable for real-time analysis on mobile devices and have tested it on a synthetic dataset. Our framework reduces the costs at-scale by automating the process of extracting the most insightful information pieces from survey data.
- 25 November 2021
- Published by Springer Nature in Autonomous Robots
- Vol. 46 (1) , 269-282
Fast nonlinear risk assessment for autonomous vehicles using learned conditional probabilistic models of agent futures
- 25 November 2021
- Published by Springer Nature in Autonomous Robots
- Vol. 46 (1) , 269-282
Fast nonlinear risk assessment for autonomous vehicles using learned conditional probabilistic models of agent futures
- 21 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 5 (4) , 6041-6048
Non-Gaussian Chance-Constrained Trajectory Planning for Autonomous Vehicles Under Agent Uncertainty
Agent behavior is arguably the greatest source of uncertainty in trajectory planning for autonomous vehicles.This problem has motivated significant amounts of work in the behavior prediction community on learning rich distributions of the future states and actions of agents. However, most current work on trajectory planning in the presence of uncertain agents or obstacles is limited to the case of Gaussian uncertainty with linear constraints, which is a limited representation, or requires sampling, which can be computationally intractable to encode in an optimization problem. In this paper, wepresent a general method for enforcing chance-constraints on the probability of collision with other agents in trajectory planning problems for autonomous driving that can be used with non-Gaussian mixture models of agent positions. Our method involves using statistical moments of the non-Gaussian distributions in concentration inequalities to upper bound the probability of polynomial constraint violation. In experiments,we show that the resulting optimization problem can be solved with state-of-the-art nonlinear program (NLP) solvers to plan trajectories with 5 second horizons with low latency.
- 21 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 5 (4) , 6041-6048
Non-Gaussian Chance-Constrained Trajectory Planning for Autonomous Vehicles Under Agent Uncertainty
Agent behavior is arguably the greatest source of uncertainty in trajectory planning for autonomous vehicles.This problem has motivated significant amounts of work in the behavior prediction community on learning rich distributions of the future states and actions of agents. However, most current work on trajectory planning in the presence of uncertain agents or obstacles is limited to the case of Gaussian uncertainty with linear constraints, which is a limited representation, or requires sampling, which can be computationally intractable to encode in an optimization problem. In this paper, wepresent a general method for enforcing chance-constraints on the probability of collision with other agents in trajectory planning problems for autonomous driving that can be used with non-Gaussian mixture models of agent positions. Our method involves using statistical moments of the non-Gaussian distributions in concentration inequalities to upper bound the probability of polynomial constraint violation. In experiments,we show that the resulting optimization problem can be solved with state-of-the-art nonlinear program (NLP) solvers to plan trajectories with 5 second horizons with low latency.