SearcharxivSearch

arXiv subjects

Vinodhini Comandur

Publications and source records attributed to Vinodhini Comandur.

3 recordsLinked to original sources

Dependent Reachable Sets for the Constant Bearing Pursuit Strategy

This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed \emph{dependent reachable set}, is characterized using the constant bearing pursuit strategy as a case study. Key theoretical results are presented that provide geometric bounds for the associated dependent reachable set. Simulation results are presented to empirically establish the shape of the dependent reachable set. In the process, an original optimization problem is formulated and analyzed for the constant bearing pursuit strategy.

eess.SY

Desensitization and Deception in Differential Games with Asymmetric Information

Desensitization addresses safe optimal planning under parametric uncertainties by providing sensitivity function-based risk estimates. This paper expands upon the existing work on desensitization in optimal control to address safe planning for a class of two-player differential games. In the proposed game, parametric uncertainties correspond to variations of the model parameters for each player about their nominal values. The two players in the proposed formulation are assumed to have perfect information about these nominal parameter values. However, it is assumed that only one of the players has complete knowledge of the actual parameter value, resulting in information asymmetry in the proposed game. This lack of knowledge regarding the parameter variations is expected to result in state constraint violations for the player with an information disadvantage. In this regard, a desensitized feedback strategy that provides safe trajectories is proposed for the player with incomplete information. The proposed feedback strategy is evaluated for instances involving a single pursuer and a single evader with an uncertain moving obstacle, where the pursuer is assumed to only know the nominal value of the obstacle's speed. At the same time, the evader knows the obstacle's true speed, and also the fact that the pursuer knows only the nominal value of the obstacle's speed. Subsequently, deceptive strategies are proposed for the evader, who has an information advantage, and these strategies are assessed against the pursuer's desensitized strategy.

eess.SY

Safe Optimal Control under Parametric Uncertainties

We address the issue of safe optimal path planning under parametric uncertainties using a novel regularizer that allows trading off optimality with safety. The proposed regularizer leverages the notion that collisions may be modeled as constraint violations in an optimal control setting in order to produce open-loop trajectories with reduced risk of collisions. The risk of constraint violation is evaluated using a state-dependent relevance function and first-order variations in the constraint function with respect to parametric variations. The approach is generic and can be adapted to any optimal control formulation that deals with constraints under parametric uncertainty. Simulations using a holonomic robot avoiding multiple dynamic obstacles with uncertain velocities are used to demonstrate the effectiveness of the proposed approach. Finally, we introduce the car vs. train problem to emphasize the dependence of the resultant risk aversion behavior on the form of the constraint function used to derive the regularizer.

cs.RO