Siddhartha Satish Mehta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Siddhartha Satish Mehta has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Chau Ton
Southwest Research Institute, San Antonio, TX, USA
4 shared publications - Baike She
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA
3 shared publications - Warren E. Dixon
Department of Mechanical and Aerospace Engineering, University of Florida, Gainesville, FL, USA
3 shared publications Z. Kan
Dept. of Mechanical Eng., University of Iowa, Iowa City, IA USA
3 shared publications- Zhen Kan
University of Science and Technology of China
3 shared publications C. Ton
Air Force Research Lab., Space Vehicles Directorate, Kirtland AFB, NM USA
2 shared publications
Latest Publications
- Open Access
- 31 October 2025
- Published by Elsevier in Smart Agricultural Technology
- Vol. 12
Spray deposition and coverage on nursery trees from precision applications of a laser-guided variable-rate spray system
- 31 October 2025
- Published by Elsevier in Smart Agricultural Technology
- Vol. 12
Open AccessSpray deposition and coverage on nursery trees from precision applications of a laser-guided variable-rate spray system
- Open Access
- 22 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 325 (1) , 204-218
A simplicial homology approach for assessing and rectifying coverage of sensor networks for improved crop management
- 22 March 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 325 (1) , 204-218
Open AccessA simplicial homology approach for assessing and rectifying coverage of sensor networks for improved crop management
- 28 July 2021
- Published by Springer Nature
- p. 213-238
Control Techniques in Robotic Harvesting
- 5 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (7) , 3205-3212
Characterizing Energy-Related Controllability of Composite Complex Networks via Graph Product
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.
- 5 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (7) , 3205-3212
Characterizing Energy-Related Controllability of Composite Complex Networks via Graph Product
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.
- 19 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (7) , 3325-3330
Energy-Related Controllability of Signed Complex Networks With Laplacian Dynamics
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.
- 19 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (7) , 3325-3330
Energy-Related Controllability of Signed Complex Networks With Laplacian Dynamics
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.
- 9 May 2019
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 356 (10) , 5001-5026
New approach to visual servo control using terminal constraints
- 9 May 2019
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 356 (10) , 5001-5026
New approach to visual servo control using terminal constraints
- 19 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 50 (1) , 222-232
Controllability Ensured Leader Group Selection on Signed Multiagent Networks
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 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 50 (1) , 222-232
Controllability Ensured Leader Group Selection on Signed Multiagent Networks
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.
- 29 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (4) , 671-683
A Two-Stage Stochastic Optimization Approach for Detecting Structurally Stable Clusters in Randomly Changing Graphs
We introduce a stochastic extension of the problem of finding nonhereditary subgraphs of maximum size in randomly changing graphs. The proposed formulation utilizes a two-stage stochastic optimization framework for identifying subgraphs whose structural properties can be preserved and repaired whenever the underlying graph's topology changes randomly. Particular focus is placed on finding nonhereditary subgraphs that represent a diameter-based clique relaxation known as an s-club. A combinatorial branch-and-bound algorithm is developed and demonstrated to be computationally effective on various configurations of random and real-life graphs.
- 29 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (4) , 671-683
A Two-Stage Stochastic Optimization Approach for Detecting Structurally Stable Clusters in Randomly Changing Graphs
We introduce a stochastic extension of the problem of finding nonhereditary subgraphs of maximum size in randomly changing graphs. The proposed formulation utilizes a two-stage stochastic optimization framework for identifying subgraphs whose structural properties can be preserved and repaired whenever the underlying graph's topology changes randomly. Particular focus is placed on finding nonhereditary subgraphs that represent a diameter-based clique relaxation known as an s-club. A combinatorial branch-and-bound algorithm is developed and demonstrated to be computationally effective on various configurations of random and real-life graphs.
- 16 November 2017
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 36 (4) , 463-483
Obstacle avoidance control of a human-in-the-loop mobile robot system using harmonic potential fields
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.
- 16 November 2017
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 36 (4) , 463-483
Obstacle avoidance control of a human-in-the-loop mobile robot system using harmonic potential fields
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.
- 1 December 2015
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 352 (12) , 5569-5598
Vision-based navigation and guidance of a sensorless missile
- 1 December 2015
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 352 (12) , 5569-5598
Vision-based navigation and guidance of a sensorless missile