Researcher profile

John S. Baras

John S. Baras contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

Variational Neural Belief Parameterizations for Robust Dexterous Grasping under Multimodal Uncertainty

Contact variability, sensing uncertainty, and external disturbances make grasp execution stochastic. Expected-quality objectives ignore tail outcomes and often select grasps that fail under adverse contact realizations. Risk-sensitive POMDPs address this failure mode, but many use particle-filter beliefs that scale poorly, obstruct gradient-based optimization, and estimate Conditional Value-at-Risk (CVaR) with high-variance approximations. We instead formulate grasp acquisition as variational inference over latent contact parameters and object pose, representing the belief with a differentiable Gaussian mixture. We use Gumbel-Softmax component selection and location-scale reparameterization to express samples as smooth functions of the belief parameters, enabling pathwise gradients through a differentiable CVaR surrogate for direct optimization of tail robustness. In simulation, our variational neural belief improves robust grasp success under contact-parameter uncertainty and exogenous force perturbations while reducing planning time by roughly an order of magnitude relative to particle-filter model-predictive control. On a serial-chain robot arm with a multifingered hand, we validate grasp-and-lift success under object-pose uncertainty against a Gaussian baseline. Both methods succeed on the tested perturbations, but our controller terminates in fewer steps and less wall-clock time while achieving a higher tactile grasp-quality proxy. Our learned belief also calibrates risk more accurately, keeping mean absolute calibration error below 0.14 across tested simulation regimes, compared with 0.58 for a Cross-Entropy Method planner.

preprint2023arXiv

Capacitated Beam Placement for Multi-beam Non-Geostationary Satellite Systems

Non-geostationary (NGSO) satellite communications systems have attracted a lot of attention both from industry and academia, over the past several years. Beam placement is among the major resource allocation problems in multi-beam NGSO systems. In this paper, we formulate the beam placement problem as a Euclidean disk cover optimization model. We aim at minimizing the number of placed beams while satisfying the total downlink traffic demand of targeted ground terminals without exceeding the capacity of the placed beams. We present a low-complexity deterministic annealing (DA)-based algorithm to solve the NP-hard optimization model for near-optimal solutions. We further propose an extended variant of the previous model to ensure the traffic assigned to the beams is balanced. We verify the effectiveness of our proposed methods by means of numerical experiments and show that our scheme is superior to the state-of-the-art methods in that it covers the ground users by fewer number of beams on average.

preprint2022arXiv

Actuator Scheduling for Linear Systems: A Convex Relaxation Approach

In this letter, we investigate the problem of actuator scheduling for networked control systems. Given a stochastic linear system with a number of actuators, we consider the case that one actuator is activated at each time. This problem is combinatorial in nature and NP hard to solve. We propose a convex relaxation to the actuator scheduling problem, and use its solution as a reference to design an algorithm for solving the original scheduling problem. Using dynamic programming arguments, we provide a suboptimality bound of our proposed algorithm. Furthermore, we show that our framework can be extended to incorporate multiple actuators scheduling at each time and actuation costs. A simulation example is provided, which shows that our proposed method outperforms a random selection approach and a greedy selection approach.

preprint2022arXiv

Codebook Design for Composite Beamforming in Next-generation mmWave Systems

In pursuance of the unused spectrum in higher frequencies, millimeter wave (mmWave) bands have a pivotal role. However, the high path-loss and poor scattering associated with mmWave communications highlight the necessity of employing effective beamforming techniques. In order to efficiently search for the beam to serve a user and to jointly serve multiple users it is often required to use a composite beam which consists of multiple disjoint lobes. A composite beam covers multiple desired angular coverage intervals (ACIs) and ideally has maximum and uniform gain (smoothness) within each desired ACI, negligible gain (leakage) outside the desired ACIs, and sharp edges. We propose an algorithm for designing such ideal composite codebook by providing an analytical closed-form solution with low computational complexity. There is a fundamental trade-off between the gain, leakage and smoothness of the beams. Our design allows to achieve different values in such trade-off based on changing the design parameters. We highlight the shortcomings of the uniform linear arrays (ULAs) in building arbitrary composite beams. Consequently, we use a recently introduced twin-ULA (TULA) antenna structure to effectively resolve these inefficiencies. Numerical results are used to validate the theoretical findings.

preprint2022arXiv

GAMEOPT: Optimal Real-time Multi-Agent Planning and Control for Dynamic Intersections

