Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Puneet Singla

dblp:43/1428 · DBLP profile ↗
← Back
11ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-2441-2531ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › sensor network query processing
in-network query processing
0.112009
An In-Network Querying Framework for Wireless Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2009
Internet of things and sensor networks
wireless sensor network
0.112009
An In-Network Querying Framework for Wireless Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2009
Query processing and optimization
range query
0.012009
An In-Network Querying Framework for Wireless Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2009
YearPublicationVenuePosition
2025 Tracking of Uncooperative Targets Using Reachability Analysis
abstract
This paper presents a nonlinear filter to track a maneuvering target while accounting for a priori information about its maneuvering capabilities. The idea is to compute the probabilistic reachable set of the target given a priori distributions for its initial condition and maneuvering capabilities between two measurement time intervals. A non-product quadrature scheme, the Conjugate Unscented Transformation (CUT), is used to compute the statistical moments of the target state accurately with a minimal number of samples. A minimum variance framework is used to assimilate sensor observation with model prediction to estimate the target state and corresponding state covariance. The performance of the derived filter is benchmarked against a conventional sigma-point filter by considering the problem of tracking an automobile on a road network.
Ryan Banks Glenn, Puneet Singla
FUSION2
2017 Visual feedback control of tensegrity robotic systems
abstract
Feedback control problems pertaining to the control of tensegrity robotic systems are detailed in this paper. The unique problems that arise due to the positivity of the string tensions required to maintain the static stability and desirable stiffness of the structural system are shown to bring about interesting opportunities to optimize for the redundancy in the actuation process. The static stability consideration, coupled with the nonlinear dynamics and the sensor models introduce additional algebraic constraints in implementation of both kinematic and model based dynamic controllers for tensegrity systems. Approaches to develop kinematic and dynamic control techniques are detailed in this paper. A bench top experimental setup consisting of a simple tensegrity system is utilized to demonstrate the efficacy of the output feedback control approach developed in the paper. Near real time image measurements are utilized to drive the output error used in the control scheme.
Haresh Karnan, Raman Goyal, Manoranjan Majji, Robert E. Skelton, Puneet Singla
IROS5
2014 A model error formulation of the multiple model adaptive estimation algorithm
Christopher K. Nebelecky, John L. Crassidis, Puneet Singla
FUSION3
2010 Approximate propagation of both epistemic and aleatory uncertainty through dynamic systems
Gabriel Terejanu, Puneet Singla, Tarunraj Singh, Peter D. Scott
FUSION2
2009 Uncertainty propagation in puff-based dispersion models using polynomial chaos
Umamaheswara Konda, Tarunraj Singh, Puneet Singla, Peter D. Scott
FUSION3
2009 A multiresolution approach for modeling of diffusion phenomenon
Reza Madankan, Puneet Singla, Tarunraj Singh, Peter D. Scott
FUSION2
2009 Decision based uncertainty propagation using adaptive Gaussian mixtures
Gabriel Terejanu, Puneet Singla, Tarunraj Singh, Peter D. Scott
FUSION2
2009 A Novel and Robust Algorithm to Model Handwriting Skill for Haptic Applications
abstract
A necessary step to building effective writing skill training system requires developing good methods for modeling human skill adequately. A number of groups have represented character information in various languages for writing skill based on trajectory information. These methods are often data intensive, tedious to implement and do not encode force information. To overcome these restrictions a novel present a novel modeling methodology that has good accuracy, robustness, flexibility and encodes force information involved in writing characters. This modeling methodology, based on Global-Local Approximation technique, has the capability to provide temporal force or position information independent of time, decoupling velocity information of the sample data used to capture skilled tasks. This modeling approach can be extended many human skilled tasks such as surgery, art and sports.
Govindarajan Srimathveeravalli, Puneet Singla, Thenkurussi Kesavadas
SMC3
2009 An In-Network Querying Framework for Wireless Sensor Networks
abstract
In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network querying in a distributed, lightweight, resilient, and energy-efficient manner. We address these challenges by exploiting location information and the geometry of the network and propose an in-network querying framework, namely, the Distributed Quad-Tree (DQT). DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor (2radic(2) in our case) of the distance *d* to the event. DQT construction is local and does not require any communication. Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes. Since event-based querying is inherently limited to the anticipated types of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use a multiresolution algorithm, which is optimal with respect to least square errors that models the data in a decentralized way. Our model-based scheme answers queries with approximate values accompanied by certainty levels with increased resolution at lower layers of the DQT hierarchy. Our analysis and experiments show that our framework achieves distance sensitivity and resiliency for event-based querying, as well as greatly reduces the cost of complex range querying.
Murat Demirbas, Xuming Lu, Puneet Singla
IEEE Trans. Parallel Distributed Syst.3
2008 A novel Gaussian Sum Filter Method for accurate solution to the nonlinear filtering problem
Gabriel Terejanu, Puneet Singla, Tarunraj Singh, Peter D. Scott
FUSION2
2007 Direction-Dependent Learning Approach for Radial Basis Function Networks
abstract
Direction-dependent scaling, shaping, and rotation of Gaussian basis functions are introduced for maximal trend sensing with minimal parameter representations for input output approximation. It is shown that shaping and rotation of the radial basis functions helps in reducing the total number of function units required to approximate any given input-output data, while improving accuracy. Several alternate formulations that enforce minimal parameterization of the most general radial basis functions are presented. A novel "directed graph" based algorithm is introduced to facilitate intelligent direction based learning and adaptation of the parameters appearing in the radial basis function network. Further, a parameter estimation algorithm is incorporated to establish starting estimates for the model parameters using multiple windows of the input-output data. The efficacy of direction-dependent shaping and rotation in function approximation is evaluated by modifying the minimal resource allocating network and considering different test examples. The examples are drawn from recent literature to benchmark the new algorithm versus existing methods.
Puneet Singla, Kamesh Subbarao, John L. Junkins
IEEE Trans. Neural Networks1