Baris Fidan

SY
3papers
27citations
Novelty50%
AI Score23

3 Papers

SYAug 12, 2011
A Minimax Linear Quadratic Gaussian Method for Antiwindup Control Synthesis

Obaid ur Rehman, Ian R. Petersen, Baris Fidan

In this paper, a dynamic antiwindup compensator design is proposed which augments the main controller and guarantees robust performance in the event of input saturation. This is a two stage process in which first a robust optimal controller is designed for an uncertain linear system which guarantees the internal stability of the closed loop system and provides robust performance in the absence of input saturation. Then a minimax linear quadratic Gaussian (LQG) compensator is designed to guarantee the performance in certain domain of attraction, in the presence of input saturation. This antiwindup augmentation only comes into action when plant is subject to input saturation. In order to illustrate the effectiveness of this approach, the proposed method is applied to a tracking control problem for an air-breathing hypersonic flight vehicle (AHFV).

ROSep 16, 2021
Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning

Megnath Ramesh, Frank Imeson, Baris Fidan et al.

In this paper, we tackle the problem of planning an optimal coverage path for a robot operating indoors. Many existing approaches attempt to discourage turns in the path by covering the environment along the least number of coverage lines, i.e., straight-line paths. This is because turning not only slows down the robot but also negatively affects the quality of coverage, e.g., tools like cameras and cleaning attachments commonly have poor performance around turns. The problem of minimizing coverage lines however is typically solved using heuristics that do not guarantee optimality. In this work, we propose a turn-minimizing coverage planning method that computes the optimal number of axis-parallel (horizontal/vertical) coverage lines for the environment in polynomial time. We do this by formulating a linear program (LP) that optimally partitions the environment into axis-parallel ranks (non-intersecting rectangles of width equal to the tool width). We then generate coverage paths for a set of real-world indoor environments and compare the results with state-of-the-art coverage approaches.

SYSep 11, 2018
Planar Cooperative Extremum Seeking with Guaranteed Convergence Using A Three-Robot Formation

Anna Skobeleva, Baris Fidan, V. Ugrinovskii et al.

In this paper, a combined formation acquisition and cooperative extremum seeking control scheme is proposed for a team of three robots moving on a plane. The extremum seeking task is to find the maximizer of an unknown two-dimensional function on the plane. The function represents the signal strength field due to a source located at maximizer, and is assumed to be locally concave around maximizer and monotonically decreasing in distance to the source location. Taylor expansions of the field function at the location of a particular lead robot and the maximizer are used together with a gradient estimator based on signal strength measurements of the robots to design and analyze the proposed control scheme. The proposed scheme is proven to exponentially and simultaneously (i) acquire the specified geometric formation and (ii) drive the lead robot to a specified neighborhood disk around maximizer, whose radius depends on the specified desired formation size as well as the norm bounds of the Hessian of the field function. The performance of the proposed control scheme is evaluated using a set of simulation experiments.