We propose GameOpt: a novel hybrid approach to cooperative intersection control for dynamic, multi-lane, unsignalized intersections. Safely navigating these complex and accident prone intersections requires simultaneous trajectory planning and negotiation among drivers. GameOpt is a hybrid formulation that first uses an auction mechanism to generate a priority entrance sequence for every agent, followed by an optimization-based trajectory planner that computes velocity controls that satisfy the priority sequence. This coupling operates at real-time speeds of less than 10 milliseconds in high density traffic of more than 10,000 vehicles/hr, 100 times faster than other fully optimization-based methods, while providing guarantees in terms of fairness, safety, and efficiency. Tested on the SUMO simulator, our algorithm improves throughput by at least 25%, time taken to reach the goal by 75%, and fuel consumption by 33% compared to auction-based approaches and signaled approaches using traffic-lights and stop signs.

preprint2022arXiv

Multi-user Beam Alignment in Presence of Multi-path

To overcome the high path-loss and the intense shadowing in millimeter-wave (mmWave) communications, effective beamforming schemes are required which incorporate narrow beams with high beamforming gains. The mmWave channel consists of a few spatial clusters each associated with an angle of departure (AoD). The narrow beams must be aligned with the channel AoDs to increase the beamforming gain. This is achieved through a procedure called beam alignment (BA). Most of the BA schemes in the literature consider channels with a single dominant path while in practice the channel has a few resolvable paths with different AoDs, hence, such BA schemes may not work correctly in the presence of multi-path or at the least do not exploit such multipath to achieve diversity or increase robustness. In this paper, we propose an efficient BA scheme in presence of multi-path. The proposed BA scheme transmits probing packets using a set of scanning beams and receives feedback for all the scanning beams at the end of the probing phase from each user. We formulate the BA scheme as minimizing the expected value of the average transmission beamwidth under different policies. The policy is defined as a function from the set of received feedback to the set of transmission beams (TB). In order to maximize the number of possible feedback sequences, we prove that the set of scanning beams (SB) has a special form, namely, Tulip Design. Consequently, we rewrite the minimization problem with a set of linear constraints and a reduced number of variables which is solved by using an efficient greedy algorithm.

preprint2021arXiv

Semi-linear Poisson-mediated Flocking in a Cucker-Smale Model

We propose a family of compactly supported parametric interaction functions in the general Cucker-Smale flocking dynamics such that the mean-field macroscopic system of mass and momentum balance equations with non-local damping terms can be converted from a system of partial integro-differential equations to an augmented system of partial differential equations in a compact set. We treat the interaction functions as Green's functions for an operator corresponding to a semi-linear Poisson equation and compute the density and momentum in a translating reference frame, i.e. one that is taken in reference to the flock's centroid. This allows us to consider the dynamics in a fixed, flock-centered compact set without loss of generality. We approach the computation of the non-local damping using the standard finite difference treatment of the chosen differential operator, resulting in a tridiagonal system which can be solved quickly.

preprint2020arXiv

Delay-sensitive Joint Optimal Control and Resource Management in Multi-loop Networked Control Systems

In the operation of networked control systems, where multiple processes share a resource-limited and time-varying cost-sensitive network, communication delay is inevitable and primarily influenced by, first, the control systems deploying intermittent sensor sampling to reduce the communication cost by restricting non-urgent transmissions, and second, the network performing resource management to minimize excessive traffic and eventually data loss. In a heterogeneous scenario, where control systems may tolerate only specific levels of sensor-to-controller latency, delay sensitivities need to be considered in the design of control and network policies to achieve the desired performance guarantees. We propose a cross-layer optimal co-design of control, sampling and resource management policies for an NCS consisting of multiple stochastic linear time-invariant systems which close their sensor-to-controller loops over a shared network. Aligned with advanced communication technology, we assume that the network offers a range of latency-varying transmission services for given prices. Local samplers decide either to pay higher cost to access a low-latency channel, or to delay sending a state sample at a reduced price. A resource manager residing in the network data-link layer arbitrates channel access and re-allocates resources if link capacities are exceeded. The performance of the local closed-loop systems is measured by a combination of linear-quadratic Gaussian cost and a suitable communication cost, and the overall objective is to minimize a defined social cost by all three policy makers. We derive optimal control, sampling and resource allocation policies under different cross-layer awareness models, including constant and time-varying parameters, and show that higher awareness generally leads to performance enhancement at the expense of higher computational complexity.

preprint2020arXiv

Interpretable machine learning models: a physics-based view

To understand changes in physical systems and facilitate decisions, explaining how model predictions are made is crucial. We use model-based interpretability, where models of physical systems are constructed by composing basic constructs that explain locally how energy is exchanged and transformed. We use the port Hamiltonian (p-H) formalism to describe the basic constructs that contain physically interpretable processes commonly found in the behavior of physical systems. We describe how we can build models out of the p-H constructs and how we can train them. In addition we show how we can impose physical properties such as dissipativity that ensure numerical stability of the training process. We give examples on how to build and train models for describing the behavior of two physical systems: the inverted pendulum and swarm dynamics.