Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Vinod, Abraham P."'
Autor:
Li, Sarah H. Q., Vinod, Abraham P.
We formulate a Markov potential game with final-time reach-avoid objectives by integrating potential game theory with stochastic reach-avoid control. Our focus is on multi-player trajectory planning where players maximize the same multi-player reach-
Externí odkaz:
http://arxiv.org/abs/2410.17690
Autor:
Vinod, Abraham P.
This paper introduces pycvxset, a new Python package to manipulate and visualize convex sets. We support polytopes and ellipsoids, and provide user-friendly methods to perform a variety of set operations. For polytopes, pycvxset supports the standard
Externí odkaz:
http://arxiv.org/abs/2410.11430
We study the problem of computing robust controllable sets for discrete-time linear systems with additive uncertainty. We propose a tractable and scalable approach to inner- and outer-approximate robust controllable sets using constrained zonotopes,
Externí odkaz:
http://arxiv.org/abs/2403.13730
Autor:
Safaoui, Sleiman, Vinod, Abraham P., Chakrabarty, Ankush, Quirynen, Rien, Yoshikawa, Nobuyuki, Di Cairano, Stefano
We consider the problem of safe multi-agent motion planning for drones in uncertain, cluttered workspaces. For this problem, we present a tractable motion planner that builds upon the strengths of reinforcement learning and constrained-control-based
Externí odkaz:
http://arxiv.org/abs/2311.00063
We study the problem of data-driven, constrained control of unknown nonlinear dynamics from a single ongoing and finite-horizon trajectory. We consider a one-step optimal control problem with a smooth, black-box objective, typically a composition of
Externí odkaz:
http://arxiv.org/abs/2206.11103
Consider a robot operating in an uncertain environment with stochastic, dynamic obstacles. Despite the clear benefits for trajectory optimization, it is often hard to keep track of each obstacle at every time step due to sensing and hardware limitati
Externí odkaz:
http://arxiv.org/abs/2203.02816
We study the problem of securely communicating a sequence of information bits with a client in the presence of multiple adversaries at unknown locations in the environment. We assume that the client and the adversaries are located in the far-field re
Externí odkaz:
http://arxiv.org/abs/2103.00630
Autor:
Nikhil Sahai, Dilesh Kumar Arunachalam, Tim Morris, Andrew Copas, Prasanna Samuel, Venkata Raghava Mohan, Vinod Abraham, Joshua Anish Selwyn, Praveen Kumar, Winsley Rose, Veeraraghavan Balaji, Gagandeep Kang, Jacob John
Publikováno v:
Trials, Vol 24, Iss 1, Pp 1-10 (2023)
Abstract Background Typhoid fever causes nearly 110,000 deaths among 9.24 million cases globally and disproportionately affects developing countries. As a control measure in such regions, typhoid conjugate vaccines (TCVs) are recommended by the World
Externí odkaz:
https://doaj.org/article/37b6dceb9cf949a6a18dabb61cba903e
We present two first-order, sequential optimization algorithms to solve constrained optimization problems. We consider a black-box setting with a priori unknown, non-convex objective and constraint functions that have Lipschitz continuous gradients.
Externí odkaz:
http://arxiv.org/abs/2011.08997
We develop data-driven algorithms for reachability analysis and control of systems with a priori unknown nonlinear dynamics. The resulting algorithms not only are suitable for settings with real-time requirements but also provide provable performance
Externí odkaz:
http://arxiv.org/abs/2011.05524