Ayesha Khan

Ayesha Khan

Auto-generated profile, based on publicly available information

Ayesha Khan

Georgia Inst Technol, North Ave NW, Atlanta, GA 30332 USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 August 2016 in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering
Verified
Journal Article
Closed access
MAMuhammad Abid
Muhammad Abid
AKAyesha Khan
Ayesha Khan
MHMasroor Hussain
Masroor Hussain
HWHafiz Abdul Wajid
Hafiz Abdul Wajid
This paper presents results of detailed nonlinear finite element analysis of gasketed bolted flange pipe joints of different sizes (1, 4, 5, 6, 8, 10, 20 in.) of 900# pressure class for achieving proper preload close to the target stress values with and without considering yielding at bolt and flange and gasket crushing recommended by ASME and industrial guidelines for optimized performance using customized optimization algorithm. In addition, two strategies torque control method and stretch control method are used which is a normal practice in the industry.

1 August 2017
Verified
Conference Paper
Closed access
AKAyesha Khan
Ayesha Khan
FZFumin Zhang
Fumin Zhang
In this paper, we propose using Long Short Term Memory Networks (LSTM) to serve as planners for bio-inspired robotic motion. LSTMs can learn long or short term correlations of sequential data. Using LSTM networks, we implement a motion planner using simulated fish trajectories. The motion or path planning unit can then be implemented on robots such that they can operate autonomously without knowing their absolute position in a global frame. Simulation results show that the planned path demonstrates characteristics that are similar to simulated fish trajectories. This work may lead to learning animal behavior and then formulating bio-inspired path planners for robots to operate in unknown environments.

29 July 2021 in Bioinspiration & Biomimetics
Verified
Journal Article
Closed access
AKAyesha Khan
Ayesha Khan
SASaid Al-Abri
Said Al-Abri
VMVivek Mishra
Vivek Mishra
FZFumin Zhang
Fumin Zhang
Dependence on constant availability to an external localization service is often unreliable and infeasible in mobile robots. In this paper, we take inspiration from a continuous fish motion model, the persistent turning Walker (PTW), to devise a strategy which is able to achieve 2D and 3D coverage in an unknown environment in the absence of a localization service, such as a global positioning system (GPS). This is achieved by converting the continuous-time dynamical system into a discrete-time Markov chain which is then shown to exhibit strongly connected properties that are verifiable through numerical methods. The aforementioned proposed framework can also be used to study the continuous-time dynamics of other biological systems and evaluate their properties. The performance of the PTW model is also compared with two existing random search strategies, simple random walks (SRW) and correlated random walks (CRW) by using analytical bounds, simulation results, and statistical tests. The simulation results show that the proposed PTW algorithm covers a given search-space at a faster rate compared to the CRW and SRW models. Hence, the PTW may be effectively used as a coverage strategy by mobile robots in underwater or underground environments where the availability of a GPS cannot be guaranteed at all times.

1 December 2016
Verified
Conference Paper
Closed access
AKAyesha Khan
Ayesha Khan
VMVivek Mishra
Vivek Mishra
FZFumin Zhang
Fumin Zhang
A novel bio-inspired strategy, the Hybrid Speeding Up Slowing Down (Hybrid SUSD) strategy, is introduced to achieve distributed control of a multi-agent system for the localization of multiple sources in a search space. Hybrid SUSD switches between bio-inspired exploration algorithms and exploitation algorithms. The exploration algorithms provide coverage of the workspace with non-zero probability. The exploitation algorithms leverage the SUSD strategy for source seeking without explicit gradient estimation. Conditions for switching between exploration and exploitation are developed based on measurements taken by an agent and the number of neighbors an agent may have. Given a confined search space, the convergence of the hybrid SUSD to locate a source is rigorously justified. Simulation results confirm that the strategy allows each agent to converge to one of the source locations. The Hybrid SUSD may be used as a distributed optimization algorithm that is able to find all minima of a function over a confined search space.