TY - GEN
T1 - Computation-Aware Data-Driven Model Discrimination with Application to Driver Intent Identification
AU - Bhagwat, Mohit
AU - Jin, Zeyuan
AU - Yong, Sze Zheng
N1 - Funding Information:
M. Bhagwat, Z. Jin and S.Z. Yong are with School for Engineering of Matter, Transport and Energy, Arizona State Univ., Tempe, AZ 85287; (email: {mmbhagwa,zjin43,szyong}@asu.edu). This work was supported in part by DARPA grant D18AP00073 and NSF grant CNS-1943545. We acknowledge Research Computing at Arizona State University for providing High Performance Computing resources that have contributed to the results reported within this paper.
Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - In this paper, we consider the problem of designing a model discrimination algorithm for partially known systems, where only sampled data of the unknown dynamics are available. Leveraging data-driven abstraction methods to over-approximate the unknown dynamics and an incremental abstraction approach, we propose a method to find a pair of piecewise affine functions that "includes"all possible trajectories of the original unknown dynamics, which further simplify the data-driven abstraction and would scale better for high dimensional systems. Then, using the models from the abstraction method, we analyze the detectability of these models from noisy, finite data as well as design a model discrimination algorithm to rule out models that are inconsistent with a newly observed output trajectory, by checking the feasibility of mixed-integer linear programs. Moreover, we investigate the trade-off among the accuracy of abstraction models, the computational cost for obtaining reduced models and the guaranteed detection time T for distinguishing the models. Finally, we evaluate the effectiveness of our approach on a vehicle intent estimation example using the highD data set of naturalistic vehicle trajectories recorded on German highways.
AB - In this paper, we consider the problem of designing a model discrimination algorithm for partially known systems, where only sampled data of the unknown dynamics are available. Leveraging data-driven abstraction methods to over-approximate the unknown dynamics and an incremental abstraction approach, we propose a method to find a pair of piecewise affine functions that "includes"all possible trajectories of the original unknown dynamics, which further simplify the data-driven abstraction and would scale better for high dimensional systems. Then, using the models from the abstraction method, we analyze the detectability of these models from noisy, finite data as well as design a model discrimination algorithm to rule out models that are inconsistent with a newly observed output trajectory, by checking the feasibility of mixed-integer linear programs. Moreover, we investigate the trade-off among the accuracy of abstraction models, the computational cost for obtaining reduced models and the guaranteed detection time T for distinguishing the models. Finally, we evaluate the effectiveness of our approach on a vehicle intent estimation example using the highD data set of naturalistic vehicle trajectories recorded on German highways.
UR - http://www.scopus.com/inward/record.url?scp=85125998196&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85125998196&partnerID=8YFLogxK
U2 - 10.1109/CDC45484.2021.9683071
DO - 10.1109/CDC45484.2021.9683071
M3 - Conference contribution
AN - SCOPUS:85125998196
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 6848
EP - 6854
BT - 60th IEEE Conference on Decision and Control, CDC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 60th IEEE Conference on Decision and Control, CDC 2021
Y2 - 13 December 2021 through 17 December 2021
ER -