Alert button
Picture for Kyle Brown

Kyle Brown

Alert button

Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning

Jun 16, 2020
Kyle Brown, Oriana Peltzer, Martin A. Sehr, Mac Schwager, Mykel J. Kochenderfer

Figure 1 for Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning
Figure 2 for Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning
Figure 3 for Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning
Figure 4 for Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning

We study the problem of sequential task assignment and collision-free routing for large teams of robots in applications with inter-task precedence constraints (e.g., task $A$ and task $B$ must both be completed before task $C$ may begin). Such problems commonly occur in assembly planning for robotic manufacturing applications, in which sub-assemblies must be completed before they can be combined to form the final product. We propose a hierarchical algorithm for computing makespan-optimal solutions to the problem. The algorithm is evaluated on a set of randomly generated problem instances where robots must transport objects between stations in a "factory "grid world environment. In addition, we demonstrate in high-fidelity simulation that the output of our algorithm can be used to generate collision-free trajectories for non-holonomic differential-drive robots.

* International Conference on Robotics and Automation (ICRA) 2020  
* Presented at International Conference on Robotics and Automation (ICRA) 2020 
Viaarxiv icon

Modeling and Prediction of Human Driver Behavior: A Survey

Jun 15, 2020
Kyle Brown, Katherine Driggs-Campbell, Mykel J. Kochenderfer

Figure 1 for Modeling and Prediction of Human Driver Behavior: A Survey
Figure 2 for Modeling and Prediction of Human Driver Behavior: A Survey
Figure 3 for Modeling and Prediction of Human Driver Behavior: A Survey
Figure 4 for Modeling and Prediction of Human Driver Behavior: A Survey

We present a review and taxonomy of 200 models from the literature on driver behavior modeling. We begin by introducing a mathematical formulation based on the partially observable stochastic game, which serves as a common framework for comparing and contrasting different driver models. Our taxonomy is constructed around the core modeling tasks of state estimation, intention estimation, trait estimation, and motion prediction, and also discusses the auxiliary tasks of risk estimation, anomaly detection, behavior imitation and microscopic traffic simulation. Existing driver models are categorized based on the specific tasks they address and key attributes of their approach.

Viaarxiv icon

Online Parameter Estimation for Human Driver Behavior Prediction

May 06, 2020
Raunak Bhattacharyya, Ransalu Senanayake, Kyle Brown, Mykel Kochenderfer

Figure 1 for Online Parameter Estimation for Human Driver Behavior Prediction
Figure 2 for Online Parameter Estimation for Human Driver Behavior Prediction
Figure 3 for Online Parameter Estimation for Human Driver Behavior Prediction
Figure 4 for Online Parameter Estimation for Human Driver Behavior Prediction

Driver models are invaluable for planning in autonomous vehicles as well as validating their safety in simulation. Highly parameterized black-box driver models are very expressive, and can capture nuanced behavior. However, they usually lack interpretability and sometimes exhibit unrealistic-even dangerous-behavior. Rule-based models are interpretable, and can be designed to guarantee "safe" behavior, but are less expressive due to their low number of parameters. In this article, we show that online parameter estimation applied to the Intelligent Driver Model captures nuanced individual driving behavior while providing collision free trajectories. We solve the online parameter estimation problem using particle filtering, and benchmark performance against rule-based and black-box driver models on two real world driving data sets. We evaluate the closeness of our driver model to ground truth data demonstration and also assess the safety of the resulting emergent driving behavior.

* Accepted to the 2020 American Control Conference (ACC). 6 pages, 6 figures 
Viaarxiv icon

STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times

Apr 17, 2020
Oriana Peltzer, Kyle Brown, Mac Schwager, Mykel J. Kochenderfer, Martin Sehr

Figure 1 for STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times
Figure 2 for STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times
Figure 3 for STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times
Figure 4 for STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times

We address the Multi-Agent Path Finding problem on a graph for agents assigned to goals in a known environment and under uncertainty. Our algorithm, called STT-CBS, uses Conflict-Based Search (CBS) with a stochastic travel time (STT) model for the agents. We model robot travel time along each edge of the graph by independent gamma-distributed random variables and propose probabilistic conflict identification and constraint creation methods to robustly handle travel time uncertainty. We show that under reasonable assumptions our algorithm is complete and optimal in terms of expected sum of travel times, while ensuring an upper bound on each pairwise conflict probability. Simulations and hardware experiments show that STT-CBS is able to significantly decrease conflict probability over CBS, while remaining within the same complexity class.

Viaarxiv icon

Multi-Fidelity Recursive Behavior Prediction

Dec 18, 2018
Mihir Jain, Kyle Brown, Ahmed K. Sadek

Figure 1 for Multi-Fidelity Recursive Behavior Prediction
Figure 2 for Multi-Fidelity Recursive Behavior Prediction

Predicting the behavior of surrounding vehicles is a critical problem in automated driving. We present a novel game theoretic behavior prediction model that achieves state of the art prediction accuracy by explicitly reasoning about possible future interaction between agents. We evaluate our approach on the NGSIM vehicle trajectory data set and demonstrate lower root mean square error than state-of-the-art methods.

* Conference on Neural Information Processing Systems 2018  
Viaarxiv icon

HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition

Nov 26, 2018
Kyle Brown, Derek Doran, Ryan Kramer, Brad Reynolds

Figure 1 for HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition
Figure 2 for HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition
Figure 3 for HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition
Figure 4 for HELOC Applicant Risk Performance Evaluation by Topological Hierarchical Decomposition

Strong regulations in the financial industry mean that any decisions based on machine learning need to be explained. This precludes the use of powerful supervised techniques such as neural networks. In this study we propose a new unsupervised and semi-supervised technique known as the topological hierarchical decomposition (THD). This process breaks a dataset down into ever smaller groups, where groups are associated with a simplicial complex that approximate the underlying topology of a dataset. We apply THD to the FICO machine learning challenge dataset, consisting of anonymized home equity loan applications using the MAPPER algorithm to build simplicial complexes. We identify different groups of individuals unable to pay back loans, and illustrate how the distribution of feature values in a simplicial complex can be used to explain the decision to grant or deny a loan by extracting illustrative explanations from two THDs on the dataset.

* 10 pages, 4 figures, to be published in the NIPS 2018 Workshop on Challenges and Opportunities for AI in Financial Services: the Impact of Fairness, Explainability, Accuracy, and Privacy 
Viaarxiv icon

Realistic Traffic Generation for Web Robots

Dec 15, 2017
Kyle Brown, Derek Doran

Figure 1 for Realistic Traffic Generation for Web Robots
Figure 2 for Realistic Traffic Generation for Web Robots
Figure 3 for Realistic Traffic Generation for Web Robots

Critical to evaluating the capacity, scalability, and availability of web systems are realistic web traffic generators. Web traffic generation is a classic research problem, no generator accounts for the characteristics of web robots or crawlers that are now the dominant source of traffic to a web server. Administrators are thus unable to test, stress, and evaluate how their systems perform in the face of ever increasing levels of web robot traffic. To resolve this problem, this paper introduces a novel approach to generate synthetic web robot traffic with high fidelity. It generates traffic that accounts for both the temporal and behavioral qualities of robot traffic by statistical and Bayesian models that are fitted to the properties of robot traffic seen in web logs from North America and Europe. We evaluate our traffic generator by comparing the characteristics of generated traffic to those of the original data. We look at session arrival rates, inter-arrival times and session lengths, comparing and contrasting them between generated and real traffic. Finally, we show that our generated traffic affects cache performance similarly to actual traffic, using the common LRU and LFU eviction policies.

* 8 pages 
Viaarxiv icon