Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Nader Motee"'
Autor:
Nader Motee, Qiyu Sun
Publikováno v:
SIAM Journal on Control and Optimization. 60:917-944
Publikováno v:
IEEE Transactions on Control of Network Systems. 9:197-209
Publikováno v:
IEEE Transactions on Control of Network Systems. :1-12
Publikováno v:
2022 IEEE 61st Conference on Decision and Control (CDC).
Publikováno v:
2022 American Control Conference (ACC).
Risk of Collision and Detachment in Vehicle Platooning: Time-Delay–Induced Limitations and Tradeoffs
Publikováno v:
IEEE Transactions on Automatic Control. 65:3544-3559
We quantify the value-at-risk of inter-vehicle collision and detachment for a class of platoons, which are governed by second-order dynamics in presence of communication time-delay and exogenous stochastic noise. Closed-form expressions for the risk
Autor:
Nader Motee, Hossein K. Mousavi
Publikováno v:
IEEE Robotics and Automation Letters. 5:3572-3579
We consider the robot localization problem with sparse visual feature selection. The underlying key property is that contributions of trackable features (landmarks) appear linearly in the information matrix of the corresponding estimation problem. We
Publikováno v:
Distributed Autonomous Robotic Systems ISBN: 9783030927899
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d224fe324b5c4d4bb7ca7dedb375a8a
https://doi.org/10.1007/978-3-030-92790-5_23
https://doi.org/10.1007/978-3-030-92790-5_23
We develop a framework to assess the risk of cascading collisions in a platoon of vehicles in the presence of exogenous noise and communication time-delay. The notion of Value-at-Risk (VaR) is adopted to quantify the risk of collision between vehicle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a53f1a69a92672bce3c2708912d42fa
http://arxiv.org/abs/2112.14692
http://arxiv.org/abs/2112.14692
Publikováno v:
IEEE Transactions on Automatic Control. 64:2457-2472
We analyze performance of a class of time-delay first-order consensus networks from a graph topological perspective and present methods to improve it. The performance is measured by network's square of H-2 norm and it is shown that it is a convex fun