Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Kamale, Disha"'
This paper presents a novel framework for inferring timed temporal logic properties from data. The dataset comprises pairs of finite-time system traces and corresponding labels, denoting whether the traces demonstrate specific desired behaviors, e.g.
Externí odkaz:
http://arxiv.org/abs/2407.21090
Autor:
Kamale, Disha, Vasile, Cristian-Ioan
In this work, we address the problem of control synthesis for a homogeneous team of robots given a global temporal logic specification and formal user preferences for relaxation in case of infeasibility. The relaxation preferences are represented as
Externí odkaz:
http://arxiv.org/abs/2406.01848
In this work, we consider the problem of autonomous exploration in search of targets while respecting a fixed energy budget. The robot is equipped with an incremental-resolution symbolic perception module wherein the perception of targets in the envi
Externí odkaz:
http://arxiv.org/abs/2309.07347
Autor:
Khan, Muhammad Arshad, Kenney, Max, Painter, Jack, Kamale, Disha, Batista-Navarro, Riza, Ghalamzan-E, Amir
In this paper, we present a grammar-based natural language framework for robot programming, specifically for pick-and-place tasks. Our approach uses a custom dictionary of action words, designed to store together words that share meaning, allowing fo
Externí odkaz:
http://arxiv.org/abs/2304.02993
We develop a novel framework to assess the risk of misperception in a traffic sign classification task in the presence of exogenous noise. We consider the problem in an autonomous driving setting, where visual input quality gradually improves due to
Externí odkaz:
http://arxiv.org/abs/2303.09416
This work presents a step towards utilizing incrementally-improving symbolic perception knowledge of the robot's surroundings for provably correct reactive control synthesis applied to an autonomous driving problem. Combining abstract models of motio
Externí odkaz:
http://arxiv.org/abs/2209.09818
In this paper, we introduce an automata-based framework for planning with relaxed specifications. User relaxation preferences are represented as weighted finite state edit systems that capture permissible operations on the specification, substitution
Externí odkaz:
http://arxiv.org/abs/2107.13650