Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiao Li 0025

dblp:66/2069-25 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2023
0000-0003-2565-9883ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Systems, architecture and hardware · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Autonomous driving · 33% Motion planning and robot control · 30% Reinforcement learning · 22%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 15 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot control › safe control
control barrier functions
0.712023
BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control · IEEE Trans. Robotics 2023
Robotics › Autonomous driving › planning for self-driving vehicles
risk-aware trajectory planning
0.712023
Risk-Aware Neural Navigation From BEV Input for Interactive Driving · ICRA 2023
Robotics › Motion planning and robot control
robot control
0.712023
BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control · IEEE Trans. Robotics 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control · IEEE Trans. Robotics 2023
Robotics › Motion planning and robot control › robot control
safe control
0.712023
BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control · IEEE Trans. Robotics 2023
Robotics › Autonomous driving › trajectory prediction
interaction-aware prediction
0.612022
A Deep Concept Graph Network for Interaction-Aware Trajectory Prediction · ICRA 2022
Robotics › Autonomous driving
trajectory prediction
0.612022
A Deep Concept Graph Network for Interaction-Aware Trajectory Prediction · ICRA 2022
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.512021
The Logical Options Framework · ICML 2021
Machine learning › Reinforcement learning › hierarchical reinforcement learning
option discovery
0.512021
The Logical Options Framework · ICML 2021
Machine learning › Reinforcement learning
policy composition
0.512021
The Logical Options Framework · ICML 2021
Robotics › Autonomous driving › perception › 3d perception
bird's-eye-view perception
0.212023
Risk-Aware Neural Navigation From BEV Input for Interactive Driving · ICRA 2023
Robotics › Autonomous driving
perception
0.212023
BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control · IEEE Trans. Robotics 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation › semantic networks
concept graph
0.212022
A Deep Concept Graph Network for Interaction-Aware Trajectory Prediction · ICRA 2022
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
temporal knowledge graph
0.212022
A Deep Concept Graph Network for Interaction-Aware Trajectory Prediction · ICRA 2022
Automata and formal languages
finite automata
0.112021
The Logical Options Framework · ICML 2021

Methods — techniques the papers use, named apart from their topics

hierarchical reinforcement learning · 1.0automaton representation · 1.0trajectory sampling · 0.7quadratic program · 0.7neural network · 0.7gradient descent · 0.7differentiable value iteration · 0.7differentiable control barrier functions · 0.7temporal knowledge graph · 0.6deep concept graph network · 0.6planning · 0.5
YearPublicationVenuePosition
2023 Risk-Aware Neural Navigation From BEV Input for Interactive Driving
abstract
Safety has been a key goal for autonomous driving since its inception, and we believe recognizing and responding to risk is a key component of safety. In this work, we aim to answer the question, “How can explainable risk representations be generated and used to produce risk-averse trajectories?” To answer this question, previous work uses risk metrics to formulate an optimization problem. In contrast, our work is based on research showing the usefulness of grids as a representation to generate image-based risk maps through a trained neural network. We propose a method of determining risk from a bird's eye view (BEV) of an autonomous vehicle's surroundings. Our method consists of (1) a risk map generator, which is trained to recognize risk associated with nearby agents and the map, (2) differentiable value iteration using the risk map to learn a policy, and (3) a trajectory sampler, which samples from this policy to generate a trajectory. We evaluate our planner in a close-loop manner and find improvements in its overall ability to mimic human driving while maintaining comparable safety statistics. Self-ablation also reveals the potential for fine-tuning the behavior of the planner given a designer's needs.
Suzanna Jiwani, Xiao Li 0025, Sertac Karaman, Daniela Rus
ICRA2
2023 BarrierNet: Differentiable Control Barrier Functions for Learning of Safe Robot Control
abstract
Many safety-critical applications of neural networks, such as robotic control, require safety guarantees. This article introduces a method for ensuring the safety of learned models for control using differentiable control barrier functions (dCBFs). dCBFs are end-to-end trainable and guarantee safety. They improve over classical control barrier functions (CBFs), which are usually overly conservative. Our dCBF solution relaxes the CBF definitions by: 1) using environmental dependencies; 2) embedding them into differentiable quadratic programs. These novel safety layers are called a BarrierNet. They can be used in conjunction with any neural network-based controller. They are trained by gradient descent. With BarrierNet, the safety constraints of a neural controller become adaptable to changing environments. We evaluate BarrierNet on the following several problems: 1) robot traffic merging; 2) robot navigation in 2-D and 3-D spaces; 3) end-to-end vision-based autonomous driving in a sim-to-real environment and in physical experiments; 4) demonstrate their effectiveness compared to state-of-the-art approaches.
Wei Xiao 0003, Tsun-Hsuan Wang, Ramin M. Hasani, Makram Chahine, Alexander Amini, Xiao Li 0025, Daniela Rus
IEEE Trans. Robotics6
2022 A Deep Concept Graph Network for Interaction-Aware Trajectory Prediction
abstract
Temporal patterns (how vehicles behave in our observed past) underline our reasoning of how people drive on the road, and can explain why we make certain predictions about interactions among road agents. In this paper we propose the ConceptNet trajectory predictor - a novel prediction framework that is able to incorporate agent interactions as explicit edges in a temporal knowledge graph. We demonstrate the sample efficiency and the overall accuracy of the proposed approach, and show that using the graphical structure to explicitly model interactions enables better detection of agent interactions and improved trajectory predictions on a large real-world driving dataset.
Yutong Ban, Xiao Li 0025, Guy Rosman, Igor Gilitschenski, Ozanan R. Meireles, Sertac Karaman, Daniela Rus
ICRA2
2021 The Logical Options Framework
abstract
Learning composable policies for environments with complex rules and tasks is a challenging problem. We introduce a hierarchical reinforcement learning framework called the Logical Options Framework (LOF) that learns policies that are satisfying, optimal, and composable. LOF efficiently learns policies that satisfy tasks by representing the task as an automaton and integrating it into learning and planning. We provide and prove conditions under which LOF will learn satisfying, optimal policies. And lastly, we show how LOF’s learned policies can be composed to satisfy unseen tasks with only 10-50 retraining steps on our benchmarks. We evaluate LOF on four tasks in discrete and continuous domains, including a 3D pick-and-place environment.
Brandon Araki, Xiao Li 0025, Kiran Vodrahalli, Jonathan A. DeCastro, Micah J. Fry, Daniela Rus
ICML2