TY - GEN
T1 - Graph Temporal Logic Inference for Classification and Identification
AU - Xu, Zhe
AU - Nettekoven, Alexander J.
AU - Agung Julius, A.
AU - Topcu, Ufuk
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - Inferring spatial-temporal properties from data is important for many complex systems, such as additive manufacturing systems, swarm robotic systems and biological networks. Such systems can often be modeled as a labeled graph where labels on the nodes and edges represent relevant measurements such as temperatures and distances. We introduce graph temporal logic (GTL) which can express properties such as whenever a node's label is above 10, for the next 3 time units there are always at least two neighboring nodes with an edge label of at most 2 where the node labels are above 5. This paper is a first attempt to infer spatial (graph) temporal logic formulas from data for classification and identification. For classification, we infer a GTL formula that classifies two sets of graph temporal trajectories with minimal misclassification rate. For identification, we infer a GTL formula that is informative and is satisfied by the graph temporal trajectories in the dataset with high probability. The informativeness of a GTL formula is measured by the information gain with respect to given prior knowledge represented by a prior probability distribution. We implement the proposed approach to classify the graph patterns of tensile specimens built from selective laser sintering (SLS) process with varying strengths, and to identify informative spatial-temporal patterns from experimental data of the SLS cooldown process and simulation data of a swarm of robots.
AB - Inferring spatial-temporal properties from data is important for many complex systems, such as additive manufacturing systems, swarm robotic systems and biological networks. Such systems can often be modeled as a labeled graph where labels on the nodes and edges represent relevant measurements such as temperatures and distances. We introduce graph temporal logic (GTL) which can express properties such as whenever a node's label is above 10, for the next 3 time units there are always at least two neighboring nodes with an edge label of at most 2 where the node labels are above 5. This paper is a first attempt to infer spatial (graph) temporal logic formulas from data for classification and identification. For classification, we infer a GTL formula that classifies two sets of graph temporal trajectories with minimal misclassification rate. For identification, we infer a GTL formula that is informative and is satisfied by the graph temporal trajectories in the dataset with high probability. The informativeness of a GTL formula is measured by the information gain with respect to given prior knowledge represented by a prior probability distribution. We implement the proposed approach to classify the graph patterns of tensile specimens built from selective laser sintering (SLS) process with varying strengths, and to identify informative spatial-temporal patterns from experimental data of the SLS cooldown process and simulation data of a swarm of robots.
UR - http://www.scopus.com/inward/record.url?scp=85082491616&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85082491616&partnerID=8YFLogxK
U2 - 10.1109/CDC40024.2019.9029181
DO - 10.1109/CDC40024.2019.9029181
M3 - Conference contribution
AN - SCOPUS:85082491616
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 4761
EP - 4768
BT - 2019 IEEE 58th Conference on Decision and Control, CDC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 58th IEEE Conference on Decision and Control, CDC 2019
Y2 - 11 December 2019 through 13 December 2019
ER -