Siddhartha Mehta

Dr. Siddhartha Mehta

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
19 September 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
BSBaike She
Baike She
SMSiddhartha Mehta
Siddhartha Mehta
CTChau Ton
Chau Ton
ZKZhen Kan
Zhen Kan
Leader-follower controllability on signed multiagent networks is investigated in this paper. Specifically, we consider a dynamic signed multiagent network, where the agents interact via neighbor-based Laplacian feedback and the network allows positive and negative edges to capture cooperative and competitive interactions among agents. The agents are classified as either leaders or followers, thus forming a leader-follower signed network. To enable full control of the leader-follower signed network, controllability ensured leader group selection approaches are investigated in this paper, that is, identifying a small subset of nodes in the signed network, such that the selected nodes are able to drive the network to a desired behavior, even in the presence of antagonistic interactions. In particular, graphical characterizations of the controllability of signed networks are first developed based on the investigation of the interaction between network topology and agent dynamics. Since signed path and cycle graphs are basic building blocks for a variety of networks, the developed topological characterizations are then exploited to develop leader selection methods for signed path and cycle graphs to ensure leader-follower controllability. Along with illustrative examples, heuristic algorithms are also developed showing how leader selection methods developed for path and cycle graphs can be potentially extended to more general signed networks. In contrast to existing results that mainly focus on unsigned networks, this paper characterizes controllability and develops leader selection methods for signed networks. In addition, the developed results are generic, in the sense that they are not only applicable to signed networks but also to unsigned networks, since unsigned networks are a particular case of signed networks that only contain positive edges.

19 August 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BSBaike She
Baike She
SMSiddhartha Mehta
Siddhartha Mehta
CTChau Ton
Chau Ton
ZKZhen Kan
Zhen Kan
This paper investigates energy-related controllability of complex networks. Specifically, our objective is to establish controllability characteristics on signed complex networks, where the network units interact via neighbor-based Laplacian feedback and the network admits positive and negative edges to capture cooperative and competitive interactions among these units. The network units can be classified into leaders and followers. This work focuses on characterizing the energy-related controllability in signed networks (i.e., the energy incurred by the leaders in the control of a network). To this end, controllability Gramian based measures are exploited to quantify the difficulty of the control problem on signed networks in terms of the required control energy. Fundamental relationships between these measures and network topology are developed via graph Laplacian to characterize energy-related controllability. It is revealed that, for structurally unbalanced signed graphs, the energy-related controllability is closely related to the diagonal entries of the inverse of the graph Laplacian.

16 November 2017 in Robotica
Verified
Journal Article
Closed access
PDF file
CTC. Ton
C. Ton
ZKZ. Kan
Z. Kan
SMSiddhartha Mehta
Siddhartha Mehta
SUMMARY: This paper considers applications where a human agent is navigating a semi-autonomous mobile robot in an environment with obstacles. The human input to the robot can be based on a desired navigation objective, which may not be known to the robot. Additionally, the semi-autonomous robot can be programmed to ensure obstacle avoidance as it navigates the environment. A shared control architecture can be used to appropriately fuse the human and the autonomy inputs to obtain a net control input that drives the robot. In this paper, an adaptive, near-continuous control allocation function is included in the shared controller, which continuously varies the control effort exerted by the human and the autonomy based on the position of the robot relative to obstacles. The developed control allocation function facilitates the human to freely navigate the robot when away from obstacles, and it causes the autonomy control input to progressively dominate as the robot approaches obstacles. A harmonic potential field-based non-linear sliding mode controller is developed to obtain the autonomy control input for obstacle avoidance. In addition, a robust feed-forward term is included in the autonomy control input to maintain stability in the presence of adverse human inputs, which can be critical in applications such as to prevent collision or roll-over of smart wheelchairs due to erroneous human inputs. Lyapunov-based stability analysis is presented to guarantee finite-time stability of the developed shared controller, i.e., the autonomy guarantees obstacle avoidance as the human navigates the robot. Experimental results are provided to validate the performance of the developed shared controller.

5 October 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BSB. She
B. She
SMSiddhartha Mehta
Siddhartha Mehta
EDE. Doucette
E. Doucette
CTC. Ton
C. Ton
ZKZ. Kan
Z. Kan
This article characterizes the energy-related controllability of composite complex networks. We consider a class of composite networks constructed from simple factor networks via Cartesian product. The considered factor networks are leader-follower signed networks with neighbor-based Laplacian dynamics, adopting positive and negative edges to capture cooperative and competitive interactions among network units. Different from most existing works focusing on classical controllability, this article investigates the controllability of composite networks from energy-related perspectives. Specifically, controllability Gramian-based metrics, including average controllability and volumetric control energy, are characterized based on the Cartesian graph product, which reveals how the energy-related controllability of a composite network can be inferred from the spectral properties of the local factor systems. These results are then extended to layered control networks, a special, yet widely used, network structure in many man-made systems. Since structural balance is a key topological property of signed networks, a necessary and sufficient condition to verify the structural balance of composite signed networks is developed, which is applicable to generalized graph product.

1 December 2015 in Journal of the Franklin Institute
Verified
Journal Article
Closed access
SMSiddhartha Mehta
Siddhartha Mehta
CTC. Ton
C. Ton
ZKZ. Kan
Z. Kan
JCJ.W. Curtis
J.W. Curtis

9 May 2019 in Journal of the Franklin Institute
Verified
Journal Article
Closed access
SMSiddhartha Mehta
Siddhartha Mehta
CTC. Ton
C. Ton
MRM. Rysz
M. Rysz
ZKZ. Kan
Z. Kan
EDE.A. Doucette
E.A. Doucette
JCJ.W. Curtis
J.W. Curtis