arXiv subjects
Publications and source records attributed to Ajeet Kumar.
A large mode area single-mode optical fibre based on leaky mode filtering was prepared by MCVD. The cladding structure discriminates the fundamental mode from the higher order ones. A preliminary version has 25-$μ$m core diameter and 0.11 numerical aperture. A Gaussian-like mode with 22-$μ$m MFD is observed after 3-m propagation, in agreement with modeling.
We present a co-axial dual-core resonant leaky optical fibre design, in which the outer core is made highly leaky. A suitable choice of parameters can enable us to resonantly couple power from the inner core to the outer core. In a large-core fibre, such a resonant coupling can considerably increase the differential leakage loss between the fundamental and the higher order modes and can result in effective single-mode operation. In a small-core single-mode fibre, such a coupling can lead to sharp increase in the wavelength dependent leakage loss near the resonant wavelength and can be utilized for the suppression of amplified spontaneous emission and thereby gain equalization of an optical amplifier. We study the propagation characteristics of the fibre using the transfer matrix method and present an example of each, the large-mode-area design for high power amplifiers and the wavelength tunable leakage loss design for inherent gain equalization of optical amplifiers.
We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget" remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian "marching" method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced "weighted sum" based algorithm for the same problem. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.