Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Nikos Arechiga"'
Publikováno v:
Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control.
Publikováno v:
2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC).
Publikováno v:
Algorithmic Foundations of Robotics XIV ISBN: 9783030667221
WAFR
WAFR
This paper presents a technique, named stlcg, to compute the quantitative semantics of Signal Temporal Logic (STL) formulas using computation graphs. stlcg provides a platform which enables the incorporation of logical specifications into robotics pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::265a77d6baea7bfb92fc3f4835ea39c0
https://doi.org/10.1007/978-3-030-66723-8_26
https://doi.org/10.1007/978-3-030-66723-8_26
Publikováno v:
ITSC
We present an approach to interpret parameterized policies through the lens of Signal Temporal Logic (STL). By providing a formally-specified description of desired behaviors we want the policy to produce, we can identify clusters in the parameter sp
Publikováno v:
International Journal on Software Tools for Technology Transfer. 23:827-827
Publikováno v:
2019 IEEE Intelligent Vehicles Symposium (IV).
This paper proposes a method to evaluate Signal Temporal Logic (STL) robustness formulas using computation graphs. This method results in efficient computations and enables the use of backpropagation for optimizing over STL parameters. Inferring STL
Autor:
Nikos Arechiga
Publikováno v:
2019 IEEE Intelligent Vehicles Symposium (IV).
We develop a set of contracts for autonomous control software that ensures that if all traffic participants follow the contracts, the overall traffic system will be collision-free. We express our contracts in Signal Temporal Logic (STL), a lightweigh
Autor:
Sicun Gao, Armando Solar-Lezama, Nikos Arechiga, Nima Roohi, Jyotirmoy V. Deshmukh, Soonho Kong, James Kapinski
Publikováno v:
Computer Aided Verification ISBN: 9783030255428
CAV (2)
CAV (2)
We formulate numerically-robust inductive proof rules for unbounded stability and safety properties of continuous dynamical systems. These induction rules robustify standard notions of Lyapunov functions and barrier certificates so that they can tole
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc5de8be2f7af4e391252c7785eaaa80
https://doi.org/10.1007/978-3-030-25543-5_9
https://doi.org/10.1007/978-3-030-25543-5_9
Autor:
Jason Scott, Masahiro Yamaura, Ted Bapty, Sandeep Neema, Shinichi Shiraishi, Nikos Arechiga, Scott Eisele, Joseph Hite
Publikováno v:
SAE International Journal of Passenger Cars - Electronic and Electrical Systems. 9:22-29
Publikováno v:
International Journal on Software Tools for Technology Transfer. 18:67-91
This paper is a tutorial on how to model hybrid systems as hybrid programs in differential dynamic logic and how to prove complex properties about these complex hybrid systems in KeYmaera, an automatic and interactive formal verification tool for hyb