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

Frank Jiang 0003

dblp:188/6164 · also Frank J. Jiang · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0001-6653-5508ORCID · 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 · 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
1 paper
Motion planning and robot control · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
reachability analysis
0.612022
Enhancing Data-Driven Reachability Analysis using Temporal Logic Side Information · ICRA 2022
Logic in computer science › temporal logic
signal temporal logic
0.212022
Enhancing Data-Driven Reachability Analysis using Temporal Logic Side Information · ICRA 2022
Logic in computer science
temporal logic
0.212022
Enhancing Data-Driven Reachability Analysis using Temporal Logic Side Information · ICRA 2022

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

signal temporal logic · 1.1data-driven reachability analysis · 1.1
YearPublicationVenuePosition
2024 Small-Scale Testbed for Evaluating C-V2X Applications on 5G Cellular Networks
abstract
In this work, we present a small-scale testbed for evaluating the real-life performance of cellular V2X (C-V2X) applications on 5G cellular networks. Despite the growing interest and rapid technology development for V2X applications, researchers still struggle to prototype V2X applications with real wireless networks, hardware, and software in the loop in a controlled environment. To help alleviate this challenge, we present a testbed designed to accelerate development and evaluation of C-V2X applications on 5G cellular networks. By including a small-scale vehicle platform into the testbed design, we significantly reduce the time and effort required to test new C-V2X applications on 5G cellular networks. With a focus around the integration of small-scale vehicle platforms, we detail the design decisions behind the full software and hardware setup of commonly needed intelligent transport system agents (e.g. sensors, servers, vehicles). Moreover, to showcase the testbed’s capability to produce industrially-relevant, real world performance evaluations, we present an evaluation of a simple test case inspired from shared situational awareness. Finally, we discuss the upcoming use of the testbed for evaluating 5G cellular network-based shared situational awareness and other C-V2X applications.
Kaj Munhoz Arfvidsson, Kleio Fragkedaki, Frank Jiang 0003, Vandana Narri, Hans-Cristian Lindh, Karl Henrik Johansson, Jonas Mårtensson 0001
IV3
2024 Ensuring Safety at Intelligent Intersections: Temporal Logic Meets Reachability Analysis
abstract
In this work, we propose an approach for ensuring the safety of vehicles passing through an intelligent intersection. There are many proposals for the design of intelligent intersections that introduce central decision-makers to intersections for enhancing the efficiency and safety of the vehicles. To guarantee the safety of such designs, we develop a safety framework for intersections based on temporal logic and reachability analysis. We start by specifying the required behavior for all the vehicles that need to pass through the intersection as linear temporal logic formula. Then, using temporal logic trees, we break down the linear temporal logic specification into a series of Hamilton-Jacobi reachability analyses in an automated fashion. By successfully constructing the temporal logic tree through reachability analysis, we verify the feasibility of the intersection specification. By taking this approach, we enable a safety framework that is able to automatically provide safety guarantees on new intersection behavior specifications. To evaluate our approach, we implement the framework on a simulated T-intersection, where we show that we can check and guarantee the safety of vehicles with potentially conflicting paths.
Kaj Munhoz Arfvidsson, Frank Jiang 0003, Karl Henrik Johansson, Jonas Mårtensson 0001
IV2
2022 Enhancing Data-Driven Reachability Analysis using Temporal Logic Side Information
abstract
This paper presents algorithms for performing data-driven reachability analysis under temporal logic side information. In certain scenarios, the data-driven reachable sets of a robot can be prohibitively conservative due to the inherent noise in the robot's historical measurement data. In the same scenarios, we often have side information about the robot's expected motion (e.g., limits on how much a robot can move in a one-time step) that could be useful for further specifying the reachability analysis. In this work, we show that if we can model this side information using a signal temporal logic (STL) fragment, we can constrain the data-driven reachability analysis and safely limit the conservatism of the computed reachable sets. Moreover, we provide formal guarantees that, even after incorporating side information, the computed reachable sets still properly over-approximate the robot's future states. Lastly, we empirically validate the prac-ticality of the over-approximation by computing constrained, data-driven reachable sets for the Small- Vehicles-for-Autonomy (SVEA) hardware platform in two driving scenarios.
Amr Al-Anwar 0001, Frank Jiang 0003, Maryam Sharifi, Dimos V. Dimarogonas, Karl Henrik Johansson
ICRA2